NOI批量评测 - 记录详情

#	状态分数	耗时	内存占用

#1	Accepted 5	2ms	320 KiB
#2	Accepted 5	2ms	404 KiB
#3	Accepted 5	1ms	404 KiB
#4	Accepted 5	1ms	404 KiB
#5	Accepted 5	3ms	324 KiB
#6	Accepted 5	3ms	404 KiB
#7	Accepted 5	100ms	800 KiB
#8	Accepted 5	97ms	772 KiB
#9	Accepted 5	3ms	404 KiB
#10	Accepted 5	3ms	404 KiB
#11	Accepted 5	99ms	768 KiB
#12	Accepted 5	102ms	764 KiB
#13	Accepted 5	3ms	408 KiB
#14	Accepted 5	3ms	404 KiB
#15	Accepted 5	109ms	792 KiB
#16	Accepted 5	99ms	792 KiB
#17	Accepted 5	3ms	404 KiB
#18	Accepted 5	3ms	404 KiB
#19	Accepted 5	101ms	792 KiB
#20	Accepted 5	98ms	796 KiB

#include<bits/stdc++.h>
using namespace std;
/*
I did it!!!!
MY EXECELLENT IS UNDENIABLE!!!!
WHAT A GOOD DAY!!!!!
*/
int c0,c1,cc0,cc1;
int t;
int n;
bool a1[100010],a2[100010],r1[100010],r2[100010];
char c;
int ans;
int p1,p2;
void bing(){
  //  cout<<p1<<" "<<p2<<" "<<c1<<" "<<cc1<<" "<<c0<<" "<<cc0<<" --- "<<r1[p1]<<" "<<r2[p2]<<endl;
    int m1=min(c1,cc1),m0=min(c0,cc0);
    ans+=m1;
    ans+=m0;
    c1-=m1;
    cc1-=m1;
    c0-=m0;
    cc0-=m0;
   // cout<<"ENDWITH c0 "<<c0<<" c1"<<" "<<c1<<" cc0 "<<cc0<<" cc1 "<<cc1<<endl;
    return ;
}
int main(){
    freopen("edit.in","r",stdin);
    freopen("edit.out","w",stdout);
    cin>>t;
    while(t--){
          //  cout<<t<<endl;
        cin>>n;
        ans=0;
        for(int i=1;i<=n;i++){
            cin>>c;
            if(c=='1'){
                a1[i]=1;
            }else{
                a1[i]=0;
            }
        }
        for(int i=1;i<=n;i++){
            cin>>c;
            if(c=='1'){
                a2[i]=1;
            }else{
                a2[i]=0;
            }
        }
        for(int i=1;i<=n;i++){
            cin>>c;
            if(c=='1'){
                r1[i]=1;
            }else{
                r1[i]=0;
            }
        }
        for(int i=1;i<=n;i++){
            cin>>c;
            if(c=='1'){
                r2[i]=1;
            }else{
                r2[i]=0;
            }
        }
        a1[n+1]=0;
        a2[n+1]=0;
        r1[n+1]=0;
        r2[n+1]=0;
        p2=1;
        p1=1;
        c0=0;
        c1=0;
        cc0=0;
        cc1=0;
        ans=0;
        while(p1<=n||p2<=n){
           // cout<<p1<<" "<<p2<<endl;
            while(r1[p1]!=0&&p1<=n){
                if(a1[p1]){
                    c1++;
                }else{
                    c0++;
                }
                p1++;
            }
            while(r2[p2]!=0&&p2<=n){
                if(a2[p2]){
                    cc1++;
                }else{
                    cc0++;
                }
                p2++;
            }
            //cout<<"PL "<<p1<<" "<<p2<<" "<<c1<<" "<<c0<<" "<<cc1<<" "<<cc0<<endl;
            if(p1==p2){
                if(p1>n){
                    bing();
                    break;
                }else{
                    if(a1[p1]==a2[p2]){
                        ans++;
                        bing();
                        c0=0;
                        c1=0;
                        cc0=0;
                        cc1=0;
                        p1++;
                        p2++;
                    }else{
                        bing();
                        c0=0;
                        c1=0;
                        cc0=0;
                        cc1=0;
                        p1++;
                        p2++;
                    }
                }
            }else{
                if(p1<p2){
                    if(a1[p1]==1){
                        c1++;
                    }else{
                        c0++;
                    }
                    p1++;
                    bing();
                    if(c1){
                        cc0-=c1;
                    }else{
                        cc1-=c0;
                    }
                    c1=0;
                    c0=0;
                }else{
                    if(a2[p2]==1){
                        cc1++;
                    }else{
                        cc0++;
                    }
                    p2++;
                    bing();
                    if(cc0){
                        c1-=cc0;
                    }else{
                        c0-=cc1;
                    }
                    cc0=0;
                    cc1=0;
                }
            }
        //    cout<<"end: a 0num "<<c0<<" 1num "<<c1<<" b 0num "<<cc0<<" 1num "<<cc1<<" answer "<<ans<<endl;
        }
        cout<<ans<<endl;
    }
    return 0;
}

递交者: LN-0043
题目: NOIP2024A NOIP2024A
比赛: 【民间数据】NOIP2024 LN 批量测试
语言: C++14(O2)
代码长度: 3.8 KiB
递交时间: 2024-12-1 15:26:44
评测时间: 2024-12-1 15:34:21

分数: 100
总耗时: 833ms
峰值时间: 109ms
峰值内存: 800 KiB

100 Accepted

代码

信息

100 Accepted

代码

信息

还没有账户？

登录