Submission #1778796


Source Code Expand

#include<bits/stdc++.h>
#define N 100005
using namespace std;
map<int,int>mp,s;
int n,a[N],b[N],cnt;
int f[N],siz[N],ss[N];
int find(int x)
{
    if(x==f[x])return x;
    return f[x]=find(f[x]);
}
void add(int a,int b)
{
    int aa=find(a),bb=find(b);
    if(aa!=bb)
    {
        f[aa]=bb;
        siz[bb]+=siz[aa];
        ss[bb]+=ss[aa];
    }ss[bb]++;
}
int main()
{
    scanf("%d",&n);int sum=0,fl=0;
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
        sum^=a[i];
        mp[a[i]]++;
    }
    //cout<<sum<<endl;
    for(int i=1;i<=n;i++)
    {
       // if(sum==a[i]&&mp[a[i]]==1)continue;
        if(s[a[i]]!=0)continue;
        s[a[i]]=++cnt;f[cnt]=cnt;siz[cnt]=mp[a[i]];
    }
    if(mp.find(sum)!=mp.end())mp[sum]++;
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&b[i]);
        if(b[i]==a[i])siz[find(s[a[i]])]--;
        if(mp.find(b[i])==mp.end())
        {
            if(!fl&&b[i]==sum)fl=1;
            else return puts("-1"),0;
        }
        else
        {
            //cout<<mp[b[i]]<<endl;
            if(!fl&&b[i]==sum)fl=1;
            else if(mp[b[i]]==0)return puts("-1"),0;
            if(mp[b[i]]!=0)mp[b[i]]--,add(s[b[i]],s[a[i]]);
        }
    }
    int ans=0;
    for(int i=1;i<=cnt;i++)
    {
        if(find(i)==i)
        {
            if(siz[i]==0)continue;
            ans+=siz[i]+1;
        }
    }
    if(fl)ans--;if(!ans)ans++;
    cout<<ans<<endl;
    return 0;
}

Submission Info

Submission Time
Task D - XOR Replace
User SD_le
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1495 Byte
Status WA
Exec Time 264 ms
Memory 11520 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:24:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);int sum=0,fl=0;
                   ^
./Main.cpp:27:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&a[i]);
                          ^
./Main.cpp:41:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&b[i]);
                          ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1000
Status
AC × 3
WA × 1
AC × 69
WA × 5
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt, 1_50.txt, 1_51.txt, 1_52.txt, 1_53.txt, 1_54.txt, 1_55.txt, 1_56.txt, 1_57.txt, 1_58.txt, 1_59.txt, 1_60.txt, 1_61.txt, 1_62.txt, 1_63.txt, 1_64.txt, 1_65.txt, 1_66.txt, 1_67.txt, 1_68.txt, 1_69.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt WA 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 1 ms 256 KB
1_00.txt WA 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt WA 1 ms 256 KB
1_04.txt AC 1 ms 256 KB
1_05.txt AC 1 ms 256 KB
1_06.txt WA 1 ms 256 KB
1_07.txt WA 144 ms 11520 KB
1_08.txt AC 139 ms 11136 KB
1_09.txt AC 140 ms 11392 KB
1_10.txt AC 26 ms 1024 KB
1_11.txt AC 25 ms 1024 KB
1_12.txt AC 26 ms 1024 KB
1_13.txt AC 26 ms 1024 KB
1_14.txt AC 32 ms 1024 KB
1_15.txt AC 32 ms 1024 KB
1_16.txt AC 32 ms 1024 KB
1_17.txt AC 32 ms 1024 KB
1_18.txt AC 39 ms 1024 KB
1_19.txt AC 39 ms 1024 KB
1_20.txt AC 39 ms 1024 KB
1_21.txt AC 40 ms 1024 KB
1_22.txt AC 47 ms 1024 KB
1_23.txt AC 48 ms 1024 KB
1_24.txt AC 47 ms 1024 KB
1_25.txt AC 47 ms 1024 KB
1_26.txt AC 64 ms 1024 KB
1_27.txt AC 65 ms 1024 KB
1_28.txt AC 66 ms 1152 KB
1_29.txt AC 65 ms 1024 KB
1_30.txt AC 83 ms 1280 KB
1_31.txt AC 79 ms 1280 KB
1_32.txt AC 84 ms 1280 KB
1_33.txt AC 82 ms 1280 KB
1_34.txt AC 113 ms 1920 KB
1_35.txt AC 110 ms 1920 KB
1_36.txt AC 112 ms 1920 KB
1_37.txt AC 110 ms 1920 KB
1_38.txt AC 166 ms 4352 KB
1_39.txt AC 121 ms 4096 KB
1_40.txt AC 166 ms 4352 KB
1_41.txt AC 156 ms 4352 KB
1_42.txt AC 222 ms 8320 KB
1_43.txt AC 116 ms 7936 KB
1_44.txt AC 219 ms 8448 KB
1_45.txt AC 137 ms 7936 KB
1_46.txt AC 244 ms 10624 KB
1_47.txt AC 203 ms 10368 KB
1_48.txt AC 242 ms 10624 KB
1_49.txt AC 128 ms 9856 KB
1_50.txt AC 255 ms 11264 KB
1_51.txt AC 149 ms 10368 KB
1_52.txt AC 251 ms 11392 KB
1_53.txt AC 131 ms 10624 KB
1_54.txt AC 248 ms 11392 KB
1_55.txt AC 210 ms 11008 KB
1_56.txt AC 253 ms 11520 KB
1_57.txt AC 173 ms 11008 KB
1_58.txt AC 252 ms 11520 KB
1_59.txt AC 227 ms 11392 KB
1_60.txt AC 254 ms 11520 KB
1_61.txt AC 165 ms 11008 KB
1_62.txt AC 258 ms 11520 KB
1_63.txt AC 212 ms 10880 KB
1_64.txt AC 264 ms 11392 KB
1_65.txt AC 136 ms 10752 KB
1_66.txt AC 251 ms 11392 KB
1_67.txt AC 192 ms 11136 KB
1_68.txt AC 249 ms 11520 KB
1_69.txt AC 125 ms 10752 KB