NOI批量评测 - 记录详情

#	状态分数	耗时	内存占用

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

#include<bits/stdc++.h>

#define MAXN 100005

int T;
int n;
char s1[MAXN],s2[MAXN];
char t1[MAXN],t2[MAXN];
int ans=0;
int l1,l2;
int c1[2],c2[2];

int main(){
    std::ios::sync_with_stdio(false);

    freopen("edit.in","r",stdin);
    freopen("edit.out","w",stdout);

    std::cin>>T;
    for(int i=1;i<=T;i++){
        ans=0;

        std::cin>>n;
        std::cin>>(s1+1)>>(s2+1);
        std::cin>>(t1+1)>>(t2+1);

        l1=l2=0;
        c1[0]=c1[1]=c2[0]=c2[1]=0;

        while(l1<n||l2<n){
            if(c1[0]+c1[1]==0){
                ++l1;
                if(t1[l1]=='0'){
                    c1[s1[l1]-'0']++;
                }else{
                    c1[s1[l1]-'0']++;
                    while(t1[l1+1]=='1') ++l1,c1[s1[l1]-'0']++;
                }
            }
            if(c2[0]+c2[1]==0){
                ++l2;
                if(t2[l2]=='0'){
                    c2[s2[l2]-'0']++;
                }else{
                    c2[s2[l2]-'0']++;
                    while(t2[l2+1]=='1') ++l2,c2[s2[l2]-'0']++;
                }
            }
            if(c1[0]&&c2[0]){
                int x=std::min(c1[0],c2[0]);
                c1[0]-=x,c2[0]-=x,ans+=x;
            }
            if(c1[1]&&c2[1]){
                int x=std::min(c1[1],c2[1]);
                c1[1]-=x,c2[1]-=x,ans+=x;
            }
            if(c1[0]&&c2[1]){
                int x=std::min(c1[0],c2[1]);
                c1[0]-=x,c2[1]-=x;
            }
            if(c1[1]&&c2[0]){
                int x=std::min(c1[1],c2[0]);
                c1[1]-=x,c2[0]-=x;
            }
        }
        std::cout<<ans<<'\n';
    }

    return 0;
}

递交者: BJ-0544
题目: NOIP2024AGF NOIP2024AGF
比赛: 【官方数据 BJ】 NOIP2024 批量测试
语言: C++14(O2)
代码长度: 1.6 KiB
递交时间: 2024-12-6 17:36:42
评测时间: 2024-12-6 17:36:54

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

100 Accepted

代码

信息

100 Accepted

代码

信息

还没有账户？

登录