NOI批量评测 - 记录详情

foo.cc: In function 'void solve(int)':
foo.cc:30:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for(int i=0,j=0;i<v1.size()&&j<v2.size();){
      |                     ~^~~~~~~~~~
foo.cc:30:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for(int i=0,j=0;i<v1.size()&&j<v2.size();){
      |                                  ~^~~~~~~~~~
foo.cc:33:32: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   33 |             else if(T[s1[v1[i]]-48^1]) T[s1[v1[i]]-48^1]--;
      |                       ~~~~~~~~~^~~
foo.cc:33:51: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   33 |             else if(T[s1[v1[i]]-48^1]) T[s1[v1[i]]-48^1]--;
      |                                          ~~~~~~~~~^~~
foo.cc:53:32: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   53 |             else if(S[s2[v2[j]]-48^1]) S[s2[v2[j]]-48^1]--;
      |                       ~~~~~~~~~^~~
foo.cc:53:51: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   53 |             else if(S[s2[v2[j]]-48^1]) S[s2[v2[j]]-48^1]--;
      |                                          ~~~~~~~~~^~~
foo.cc:77:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |             if(i==v1.size()) break;
      |                ~^~~~~~~~~~~
Expand

#	状态分数	耗时	内存占用

#1	Accepted 5	2ms	404 KiB
#2	Accepted 5	1ms	452 KiB
#3	Accepted 5	1ms	404 KiB
#4	Accepted 5	1ms	404 KiB
#5	Accepted 5	2ms	404 KiB
#6	Accepted 5	1ms	408 KiB
#7	Accepted 5	10ms	1.8 MiB
#8	Accepted 5	11ms	1.8 MiB
#9	Accepted 5	1ms	452 KiB
#10	Accepted 5	1ms	404 KiB
#11	Accepted 5	9ms	2 MiB
#12	Accepted 5	8ms	1.8 MiB
#13	Accepted 5	1ms	448 KiB
#14	Accepted 5	1ms	404 KiB
#15	Accepted 5	6ms	1.5 MiB
#16	Accepted 5	6ms	1.5 MiB
#17	Accepted 5	1ms	404 KiB
#18	Accepted 5	1ms	404 KiB
#19	Accepted 5	11ms	2 MiB
#20	Accepted 5	10ms	1.9 MiB

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int n,sum1[N],sum2[N];
char s1[N],s2[N],t1[N],t2[N];
vector<int> v1,v2;
int get1(int l,int r){return sum1[r]-sum1[l-1];}
int get2(int l,int r){return sum2[r]-sum2[l-1];}
void solve(int id)
{
    cin>>n>>(s1+1)>>(s2+1)>>(t1+1)>>(t2+1);
    for(int i=1;i<=n;i++){
        sum1[i]=sum1[i-1]+(s1[i]=='1');
        sum2[i]=sum2[i-1]+(s2[i]=='1');
    }
    for(int i=1;i<=n;i++){
        if(t1[i]=='0') v1.push_back(i);
        if(t2[i]=='0') v2.push_back(i);
    }
    s1[n+1]='0',s2[n+1]='1';
    t1[n+1]=t2[n+1]='0';
    v1.push_back(n+1),v2.push_back(n+1);
    // if(id==7){
        // for(auto i:v1) cout<<i<<' ';
        // cout<<'\n';
        // for(auto i:v2) cout<<i<<' ';
        // cout<<'\n';
    // }
    int S[2]={(int)v1.front()-1-sum1[v1.front()-1],sum1[v1.front()-1]},T[2]={(int)v2.front()-1-sum2[v2.front()-1],sum2[v2.front()-1]},ans=0,lst=0;
    for(int i=0,j=0;i<v1.size()&&j<v2.size();){
        if(v1[i]<v2[j]){
            if(T[s1[v1[i]]-48]) T[s1[v1[i]]-48]--,ans++;
            else if(T[s1[v1[i]]-48^1]) T[s1[v1[i]]-48^1]--;
            ans+=min(S[0],T[0])+min(S[1],T[1]);
            if(S[0]<=T[0]&&S[1]<=T[1]){
                T[0]-=S[0],T[1]-=S[1];
            }
            else if(S[0]<=T[0]){
                T[0]-=v1[i]-lst-1-T[1];
                T[1]=0;
            }
            else if(S[1]<=T[1]){
                T[1]-=v1[i]-lst-1-T[0];
                T[0]=0;
            }
            lst=v1[i];
            i++;
            S[1]=get1(v1[i-1]+1,v1[i]-1);
            S[0]=v1[i]-v1[i-1]-1-S[1];
        }
        else if(v1[i]>v2[j]){
            if(S[s2[v2[j]]-48]) S[s2[v2[j]]-48]--,ans++;
            else if(S[s2[v2[j]]-48^1]) S[s2[v2[j]]-48^1]--;
            ans+=min(S[0],T[0])+min(S[1],T[1]);
            if(T[0]<=S[0]&&T[1]<=S[1]){
                S[0]-=T[0],S[1]-=T[1];
            }
            else if(T[0]<=S[0]){
                S[0]-=v2[j]-lst-1-S[1];
                S[1]=0;
            }
            else if(T[1]<=S[1]){
                S[1]-=v2[j]-lst-1-S[0];
                S[0]=0;
            }
            lst=v2[j];
            j++;
            T[1]=get2(v2[j-1]+1,v2[j]-1);
            T[0]=v2[j]-v2[j-1]-1-T[1];
        }
        else{
            ans+=min(S[0],T[0])+min(S[1],T[1]);
            S[0]=S[1]=T[0]=T[1]=0;
            if(s1[v1[i]]==s2[v2[j]]) ans++;
            lst=v1[i];
            i++,j++;
            if(i==v1.size()) break;
            S[1]=get1(v1[i-1]+1,v1[i]-1);
            S[0]=v1[i]-v1[i-1]-1-S[1];
            T[1]=get2(v2[j-1]+1,v2[j]-1);
            T[0]=v2[j]-v2[j-1]-1-T[1];
        }
    }
    cout<<ans<<"\n";
    v1.clear(),v2.clear();
}
int main()
{
    freopen("edit.in","r",stdin);
    freopen("edit.out","w",stdout);
    cin.tie(0)->sync_with_stdio(0);
    int T;
    cin>>T;
    for(int i=1;i<=T;i++){
        solve(i);
    }
    return 0;
}

递交者: GD-0693
题目: NOIP2024AGF NOIP2024AGF
比赛: 【官方数据 GD】 NOIP2024 批量测试
语言: C++14(O2)
代码长度: 2.9 KiB
递交时间: 2024-12-6 16:30:14
评测时间: 2024-12-6 16:44:52

分数: 100
总耗时: 89ms
峰值时间: 11ms
峰值内存: 2 MiB

100 Accepted

代码

信息

100 Accepted

代码

信息

还没有账户？

登录