結果
問題 | No.1209 XOR Into You |
ユーザー |
![]() |
提出日時 | 2020-07-29 16:27:41 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 313 ms / 2,000 ms |
コード長 | 2,458 bytes |
コンパイル時間 | 2,794 ms |
コンパイル使用メモリ | 129,168 KB |
実行使用メモリ | 27,648 KB |
最終ジャッジ日時 | 2024-06-29 02:31:22 |
合計ジャッジ時間 | 12,520 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 37 |
ソースコード
#include <iostream>#include <string>#include <vector>#include <algorithm>#include <utility>#include <tuple>#include <cstdint>#include <cstdio>#include <map>#include <queue>#include <set>#include <stack>#include <deque>#include <unordered_map>#include <unordered_set>#include <bitset>#include <cctype>#include <functional>#include <ctime>#include <fstream>#include <cmath>#include <limits>#include <numeric>#include <type_traits>#include <iomanip>#include <float.h>#include <math.h>#include <random>#include <cassert>using namespace std;using ll = long long;ll merge_cnt(vector<ll>& a) {ll n = a.size();if (n <= 1) { return 0; }ll cnt = 0;vector<ll> b(a.begin(), a.begin() + n / 2);vector<ll> c(a.begin() + n / 2, a.end());cnt += merge_cnt(b);cnt += merge_cnt(c);ll ai = 0, bi = 0, ci = 0;while (ai < n) {if (bi < b.size() && (ci == c.size() || b[bi] <= c[ci])) {a[ai++] = b[bi++];}else {cnt += n / 2 - bi;a[ai++] = c[ci++];}}return cnt;}int main() {ll n;cin >> n;assert(n >= 3 && n <= 100000);vector<ll> a(n);vector<ll> b(n);for (int i = 0; i < n; i++) {cin >> a[i];assert(a[i] >= 0 && a[i] < (1ll << 30));}for (int i = 0; i < n; i++) {cin >> b[i];assert(b[i] >= 0 && b[i] < (1ll << 30));}if (a[0] != b[0])cout << -1 << endl;else {vector<ll> aa(n - 1);vector<ll> as(n - 1);vector<ll> bb(n - 1);vector<ll> bs(n - 1);for (int i = 0; i < n-1; i++) {aa[i] = a[i]^a[i+1];as[i] = aa[i];}for (int i = 0; i < n - 1; i++) {bb[i] = b[i] ^ b[i + 1];bs[i] = bb[i];}sort(as.begin(), as.end());sort(bs.begin(), bs.end());ll fl = 1;for (int i = 0; i < n - 1; i++) {if (as[i] != bs[i])fl = 0;}if (fl == 0)cout << -1 << endl;else {vector<ll> t(n-1);map<ll, vector<ll>> m;for (int i = 0; i < n - 1; i++) {m[bb[i]].push_back(i);}map<ll, ll>co;for (int i = 0; i < n - 1; i++) {t[i] = m[aa[i]][co[aa[i]]];co[aa[i]]++;}cout << merge_cnt(t) << endl;}}}