結果
問題 | No.1209 XOR Into You |
ユーザー | kiyoshi0205 |
提出日時 | 2020-08-30 15:11:08 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 61 ms / 2,000 ms |
コード長 | 5,312 bytes |
コンパイル時間 | 3,160 ms |
コンパイル使用メモリ | 197,752 KB |
実行使用メモリ | 9,468 KB |
最終ジャッジ日時 | 2023-08-09 13:00:40 |
合計ジャッジ時間 | 6,875 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,384 KB |
testcase_01 | AC | 2 ms
4,388 KB |
testcase_02 | AC | 2 ms
4,388 KB |
testcase_03 | AC | 1 ms
4,384 KB |
testcase_04 | AC | 47 ms
8,568 KB |
testcase_05 | AC | 48 ms
8,616 KB |
testcase_06 | AC | 48 ms
8,588 KB |
testcase_07 | AC | 47 ms
8,360 KB |
testcase_08 | AC | 42 ms
7,888 KB |
testcase_09 | AC | 42 ms
7,832 KB |
testcase_10 | AC | 35 ms
7,132 KB |
testcase_11 | AC | 42 ms
7,836 KB |
testcase_12 | AC | 38 ms
7,240 KB |
testcase_13 | AC | 44 ms
8,088 KB |
testcase_14 | AC | 38 ms
7,300 KB |
testcase_15 | AC | 41 ms
7,572 KB |
testcase_16 | AC | 40 ms
7,620 KB |
testcase_17 | AC | 38 ms
7,240 KB |
testcase_18 | AC | 53 ms
9,112 KB |
testcase_19 | AC | 39 ms
7,208 KB |
testcase_20 | AC | 44 ms
8,140 KB |
testcase_21 | AC | 33 ms
6,724 KB |
testcase_22 | AC | 39 ms
9,312 KB |
testcase_23 | AC | 39 ms
9,448 KB |
testcase_24 | AC | 38 ms
9,468 KB |
testcase_25 | AC | 54 ms
9,356 KB |
testcase_26 | AC | 55 ms
9,408 KB |
testcase_27 | AC | 55 ms
9,412 KB |
testcase_28 | AC | 55 ms
9,372 KB |
testcase_29 | AC | 55 ms
9,364 KB |
testcase_30 | AC | 54 ms
9,420 KB |
testcase_31 | AC | 60 ms
9,400 KB |
testcase_32 | AC | 60 ms
9,324 KB |
testcase_33 | AC | 59 ms
9,416 KB |
testcase_34 | AC | 61 ms
9,320 KB |
testcase_35 | AC | 59 ms
9,356 KB |
testcase_36 | AC | 59 ms
9,416 KB |
testcase_37 | AC | 41 ms
9,400 KB |
testcase_38 | AC | 46 ms
8,256 KB |
testcase_39 | AC | 41 ms
7,484 KB |
testcase_40 | AC | 39 ms
9,416 KB |
ソースコード
#pragma GCC target("avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include<bits/stdc++.h> // #include<ext/pb_ds/assoc_container.hpp> // #include<ext/pb_ds/tree_policy.hpp> // #include<ext/pb_ds/tag_and_trait.hpp> // using namespace __gnu_pbds; // #include<boost/multiprecision/cpp_int.hpp> // namespace multiprecisioninteger = boost::multiprecision; // using cint=multiprecisioninteger::cpp_int; using namespace std; using ll=long long; #define double long double using datas=pair<ll,ll>; using ddatas=pair<double,double>; using tdata=pair<ll,datas>; using vec=vector<ll>; using mat=vector<vec>; using pvec=vector<datas>; using pmat=vector<pvec>; // using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>; #define For(i,a,b) for(i=a;i<(ll)b;++i) #define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i) #define rep(i,N) For(i,0,N) #define rep1(i,N) For(i,1,N) #define brep(i,N) bFor(i,N,0) #define brep1(i,N) bFor(i,N,1) #define all(v) (v).begin(),(v).end() #define allr(v) (v).rbegin(),(v).rend() #define vsort(v) sort(all(v)) #define vrsort(v) sort(allr(v)) #define endl "\n" #define eb emplace_back #define print(v) cout<<v<<endl #define printyes cout<<"Yes"<<endl #define printno cout<<"No"<<endl #define printYES cout<<"YES"<<endl #define printNO cout<<"NO"<<endl #define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0) #define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0) const ll mod=1000000007; // const ll mod=998244353; const ll inf=1LL<<60; const double PI = acos(-1); const double eps = 1e-9; template<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;} template<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;} void startupcpp(){ cin.tie(0); ios::sync_with_stdio(false); cout<<fixed<<setprecision(15); } double distance(ddatas x,ddatas y){ double a=x.first-y.first,b=x.second-y.second; return sqrt(a*a+b*b); } ll modinv(ll a) { ll b=mod,u=1,v=0,t; while(b){ t=a/b; a-=t*b; swap(a,b); u-=t*v; swap(u,v); } return (u+mod)%mod; } ll moddevide(ll a,ll b){return (a*modinv(b))%mod;} vec modncrlistp,modncrlistm; ll modncr(ll n,ll r){ if(n<r)return 0; ll i,size=modncrlistp.size(); if(size<=n){ modncrlistp.resize(n+1); modncrlistm.resize(n+1); if(!size){ modncrlistp[0]=modncrlistm[0]=1; size++; } For(i,size,n+1){ modncrlistp[i]=modncrlistp[i-1]*i%mod; modncrlistm[i]=modinv(modncrlistp[i]); } } return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod; } ll modpow(ll a,ll n){ ll res=1; while(n>0){ if(n&1)res=res*a%mod; a=a*a%mod; n>>=1; } return res; } ll gcd(ll a,ll b){if(!b)return abs(a);return (a%b==0)?abs(b):gcd(b,a%b);} ll lcm(ll a,ll b){return a/gcd(a,b)*b;} ll countdigits(ll n){ ll ans=0; while(n){n/=10;ans++;} return ans; } ll sumdigits(ll n){ ll ans=0; while(n){ans+=n%10;n/=10;} return ans; } void topcoder(vector<int>& v){ string s; while(1){ cin>>s; int i=s[0]=='{',x=0; while(s[i]>='0'&&s[i]<='9'){ x=x*10+s[i]-'0'; ++i; } v.eb(x); if(s[i]=='}')break; } } void topcoder(string& s){ string t; cin>>t; int i=1; while(t[i]!='"'){ s+=t[i++]; } } struct unionfind{ private: int maxN; vector<int> par,treesize; public:unionfind(int N) :maxN(N),par(N),treesize(N,1){ for(int i=0;i<maxN;++i)par[i]=i; } int root(int x){ while(par[x]!=x){ x=par[x]=par[par[x]]; } return x; } bool unite(int x,int y){ x=root(x); y=root(y); if(x==y)return false; if(treesize[x]>treesize[y])swap(x,y); par[x]=y; treesize[y]+=treesize[x]; return true; } bool parcheck(int x,int y){ return root(x)==root(y); } int size(int x){ return treesize[root(x)]; } void clear(){ treesize.assign(maxN,1); for(int i=0;i<maxN;++i)par[i]=i; } }; template <typename T> struct BinaryIndexedTree{ int size,bitn=0; T I; using func=function<T(T,T)>; func F; vector<T> tree; BinaryIndexedTree(int N,T e,func f):size(N+1),I(e),F(f),tree(size,e){} BinaryIndexedTree(int N):size(N+1),I(0),F([](T a,T b){return a+b;}),tree(size,0){} void act(int i,T x){ for(++i;i<size;i+=-i&i){ tree[i]=F(tree[i],x); } } T queli(int i){ T res=I; for(++i;i>0;i-=-i&i){ res=F(tree[i],res); } return res; } //only(N,+) int lower_bound(int x){ int i=0; if(!bitn){ i=size;bitn=1; while(i){ i>>=1;bitn<<=1; } i=0; } for(int k=bitn;k;k>>=1){ if(i+k<size&&tree[i+k]<x){ i+=k; x-=tree[i]; } } return i; } }; ll N,M,K; ll ans; int main(){ startupcpp(); // int codeforces;cin>>codeforces;while(codeforces--){ ll i,j; cin>>N; vec a(N),b(N),v(N); pvec c(N),d(N); rep(i,N)cin>>a[i]; rep(i,N)cin>>b[i]; brep1(i,N)a[i]^=a[i-1]; brep1(i,N)b[i]^=b[i-1]; rep(i,N){ c[i]=datas(a[i],i); d[i]=datas(b[i],i); } vsort(c); vsort(d); rep(i,N){ if(c[i].first!=d[i].first){ print(-1); return 0; } v[c[i].second]=d[i].second; } BinaryIndexedTree<ll> tree(N+1); rep(i,N){ ans+=i-tree.queli(v[i]); tree.act(v[i],1); } print(ans); }