結果
問題 | No.1209 XOR Into You |
ユーザー | 👑 tute7627 |
提出日時 | 2020-10-11 20:48:11 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 211 ms / 2,000 ms |
コード長 | 4,399 bytes |
コンパイル時間 | 2,416 ms |
コンパイル使用メモリ | 221,648 KB |
実行使用メモリ | 26,992 KB |
最終ジャッジ日時 | 2023-09-27 23:13:01 |
合計ジャッジ時間 | 12,936 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 1 ms
4,376 KB |
testcase_03 | AC | 1 ms
4,376 KB |
testcase_04 | AC | 41 ms
7,676 KB |
testcase_05 | AC | 41 ms
7,804 KB |
testcase_06 | AC | 40 ms
7,752 KB |
testcase_07 | AC | 146 ms
23,028 KB |
testcase_08 | AC | 133 ms
20,836 KB |
testcase_09 | AC | 130 ms
20,992 KB |
testcase_10 | AC | 103 ms
17,776 KB |
testcase_11 | AC | 131 ms
20,684 KB |
testcase_12 | AC | 122 ms
19,508 KB |
testcase_13 | AC | 142 ms
21,680 KB |
testcase_14 | AC | 114 ms
18,912 KB |
testcase_15 | AC | 126 ms
19,812 KB |
testcase_16 | AC | 121 ms
19,540 KB |
testcase_17 | AC | 113 ms
19,040 KB |
testcase_18 | AC | 175 ms
25,672 KB |
testcase_19 | AC | 119 ms
19,664 KB |
testcase_20 | AC | 141 ms
21,732 KB |
testcase_21 | AC | 107 ms
17,364 KB |
testcase_22 | AC | 111 ms
26,988 KB |
testcase_23 | AC | 109 ms
26,844 KB |
testcase_24 | AC | 110 ms
26,852 KB |
testcase_25 | AC | 192 ms
26,960 KB |
testcase_26 | AC | 195 ms
26,992 KB |
testcase_27 | AC | 211 ms
26,984 KB |
testcase_28 | AC | 186 ms
26,900 KB |
testcase_29 | AC | 182 ms
26,872 KB |
testcase_30 | AC | 187 ms
26,840 KB |
testcase_31 | AC | 64 ms
10,952 KB |
testcase_32 | AC | 65 ms
11,196 KB |
testcase_33 | AC | 68 ms
11,008 KB |
testcase_34 | AC | 69 ms
11,092 KB |
testcase_35 | AC | 65 ms
11,116 KB |
testcase_36 | AC | 67 ms
11,196 KB |
testcase_37 | AC | 37 ms
10,480 KB |
testcase_38 | AC | 147 ms
22,720 KB |
testcase_39 | AC | 139 ms
20,460 KB |
testcase_40 | AC | 113 ms
26,872 KB |
ソースコード
//#define _GLIBCXX_DEBUG #include<bits/stdc++.h> using namespace std; #define endl '\n' #define lfs cout<<fixed<<setprecision(10) #define ALL(a) (a).begin(),(a).end() #define ALLR(a) (a).rbegin(),(a).rend() #define spa << " " << #define fi first #define se second #define MP make_pair #define MT make_tuple #define PB push_back #define EB emplace_back #define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++) #define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--) using ll = long long; using ld = long double; const ll MOD1 = 1e9+7; const ll MOD9 = 998244353; const ll INF = 1e18; using P = pair<ll, ll>; template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;} template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;} ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});} void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;} void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;} void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;} template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} template<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}}; void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}}; template<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;}; template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;} ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;} vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1}; template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);} template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));} template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;} template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;} //mt19937 mt(chrono::steady_clock::now().time_since_epoch().count()); template<typename T> struct BIT{ ll n; ll k=1; vector<T>data; BIT() = default; BIT(ll size):n(size){ data.assign(n,0); while(k*2<=n)k*=2; } void add(ll a,T w){ for(ll i=a+1;i<=n;i+=i&-i)data[i-1]+=w; } T sum(ll a){ if(a<0)return 0; T ret = 0; for(ll i=a+1;i>0;i-=i&-i)ret+=data[i-1]; return ret; } T sum(ll a,ll b){return a>b?0:sum(b)-sum(a-1);} T operator[](ll pos){ return sum(pos,pos); } ll lower_bound(ll x){ ll ret=0; for(ll i=k;i>0;i/=2){ if(ret+i<=n&&data[ret+i-1]<x){ x-=data[ret+i-1]; ret+=i; } } return ret; } void print(){ for(ll i=0;i<n;i++){ if(i!=0)cout<<" "; cout<<(*this)[i]; } cout<<endl; } }; template<typename T> ll inversion(T x, T y){ T v = x; sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end()); int sz = v.size(); map<ll,int>mp; for(int i=0;i<v.size();i++)mp[v[i]]=i; for(auto &z:x)z = mp[z]; for(auto &z:y)z = mp[z]; vector<vector<int>>idx1(sz),idx2(sz); for(int i=0;i<x.size();i++)idx1[x[i]].push_back(i); for(int i=0;i<y.size();i++)idx2[y[i]].push_back(i); vector<int>idx(x.size()); for(int i=0;i<sz;i++){ assert(idx1[i].size() == idx2[i].size()); for(int j=0;j<idx1[i].size();j++){ idx[idx1[i][j]] = idx2[i][j]; } } BIT<long long>bit(x.size()); long long ret = 0; for(int i=0;i<idx.size();i++){ ret += bit.sum(idx[i], (int)idx.size() - 1); bit.add(idx[i], 1); } return ret; } template<typename T> ll inversion(T x){ T y = x; sort(y.begin(),y.end()); return inversion(x,y); } int main(){ cin.tie(nullptr); ios_base::sync_with_stdio(false); ll res=0,buf=0; bool judge = true; ll n;cin>>n; vector<ll>a(n),b(n); rep(i,0,n)cin>>a[i]; rep(i,0,n)cin>>b[i]; vector<ll>c(n-1),d(n-1); rep(i,0,n-1)c[i]=a[i]^a[i+1]; rep(i,0,n-1)d[i]=b[i]^b[i+1]; { auto e=c,f=d; sort(ALL(e)); sort(ALL(f)); if(a[0]!=b[0]||e!=f){ cout<<-1<<endl; return 0; } } cout<<inversion(c,d)<<endl; return 0; }