NOI批量评测 - 记录详情

foo.cc: In function 'void sol()':
foo.cc:28:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   28 |         cin>>s[0]+1>>s[1]+1>>t[0]+1>>t[1]+1;
      |              ~~~~^~
foo.cc:28:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   28 |         cin>>s[0]+1>>s[1]+1>>t[0]+1>>t[1]+1;
      |                      ~~~~^~
foo.cc:28:34: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   28 |         cin>>s[0]+1>>s[1]+1>>t[0]+1>>t[1]+1;
      |                              ~~~~^~
foo.cc:28:42: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   28 |         cin>>s[0]+1>>s[1]+1>>t[0]+1>>t[1]+1;
      |                                      ~~~~^~
foo.cc:36:70: warning: array subscript has type 'char' [-Wchar-subscripts]
   36 |         for(;it[0]<=n and it[1]<=n ;++it[0],++it[1],++v[0][s[0][it[0]]],++v[1][s[1][it[1]]])
      |                                                            ~~~~~~~~~~^
foo.cc:36:90: warning: array subscript has type 'char' [-Wchar-subscripts]
   36 |         for(;it[0]<=n and it[1]<=n ;++it[0],++it[1],++v[0][s[0][it[0]]],++v[1][s[1][it[1]]])
      |                                                                                ~~~~~~~~~~^
foo.cc:40:58: warning: array subscript has type 'char' [-Wchar-subscripts]
   40 |                                 ++it[j],++v[j][s[j][it[j]]];
      |                                                ~~~~~~~~~~^
foo.cc:46:50: warning: array subscript has type 'char' [-Wchar-subscripts]
   46 |                                 --v[0][s[0][it[0]]],--v[1][s[1][it[1]]];
      |                                        ~~~~~~~~~~^
foo.cc:46:70: warning: array subscript has type 'char' [-Wchar-subscripts]
   46 |                                 --v[0][s[0][it[0]]],--v[1][s[1][it[1]]];
      |                                                            ~~~~~~~~~~^
foo.cc:57:42: warning: array subscript has type 'char' [-Wchar-subscripts]
   57 |                         --v[0][s[0][it[0]]];
      |                                ~~~~~~~~~~^
foo.cc:71:42: warning: array subscript has type 'char' [-Wchar-subscripts]
   71 |                         --v[1][s[1][it[1]]];
      |                                ~~~~~~~~~~^
Expand

#	状态分数	耗时	内存占用

#1	Accepted 5	1ms	320 KiB
#2	Accepted 5	1ms	400 KiB
#3	Accepted 5	1ms	404 KiB
#4	Accepted 5	1ms	404 KiB
#5	Accepted 5	1ms	404 KiB
#6	Accepted 5	1ms	404 KiB
#7	Accepted 5	9ms	788 KiB
#8	Accepted 5	9ms	788 KiB
#9	Accepted 5	1ms	448 KiB
#10	Accepted 5	1ms	456 KiB
#11	Accepted 5	9ms	788 KiB
#12	Accepted 5	8ms	784 KiB
#13	Accepted 5	1ms	404 KiB
#14	Accepted 5	1ms	444 KiB
#15	Accepted 5	7ms	784 KiB
#16	Accepted 5	8ms	704 KiB
#17	Accepted 5	1ms	404 KiB
#18	Accepted 5	1ms	404 KiB
#19	Accepted 5	10ms	788 KiB
#20	Accepted 5	10ms	788 KiB

#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define fi first
#define se second
#define ls o<<1
#define rs o<<1|1

int ST=clock();
bool M1;

const int maxn=1e5+10;

int T,n;
char s[2][maxn],t[2][maxn];

int v[2][2],it[2];

inline void sol()
{
	memset(it,0,sizeof it);
	memset(v,0,sizeof v);
	
	cin>>n;
	cin>>s[0]+1>>s[1]+1>>t[0]+1>>t[1]+1;
	
	for(int i=1;i<=n;++i)
		s[0][i]-='0',s[1][i]-='0',t[0][i]-='0',t[1][i]-='0';
	t[0][0]=t[1][0]=1;
	
	int res=0;	
	
	for(;it[0]<=n and it[1]<=n ;++it[0],++it[1],++v[0][s[0][it[0]]],++v[1][s[1][it[1]]])
	{
		for(int j=0;j<=1;++j)
			while(it[j]<n and t[j][it[j]]==1)
				++it[j],++v[j][s[j][it[j]]];
		
		if(it[0]==it[1])
		{
			if(t[0][it[0]]==0 and t[1][it[1]]==0)
			{
				--v[0][s[0][it[0]]],--v[1][s[1][it[1]]];
				res+=min(v[0][0],v[1][0])+min(v[0][1],v[1][1])+(s[0][it[0]]==s[1][it[1]]);
			}
			else
				res+=min(v[0][0],v[1][0])+min(v[0][1],v[1][1]);
			memset(v,0,sizeof v);
			continue;
		}
		
		if(it[0]>it[1])
		{
			--v[0][s[0][it[0]]];
			--it[0];
			
			int d1=min(v[0][0],v[1][0]),d2=min(v[0][1],v[1][1]);
			
			res+=d1+d2;
			
			v[0][0]-=v[1][1]-d2+d1;
			v[0][1]-=v[1][0]-d1+d2;
				
			memset(v[1],0,sizeof v[1]);
		}
		else
		{
			--v[1][s[1][it[1]]];
			--it[1];
			
			int d1=min(v[0][0],v[1][0]),d2=min(v[0][1],v[1][1]);
			
			res+=d1+d2;
			
			v[1][0]-=v[0][1]-d2+d1;
			v[1][1]-=v[0][0]-d1+d2;
				
			memset(v[0],0,sizeof v[0]);
		}
	}
	
	cout<<res<<"\n";
}


bool M2;

int main()
{
	freopen("edit.in","r",stdin);
	freopen("edit.out","w",stdout);
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);

	cin>>T;
	while(T--)
		sol();

	cout.flush();
	fclose(stdin);
	fclose(stdout);
	return 0;
}

递交者: SC-0052
题目: NOIP2024AGF NOIP2024AGF
比赛: 【官方数据 SC】 NOIP2024 批量测试
语言: C++14(O2)
代码长度: 1.7 KiB
递交时间: 2024-12-6 16:59:36
评测时间: 2024-12-6 16:59:47

分数: 100
总耗时: 85ms
峰值时间: 10ms
峰值内存: 788 KiB

100 Accepted

代码

信息

100 Accepted

代码

信息

还没有账户？

登录