NOI批量评测 - 记录详情

foo.cc: In function 'void test()':
foo.cc:10:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   10 |     cin>>n>>str1+1>>str2+1>>flag1+1>>flag2+1;
      |             ~~~~^~
foo.cc:10:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   10 |     cin>>n>>str1+1>>str2+1>>flag1+1>>flag2+1;
      |                     ~~~~^~
foo.cc:10:34: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   10 |     cin>>n>>str1+1>>str2+1>>flag1+1>>flag2+1;
      |                             ~~~~~^~
foo.cc:10:43: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   10 |     cin>>n>>str1+1>>str2+1>>flag1+1>>flag2+1;
      |                                      ~~~~~^~
Expand

#	状态分数	耗时	内存占用

#1	Accepted 5	1ms	404 KiB
#2	Accepted 5	1ms	408 KiB
#3	Accepted 5	1ms	404 KiB
#4	Accepted 5	1ms	404 KiB
#5	Accepted 5	1ms	432 KiB
#6	Accepted 5	1ms	508 KiB
#7	Accepted 5	8ms	820 KiB
#8	Accepted 5	9ms	816 KiB
#9	Accepted 5	1ms	508 KiB
#10	Accepted 5	1ms	408 KiB
#11	Accepted 5	7ms	704 KiB
#12	Accepted 5	7ms	788 KiB
#13	Accepted 5	1ms	408 KiB
#14	Accepted 5	1ms	404 KiB
#15	Accepted 5	6ms	792 KiB
#16	Accepted 5	6ms	788 KiB
#17	Accepted 5	1ms	452 KiB
#18	Accepted 5	1ms	404 KiB
#19	Accepted 5	10ms	788 KiB
#20	Accepted 5	10ms	788 KiB

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

const int N=100000+10;
char str1[N],str2[N],flag1[N],flag2[N];
int n;

void test(){
    cin>>n>>str1+1>>str2+1>>flag1+1>>flag2+1;
    int cnt[3][3],ans=0;
    memset(cnt,0,sizeof(cnt));
    bool f1=1,f2=1;
    //int pre[N];memset(pre,0,sizeof(pre));
    for(int i=1,j=1,nxti=1,nxtj=1;i<=n&&j<=n;){
        /** ///////////////// **/
        if(f1){
            cnt[1][0]=cnt[1][1]=0;
            if(flag1[i]-'0'){
                nxti=i;
                do{
                    cnt[1][str1[nxti++]-'0']++;
                }while(nxti<=n&&flag1[nxti]-'0');
            }else{
                cnt[1][str1[i]-'0']++;
                nxti=i+1;
            }
        }
        if(f2){
            cnt[2][0]=cnt[2][1]=0;
            if(flag2[j]-'0'){
                nxtj=j;
                do{
                    //if(str2[nxtj]=='1')pre[nxtj]=pre[nxtj-1]+1;else pre[nxtj]=pre[nxtj-1];
                    cnt[2][str2[nxtj++]-'0']++;
                }while(nxtj<=n&&flag2[nxtj]-'0');
            }else{
                nxtj=j;
                //if(str2[nxtj]=='1')pre[nxtj]=pre[nxtj-1]+1;else pre[nxtj]=pre[nxtj-1];
                cnt[2][str2[j]-'0']++;
                nxtj=j+1;
            }
        }///end-init///
        /*cout<<"s1: "<<f1<<','<<i<<":  "<<nxti<<endl;
        cout<<"s2: "<<f2<<','<<j<<":  "<<nxtj<<endl;
        for(int u=1;u<3;u++){
            cout<<"\t\t"<<cnt[u][0]<<' '<<cnt[u][1]<<'\n';
        }*/
        if(nxti==nxtj){
            ans+=min(cnt[1][0],cnt[2][0])+min(cnt[1][1],cnt[2][1]);
            f1=f2=1;
            i=nxti,j=nxtj;
        }else if(nxti<nxtj){
            int gt0=min(cnt[1][0],cnt[2][0]),gt1=min(cnt[1][1],cnt[2][1]);
            ans+=gt0+gt1;
            cnt[2][0]-=gt0,cnt[2][1]-=gt1;
            f1=1;f2=0;
            if(gt0+gt1<nxti-i){
                if(cnt[2][0])cnt[2][0]-=nxti-i-gt1-gt0;
                else cnt[2][1]-=nxti-i-gt1-gt0;
            }i=j=nxti;
        }else{
            int gt0=min(cnt[1][0],cnt[2][0]),gt1=min(cnt[1][1],cnt[2][1]);
            f1=0,f2=1;
            ans+=gt1+gt0;
            cnt[1][0]-=gt0,cnt[1][1]-=gt1;
            if(gt1+gt0<nxtj-j){
                if(cnt[1][0])cnt[1][0]-=nxtj-j-gt1-gt0;
                else cnt[1][1]-=nxtj-j-gt1-gt0;
            }i=j=nxtj;
        }
        /*cout<<"\tans="<<ans<<','<<f1<<','<<f2<<'\n';
        for(int u=1;u<3;u++){
            cout<<"\t\t"<<cnt[u][0]<<' '<<cnt[u][1]<<'\n';
        }
        if(ans!=pre[j-1])cout<<j<<"-->"<<pre[j-1]<<"??????????????????????????????????????????????\n\n\n";
        cout<<"\n\n\n";*/
    }cout<<ans<<'\n';
}

signed main(){
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    freopen("edit.in","r",stdin);
    freopen("edit.out","w",stdout);
    int t;cin>>t;while(t--)test();
    return 0;
}

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

分数: 100
总耗时: 77ms
峰值时间: 10ms
峰值内存: 820 KiB

100 Accepted

代码

信息

100 Accepted

代码

信息

还没有账户？

登录