NOI批量评测 - 记录详情

foo.cc: In function 'int main()':
foo.cc:20:17: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   20 |                 for(int i=1;i<=n;i++) sy[i]=(scur[i-1]-'0');sy[nn]=0;
      |                 ^~~
foo.cc:20:61: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   20 |                 for(int i=1;i<=n;i++) sy[i]=(scur[i-1]-'0');sy[nn]=0;
      |                                                             ^~
foo.cc:22:17: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   22 |                 for(int i=1;i<=n;i++) sw[i]=(scur[i-1]-'0');sw[nn]=0;
      |                 ^~~
foo.cc:22:61: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   22 |                 for(int i=1;i<=n;i++) sw[i]=(scur[i-1]-'0');sw[nn]=0;
      |                                                             ^~
foo.cc:24:17: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   24 |                 for(int i=1;i<=n;i++) vy[i]=(scur[i-1]-'0');vy[nn]=0;
      |                 ^~~
foo.cc:24:61: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   24 |                 for(int i=1;i<=n;i++) vy[i]=(scur[i-1]-'0');vy[nn]=0;
      |                                                             ^~
foo.cc:26:17: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   26 |                 for(int i=1;i<=n;i++) vw[i]=(scur[i-1]-'0');vw[nn]=0;
      |                 ^~~
foo.cc:26:61: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   26 |                 for(int i=1;i<=n;i++) vw[i]=(scur[i-1]-'0');vw[nn]=0;
      |                                                             ^~
Expand

#	状态分数	耗时	内存占用

#1	Accepted 5	2ms	404 KiB
#2	Accepted 5	2ms	448 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	10ms	916 KiB
#8	Accepted 5	10ms	960 KiB
#9	Accepted 5	2ms	404 KiB
#10	Accepted 5	1ms	404 KiB
#11	Accepted 5	9ms	952 KiB
#12	Accepted 5	9ms	916 KiB
#13	Accepted 5	1ms	404 KiB
#14	Accepted 5	1ms	404 KiB
#15	Accepted 5	8ms	948 KiB
#16	Accepted 5	8ms	916 KiB
#17	Accepted 5	1ms	404 KiB
#18	Accepted 5	2ms	408 KiB
#19	Accepted 5	11ms	1 MiB
#20	Accepted 5	11ms	1 MiB

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=100010;
int _;
int n;
string scur;
int py[maxn],pw[maxn];
bool sy[maxn],sw[maxn];
bool vy[maxn],vw[maxn];
signed main(){
	freopen("edit.in","r",stdin);
	freopen("edit.out","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	cin>>_;
	while(_--){
		cin>>n;int nn=n+1;
		cin>>scur;
		for(int i=1;i<=n;i++) sy[i]=(scur[i-1]-'0');sy[nn]=0;
		cin>>scur;
		for(int i=1;i<=n;i++) sw[i]=(scur[i-1]-'0');sw[nn]=0;
		cin>>scur;
		for(int i=1;i<=n;i++) vy[i]=(scur[i-1]-'0');vy[nn]=0;
		cin>>scur;
		for(int i=1;i<=n;i++) vw[i]=(scur[i-1]-'0');vw[nn]=0;
		int zy=1,zw=1;
		int cy=0,cw=0;
		int ans=0;
		while(zy<=n||zw<=n){
			if(zy<=zw){
				for(;zy<=nn;zy++){
					if(!vy[zy]) break;
					cy+=sy[zy];
				}
				if(zy>=zw)
					for(;zw<=nn;zw++){
						if(!vw[zw]) break;
						cw+=sw[zw];
					}
			}
			else{
				for(;zw<=nn;zw++){
					if(!vw[zw]) break;
					cw+=sw[zw];
				}
				if(zw>=zy)
					for(;zy<=nn;zy++){
						if(!vy[zy]) break;
						cy+=sy[zy];
					}
			}
			if(zy>zw){
				cw+=sw[zw],zw++;//(lw,rw]if(zw<=n)
				int qwq=max(cw-cy,0),qaq=max(cy-cw-(zy-zw),0);//1,0
				if(qwq>0){
					ans+=qwq;
					cw=0,cy=0;
				}
				else if(qaq>0){
					ans+=qaq;
					cy=zy-zw,cw=0;
				}
				else cy-=cw,cw=0;
			}
			else if(zw>zy){
				cy+=sy[zy],zy++;//(lw,rw]if(zy<=n) 
				int qwq=max(cy-cw,0),qaq=max(cw-cy-(zw-zy),0);//1,0
				if(qwq>0){
					ans+=qwq;
					cy=0,cw=0;
				}
				else if(qaq>0){
					ans+=qaq;
					cw=zw-zy,cy=0;
				}
				else cw-=cy,cy=0;
			}
			else{
				int qwq=cy-cw;
				ans+=abs(qwq);
				cy=cw=0;
				ans+=(sw[zw]!=sy[zy]);
				zy++,zw++;
			}
		}
		cout<<n-ans<<'\n';
	}
	return 0;
}

递交者: GD-1092
题目: NOIP2024AGF NOIP2024AGF
比赛: 【官方数据 GD】 NOIP2024 批量测试
语言: C++14(O2)
代码长度: 1.8 KiB
递交时间: 2024-12-6 16:30:32
评测时间: 2024-12-6 16:45:10

分数: 100
总耗时: 94ms
峰值时间: 11ms
峰值内存: 1 MiB

100 Accepted

代码

信息

100 Accepted

代码

信息

还没有账户？

登录