NOI批量评测 - 记录详情

#	状态分数	耗时	内存占用

#1	Accepted 5	2ms	404 KiB
#2	Accepted 5	2ms	400 KiB
#3	Accepted 5	1ms	404 KiB
#4	Accepted 5	1ms	404 KiB
#5	Accepted 5	2ms	404 KiB
#6	Accepted 5	2ms	452 KiB
#7	Accepted 5	45ms	1.6 MiB
#8	Accepted 5	44ms	1.5 MiB
#9	Accepted 5	2ms	404 KiB
#10	Accepted 5	2ms	404 KiB
#11	Accepted 5	47ms	1.5 MiB
#12	Accepted 5	48ms	1.6 MiB
#13	Accepted 5	2ms	404 KiB
#14	Accepted 5	2ms	452 KiB
#15	Accepted 5	50ms	1.6 MiB
#16	Accepted 5	45ms	1.4 MiB
#17	Accepted 5	2ms	456 KiB
#18	Accepted 5	2ms	404 KiB
#19	Accepted 5	47ms	1.5 MiB
#20	Accepted 5	46ms	1.6 MiB

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e5+10;
int tot1=1,tot2=1;
int cnt1[N],cnt0[N];
int cntt1[N],cntt0[N];
int p[N];
int main(){
	freopen("edit.in","r",stdin);
	freopen("edit.out","w",stdout);
	int T;
	cin>>T;
	while(T--){
		for(int i=1;i<=tot1;i++){
			cnt1[i]=0;
			cnt0[i]=0;
		}
		for(int i=1;i<=tot2;i++){
			cntt1[i]=0;
			cntt0[i]=0;
		}
		tot1=1;
		tot2=1;
		int n;
		cin>>n;
		string s1,s2,t1,t2;
		cin>>s1;
		cin>>s2;
		cin>>t1;
		cin>>t2;
		s1=" "+s1;
		s2=" "+s2;
		t1=" "+t1;
		t2=" "+t2;
		s1+='0';
		s2+='1';
		t1+='0';
		t2+='0';
		n++;
		for(int i=1;i<=n;i++){
			if(t1[i]=='0'&&t2[i]=='0') p[i]=3;
			else if(t1[i]=='0') p[i]=1;
			else if(t2[i]=='0') p[i]=2;
			else p[i]=0;
		}
		//for(int i=1;i<=n;i++) cout<<p[i]<<" ";
		//cout<<endl;
		for(int i=1;i<=n;i++){
			if(t1[i]=='1'){
				if(s1[i]=='1') cnt1[tot1]++;
				else cnt0[tot1]++;
			}
			else tot1++;
		}
		for(int i=1;i<=n;i++){
			if(t2[i]=='1'){
				if(s2[i]=='1') cntt1[tot2]++;
				else cntt0[tot2]++;
			}
			else tot2++;
		}
		//for(int i=1;i<=tot1;i++) cout<<cnt0[i]<<" ";
		//cout<<endl;
		long long ans=0;
		int now1=1,now2=1,len=0;;
		for(int i=1;i<=n;i++){
			if(p[i]){
			//	cout<<cnt1[now1]<<" "<<cntt1[now2]<<"   "<<cnt0[now1]<<" "<<cntt0[now2]<<"   ";
				int res=min(cnt1[now1],cntt1[now2]);
				res+=min(cnt0[now1],cntt0[now2]);
				ans=ans+min(res,len);
				int t=min(len,min(cnt1[now1],cntt1[now2]));
				cnt1[now1]-=t;
				cntt1[now2]-=t;
				t=min(len,min(cnt0[now1],cntt0[now2]));
				cnt0[now1]-=t;
				cntt0[now2]-=t;
				if(p[i]==3){
					if(s1[i]==s2[i]) ans++;
					now1++;
					now2++;	
				}
				if(p[i]==1){
					now1++;
					if(s1[i]=='1'){
						if(cntt1[now2]>=1){
							ans++;
							cntt1[now2]--;
						}
					}
					else if(cntt0[now2]>=1){
						ans++;
						cntt0[now2]--;
					}
				}
				if(p[i]==2){
					now2++;
					if(s2[i]=='1'){
						if(cnt1[now1]>=1){
							ans++;
							cnt1[now1]--;
						}
					}
					else if(cnt0[now1]>=1){
						ans++;
						cnt0[now1]--;
					}
				}
				//cout<<i<<" "<<ans<<" ";
				len=0;
			}
			else len++;
			//cout<<endl;
		}
		cout<<ans<<'\n';
	}
	return 0;
}

递交者: HI-0043
题目: NOIP2024A NOIP2024A
比赛: 【民间数据】NOIP2024 HI 批量测试
语言: C++14(O2)
代码长度: 2.2 KiB
递交时间: 2024-12-1 16:25:27
评测时间: 2024-12-1 16:28:59

分数: 100
总耗时: 392ms
峰值时间: 50ms
峰值内存: 1.6 MiB

100 Accepted

代码

信息

100 Accepted

代码

信息

还没有账户？

登录