NOI批量评测 - 记录详情

foo.cc: In function 'int main()':
foo.cc:15:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   15 |                 cin>>s[0]+1;
      |                      ~~~~^~
foo.cc:16:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   16 |                 cin>>s[1]+1;
      |                      ~~~~^~
foo.cc:17:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   17 |                 cin>>t[0]+1;
      |                      ~~~~^~
foo.cc:18:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   18 |                 cin>>t[1]+1;
      |                      ~~~~^~
Expand

#	状态分数	耗时	内存占用

#1	Accepted 5	1ms	404 KiB
#2	Accepted 5	1ms	404 KiB
#3	Accepted 5	1ms	404 KiB
#4	Accepted 5	1ms	404 KiB
#5	Accepted 5	1ms	404 KiB
#6	Accepted 5	1ms	444 KiB
#7	Accepted 5	8ms	788 KiB
#8	Accepted 5	9ms	700 KiB
#9	Accepted 5	1ms	404 KiB
#10	Accepted 5	1ms	404 KiB
#11	Accepted 5	7ms	788 KiB
#12	Accepted 5	7ms	788 KiB
#13	Accepted 5	1ms	404 KiB
#14	Accepted 5	1ms	404 KiB
#15	Accepted 5	6ms	788 KiB
#16	Accepted 5	7ms	788 KiB
#17	Accepted 5	1ms	404 KiB
#18	Accepted 5	2ms	404 KiB
#19	Accepted 5	9ms	792 KiB
#20	Accepted 5	10ms	788 KiB

#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
int T,n,cnt[2][2],l,r,lr,rr,ans,lst[maxn],st;
char s[2][maxn],t[2][maxn];
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--){
		cin>>n;l=r=lr=rr=1;ans=0;st=0;
		cnt[0][0]=cnt[0][1]=cnt[1][0]=cnt[1][1]=0;
		cin>>s[0]+1;
		cin>>s[1]+1;
		cin>>t[0]+1;
		cin>>t[1]+1;
		t[0][0]='0';t[1][0]='0';t[0][n+1]='0';t[1][n+1]='0';
		cnt[0][s[0][1]-'0']++;cnt[1][s[1][1]-'0']++;
		while(t[0][lr]=='1'&&t[0][lr+1]=='1'&&lr+1<=n) lr++,cnt[0][s[0][lr]-'0']++;
		while(t[1][rr]=='1'&&t[1][rr+1]=='1'&&rr+1<=n) rr++,cnt[1][s[1][rr]-'0']++;
		while(l<=n&&r<=n){
			int Min=min(cnt[0][0],cnt[1][0]),Min_=min(cnt[0][1],cnt[1][1]);
			int len=min(lr,rr)-max(l,r)+1;
			ans+=min(Min+Min_,len);
//			cout<<l<<' '<<lr<<' '<<r<<' '<<rr<<' '<<Min+Min_<<' '<<len<<'\n';
//			cout<<"cnt:"<<cnt[0][0]<<' '<<cnt[0][1]<<' '<<cnt[1][0]<<' '<<cnt[1][1]<<'\n';
			if(lr<rr){
				if(Min+Min_<=len){
					cnt[1][0]-=Min;
					cnt[1][1]-=Min_;
				}else{
					if(Min_<Min){
						if(Min_>=len) cnt[1][1]-=len;
						else cnt[1][1]-=Min_,cnt[1][0]-=len-Min_;
					}else{
						if(Min>=len) cnt[1][0]-=len;
						else cnt[1][0]-=Min,cnt[1][1]-=len-Min;
					}
				}
				cnt[0][0]=cnt[0][1]=0;
				l=lr+1;
				cnt[0][s[0][l]-'0']++;
				lr=l;
				while(t[0][lr]=='1'&&t[0][lr+1]=='1'&&lr+1<=n) lr++,cnt[0][s[0][lr]-'0']++;
			}else if(lr>rr){
				if(Min+Min_<=len){
					cnt[0][0]-=Min;
					cnt[0][1]-=Min_;
				}else{
					if(Min_<Min){
						if(Min_>=len) cnt[0][1]-=len;
						else cnt[0][1]-=Min_,cnt[0][0]-=len-Min_;
					}else{
						if(Min>=len) cnt[0][0]-=len;
						else cnt[0][0]-=Min,cnt[0][1]-=len-Min;
					}
				}
				cnt[1][0]=cnt[1][1]=0;
				r=rr+1;
				cnt[1][s[1][r]-'0']++;
				rr=r;
				while(t[1][rr]=='1'&&t[1][rr+1]=='1'&&rr+1<=n) rr++,cnt[1][s[1][rr]-'0']++;
			}else{
				cnt[0][0]=cnt[0][1]=0;
				l=lr+1;
				cnt[0][s[0][l]-'0']++;
				lr=l;
				while(t[0][lr]=='1'&&t[0][lr+1]=='1'&&lr+1<=n) lr++,cnt[0][s[0][lr]-'0']++;
				cnt[1][0]=cnt[1][1]=0;
				r=rr+1;
				cnt[1][s[1][r]-'0']++;
				rr=r;
				while(t[1][rr]=='1'&&t[1][rr+1]=='1'&&rr+1<=n) rr++,cnt[1][s[1][rr]-'0']++;
			}
		}
		cout<<ans<<'\n';
	}
	return 0;
}

递交者: ZJ-0154
题目: NOIP2024AGF NOIP2024AGF
比赛: 【官方数据 ZJ】 NOIP2024 批量测试
语言: C++14(O2)
代码长度: 2.3 KiB
递交时间: 2024-12-6 18:00:07
评测时间: 2024-12-6 18:00:30

分数: 100
总耗时: 79ms
峰值时间: 10ms
峰值内存: 792 KiB

100 Accepted

代码

信息

100 Accepted

代码

信息

还没有账户？

登录