結果
問題 | No.1209 XOR Into You |
ユーザー | hamray |
提出日時 | 2020-11-22 04:42:36 |
言語 | C++11 (gcc 11.4.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,665 bytes |
コンパイル時間 | 2,173 ms |
コンパイル使用メモリ | 167,008 KB |
実行使用メモリ | 21,780 KB |
最終ジャッジ日時 | 2023-09-30 22:27:47 |
合計ジャッジ時間 | 9,512 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,376 KB |
testcase_03 | AC | 2 ms
4,380 KB |
testcase_04 | AC | 117 ms
13,908 KB |
testcase_05 | WA | - |
testcase_06 | AC | 116 ms
13,968 KB |
testcase_07 | AC | 160 ms
18,652 KB |
testcase_08 | AC | 143 ms
17,300 KB |
testcase_09 | AC | 139 ms
17,248 KB |
testcase_10 | AC | 111 ms
14,848 KB |
testcase_11 | AC | 138 ms
17,112 KB |
testcase_12 | AC | 127 ms
16,176 KB |
testcase_13 | AC | 151 ms
17,884 KB |
testcase_14 | AC | 126 ms
15,876 KB |
testcase_15 | AC | 132 ms
16,560 KB |
testcase_16 | AC | 128 ms
16,332 KB |
testcase_17 | AC | 122 ms
15,724 KB |
testcase_18 | AC | 190 ms
20,732 KB |
testcase_19 | AC | 129 ms
16,268 KB |
testcase_20 | AC | 150 ms
17,884 KB |
testcase_21 | AC | 110 ms
14,580 KB |
testcase_22 | AC | 111 ms
21,628 KB |
testcase_23 | AC | 111 ms
21,612 KB |
testcase_24 | AC | 112 ms
21,780 KB |
testcase_25 | AC | 208 ms
21,500 KB |
testcase_26 | AC | 202 ms
21,560 KB |
testcase_27 | AC | 204 ms
21,732 KB |
testcase_28 | AC | 200 ms
21,632 KB |
testcase_29 | AC | 202 ms
21,496 KB |
testcase_30 | AC | 199 ms
21,616 KB |
testcase_31 | AC | 70 ms
7,016 KB |
testcase_32 | AC | 68 ms
7,088 KB |
testcase_33 | AC | 69 ms
7,108 KB |
testcase_34 | AC | 70 ms
7,044 KB |
testcase_35 | AC | 69 ms
7,244 KB |
testcase_36 | AC | 69 ms
7,108 KB |
testcase_37 | AC | 35 ms
6,780 KB |
testcase_38 | AC | 153 ms
18,660 KB |
testcase_39 | AC | 137 ms
17,024 KB |
testcase_40 | AC | 112 ms
21,492 KB |
ソースコード
#include <bits/stdc++.h> //#include <atcoder/all> //using namespace atcoder; #pragma GCC target ("avx2") #pragma GCC optimization ("O3") #pragma GCC optimization ("unroll-loops") const double pi = 3.141592653589793238462643383279; using namespace std; //typedef //------------------------------------------ typedef vector<int> VI; typedef vector<VI> VVI; typedef vector<string> VS; typedef pair<int, int> PII; typedef pair<long long, long long> PLL; typedef pair<int, PII> TIII; typedef long long LL; typedef unsigned long long ULL; typedef vector<LL> VLL; typedef vector<VLL> VVLL; //container util //------------------------------------------ #define ALL(a) (a).begin(), (a).endf() #define RALL(a) (a).rbegin(), (a).rend() #define PB push_back #define MP make_pair #define SZ(a) int((a).size()) #define SQ(a) ((a) * (a)) #define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).endf(); ++i) #define EXIST(s, e) ((s).find(e) != (s).endf()) #define SORT(c) sort((c).begin(), (c).endf()) //repetition //------------------------------------------ #define FOR(i, s, n) for (int i = s; i < (int)n; ++i) #define REP(i, n) FOR(i, 0, n) #define MOD 1000000007 #define rep(i, a, b) for (int i = a; i < (b); ++i) #define trav(a, x) for (auto &a : x) #define all(x) x.begin(), x.end() typedef long long ll; typedef pair<int, int> pii; typedef vector<int> vi; #define chmin(x, y) x = min(x, y) #define chmax(x, y) x = max(x, y) const double EPS = 1e-9, PI = acos(-1); //ここから編集 typedef string::const_iterator State; template< int mod > struct ModInt { int x; ModInt() : x(0) {} ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {} ModInt &operator+=(const ModInt &p) { if((x += p.x) >= mod) x -= mod; return *this; } ModInt &operator-=(const ModInt &p) { if((x += mod - p.x) >= mod) x -= mod; return *this; } ModInt &operator*=(const ModInt &p) { x = (int) (1LL * x * p.x % mod); return *this; } ModInt &operator/=(const ModInt &p) { *this *= p.inverse(); return *this; } ModInt operator-() const { return ModInt(-x); } ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; } ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; } ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; } ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; } bool operator==(const ModInt &p) const { return x == p.x; } bool operator!=(const ModInt &p) const { return x != p.x; } ModInt inverse() const { int a = x, b = mod, u = 1, v = 0, t; while(b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); } return ModInt(u); } ModInt pow(int64_t n) const { ModInt ret(1), mul(x); while(n > 0) { if(n & 1) ret *= mul; mul *= mul; n >>= 1; } return ret; } friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; } friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt< mod >(t); return (is); } static int get_mod() { return mod; } }; using modint = ModInt< 1000000007 >; template< typename T > struct Combination { vector< T > _fact, _rfact, _inv; Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) { _fact[0] = _rfact[sz] = _inv[0] = 1; for(int i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i; _rfact[sz] /= _fact[sz]; for(int i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1); for(int i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1]; } inline T fact(int k) const { return _fact[k]; } inline T rfact(int k) const { return _rfact[k]; } inline T inv(int k) const { return _inv[k]; } T P(int n, int r) const { if(r < 0 || n < r) return 0; return fact(n) * rfact(n - r); } T C(int p, int q) const { if(q < 0 || p < q) return 0; return fact(p) * rfact(q) * rfact(p - q); } T H(int n, int r) const { if(n < 0 || r < 0) return (0); return r == 0 ? 1 : C(n + r - 1, r); } }; template<typename T = int> struct BIT{ vector<T> node; int N; BIT(int n){ N = n; node.resize(N+1); } void add(int i, T x){ i++; while(i <= N){ node[i] += x; i += (i & -i); } } T sum(int i){ T res = 0; while(i > 0){ res += node[i]; i -= (i & -i); } return res; } }; int main() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(12); int N; cin >> N; vector<int> a(N), b(N); REP(i,N) cin >> a[i]; REP(i,N) cin >> b[i]; vector<int> v1, v2; map<int, int> cnt1, cnt2; REP(i,N-1) { v1.push_back(a[i]^a[i+1]); cnt1[a[i]^a[i+1]]++; } REP(i,N-1) { v2.push_back(b[i]^b[i+1]); cnt2[b[i]^b[i+1]]++; } for(auto e: cnt1){ if(e.second != cnt2[e.first]){ cout << -1 << endl; return 0; } } vector<int> v; REP(i,v1.size()) v.push_back(v1[i]); sort(all(v)); v.erase(unique(all(v)), v.end()); REP(i,v1.size()) v1[i] = lower_bound(all(v), v1[i]) - v.begin(); REP(i,v2.size()) v2[i] = lower_bound(all(v), v2[i]) - v.begin(); vector<int> vv[v.size()]; REP(i,v1.size()) vv[v2[i]].push_back(i); vector<int> cnts(v.size()); vector<int> arr; REP(i,v1.size()){ int val = v1[i]; arr.push_back(vv[val][cnts[val]]); cnts[val]++; } BIT<ll> bit(101010); ll ans = 0; REP(i,arr.size()){ ans += i - bit.sum(arr[i]); bit.add(arr[i], 1); } cout << ans << endl; return 0; }