NOI批量评测 - 记录详情

#	状态分数	耗时	内存占用

#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	408 KiB
#6	Accepted 5	1ms	404 KiB
#7	Accepted 5	11ms	1.2 MiB
#8	Accepted 5	11ms	1.2 MiB
#9	Accepted 5	1ms	324 KiB
#10	Accepted 5	1ms	404 KiB
#11	Accepted 5	9ms	1.2 MiB
#12	Accepted 5	8ms	1.2 MiB
#13	Accepted 5	1ms	404 KiB
#14	Accepted 5	1ms	404 KiB
#15	Accepted 5	8ms	1.2 MiB
#16	Accepted 5	8ms	1.2 MiB
#17	Accepted 5	1ms	404 KiB
#18	Accepted 5	1ms	404 KiB
#19	Accepted 5	10ms	1.2 MiB
#20	Accepted 5	10ms	1.2 MiB

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

int T,n,ans,cnt;
string a,b,c,d;

inline int cross(int l,int r,int ll,int rr){
if (l>ll) swap(l,ll),swap(r,rr);
return max(0,min(r-ll+1,rr-ll+1));
}

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

cin>>T;

while (T--){
cin>>n; ans=0;
cin>>a>>b>>c>>d;
a=" "+a+" ";
b=" "+b+" ";
c=" "+c+" ";
d=" "+d+" ";
cnt=0;
for (int i=1;i<=n;++i) cnt+=(a[i]=='1'),cnt+=(b[i]=='1');
int l=1,r=1,ll=1,rr=1,C=(a[1]=='1'),CC=(b[1]=='1');
while (1){
if (r<l) r=l;
if (rr<ll) rr=ll;
while (c[l]=='1' && r<n && c[r+1]=='1') ++r,C+=(a[r]=='1');
while (d[ll]=='1' && rr<n && d[rr+1]=='1') ++rr,CC+=(b[rr]=='1');
int d=cross(l,r,ll,rr);
int cost=min({d,C,CC});
ans+=cost,C-=cost,CC-=cost;
int mi=min(r,rr);
if (mi==n) break;
if (r==mi) l=r+1,C=(a[l]=='1'),r=l;
if (rr==mi) ll=rr+1,CC=(b[ll]=='1'),rr=ll;
}
cout<<n-(cnt-2*ans)<<'\n';
}

return 0;
}

递交者: ZJ-0019
题目: NOIP2024AGF NOIP2024AGF
比赛: 【官方数据 ZJ】 NOIP2024 批量测试
语言: C++14(O2)
代码长度: 984 Bytes
递交时间: 2024-12-6 17:59:22
评测时间: 2024-12-6 17:59:30

分数: 100
总耗时: 91ms
峰值时间: 11ms
峰值内存: 1.2 MiB

100 Accepted

代码

信息

100 Accepted

代码

信息

还没有账户？

登录