結果
問題 | No.1209 XOR Into You |
ユーザー | fumofumofuni |
提出日時 | 2021-09-06 21:05:34 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 3,648 bytes |
コンパイル時間 | 2,511 ms |
コンパイル使用メモリ | 221,312 KB |
実行使用メモリ | 81,920 KB |
最終ジャッジ日時 | 2024-12-22 20:17:37 |
合計ジャッジ時間 | 13,878 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | RE | - |
testcase_01 | AC | 2 ms
6,816 KB |
testcase_02 | AC | 2 ms
6,820 KB |
testcase_03 | AC | 2 ms
6,816 KB |
testcase_04 | AC | 83 ms
6,816 KB |
testcase_05 | AC | 85 ms
6,816 KB |
testcase_06 | AC | 102 ms
7,936 KB |
testcase_07 | AC | 334 ms
68,992 KB |
testcase_08 | AC | 295 ms
62,720 KB |
testcase_09 | AC | 286 ms
62,848 KB |
testcase_10 | AC | 227 ms
51,456 KB |
testcase_11 | AC | 286 ms
62,080 KB |
testcase_12 | AC | 276 ms
58,112 KB |
testcase_13 | AC | 304 ms
65,408 KB |
testcase_14 | AC | 262 ms
56,576 KB |
testcase_15 | AC | 278 ms
59,520 KB |
testcase_16 | AC | 270 ms
58,368 KB |
testcase_17 | AC | 252 ms
56,192 KB |
testcase_18 | AC | 397 ms
78,336 KB |
testcase_19 | AC | 263 ms
58,496 KB |
testcase_20 | AC | 313 ms
65,664 KB |
testcase_21 | AC | 229 ms
50,176 KB |
testcase_22 | AC | 246 ms
81,792 KB |
testcase_23 | AC | 245 ms
81,920 KB |
testcase_24 | AC | 246 ms
81,664 KB |
testcase_25 | AC | 383 ms
81,664 KB |
testcase_26 | AC | 382 ms
81,792 KB |
testcase_27 | AC | 384 ms
81,792 KB |
testcase_28 | AC | 387 ms
81,664 KB |
testcase_29 | AC | 378 ms
81,664 KB |
testcase_30 | AC | 381 ms
81,792 KB |
testcase_31 | AC | 162 ms
11,264 KB |
testcase_32 | AC | 162 ms
11,264 KB |
testcase_33 | AC | 161 ms
11,264 KB |
testcase_34 | AC | 171 ms
11,264 KB |
testcase_35 | AC | 163 ms
11,264 KB |
testcase_36 | AC | 163 ms
11,264 KB |
testcase_37 | AC | 113 ms
10,752 KB |
testcase_38 | AC | 303 ms
68,608 KB |
testcase_39 | AC | 269 ms
61,440 KB |
testcase_40 | AC | 245 ms
81,792 KB |
ソースコード
#include<bits/stdc++.h>using namespace std;#define rep(i,n) for(ll i=0;i<n;i++)#define repl(i,l,r) for(ll i=(l);i<(r);i++)#define per(i,n) for(ll i=(n)-1;i>=0;i--)#define perl(i,r,l) for(ll i=r-1;i>=l;i--)#define fi first#define se second#define pb push_back#define ins insert#define pqueue(x) priority_queue<x,vector<x>,greater<x>>#define all(x) (x).begin(),(x).end()#define CST(x) cout<<fixed<<setprecision(x)#define vtpl(x,y,z) vector<tuple<x,y,z>>#define rev(x) reverse(x);using ll=long long;using vl=vector<ll>;using vvl=vector<vector<ll>>;using pl=pair<ll,ll>;using vpl=vector<pl>;using vvpl=vector<vpl>;const ll MOD=1000000007;const ll MOD9=998244353;const int inf=1e9+10;const ll INF=4e18;const ll dy[9]={0,1,-1,0,1,1,-1,-1,0};const ll dx[9]={1,0,0,-1,1,-1,1,-1,0};template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}template <class T>class SegTree {int n;// 葉の数vector<T> data;// データを格納するvectorT def; // 初期値かつ単位元function<T(T, T)> operation; // 区間クエリで使う処理function<T(T, T)> update;// 点更新で使う処理T find(int a, int b) {T val_left = def, val_right = def;for (a += (n - 1), b += (n - 1); a < b; a >>= 1, b >>= 1){if ((a & 1) == 0){val_left = operation(val_left, data[a]);}if ((b & 1) == 0){val_right = operation(data[--b],val_right);}}return operation(val_left, val_right);}public:// _n:必要サイズ, _def:初期値かつ単位元, _operation:クエリ関数,// _update:更新関数SegTree(size_t _n, T _def, function<T(T, T)> _operation,function<T(T, T)> _update=[](T a,T b){return b;}): def(_def), operation(_operation), update(_update) {n = 1;while (n < _n) {n *= 2;}data = vector<T>(2 * n - 1, def);}void set(int i, T x) { data[i + n - 1] = x; }void build() {for (int k=n-2;k>=0;k--) data[k] = operation(data[2*k+1],data[2*k+2]);}// 場所i(0-indexed)の値をxで更新void change(int i, T x) {i += n - 1;data[i] = update(data[i], x);while (i > 0) {i = (i - 1) / 2;data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);}}// [a, b)の区間クエリを実行T query(int a, int b) {//return _query(a, b, 0, 0, n);return find(a,b);}// 添字でアクセスT operator[](int i) {return data[i + n - 1];}};int main(){ll n;cin >> n;vl v(n);rep(i,n)cin >> v[i];vl y(n);rep(i,n)cin >> y[i];if(v[0]!=y[0]||v[n-1]!=y[n-1]){cout << -1 << endl;return 0;}vl a(n-1),b(n-1);rep(i,n-1)a[i]=v[i+1]^v[i];rep(i,n-1)b[i]=y[i+1]^y[i];//rep(i,n-1)cout << a[i] <<" ";cout << endl;//rep(i,n-1)cout << b[i] <<" ";cout << endl;vl hoga=a,hogb=b;sort(all(hoga));sort(all(hogb));if(hoga!=hogb){cout << -1 << endl;return 0;}SegTree<ll> st(n-1,0,[](ll a,ll b){return a+b;});ll ans=0;map<ll,queue<ll>> mp;rep(i,n){mp[a[i]].push(i);}rep(i,n){ans+=mp[b[i]].front()-i+st.query(mp[b[i]].front(),n);st.change(mp[b[i]].front(),1);mp[b[i]].pop();}cout << ans <<endl;}