#543774 (C++14) No.1209 XOR Into You

提出ソース

結果

問題	No.1209 XOR Into You
ユーザー	heno239
提出日時	2020-08-30 13:35:58
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	177 ms / 2,000 ms
コード長	4,333 bytes
コンパイル時間	1,549 ms
コンパイル使用メモリ	127,440 KB
実行使用メモリ	24,832 KB
最終ジャッジ日時	2024-11-15 06:51:55
合計ジャッジ時間	7,494 ms
ジャッジサーバーID （参考情報）	judge3 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	5 ms 11,520 KB
testcase_01	AC	6 ms 11,520 KB
testcase_02	AC	5 ms 11,520 KB
testcase_03	AC	6 ms 11,648 KB
testcase_04	AC	29 ms 12,160 KB
testcase_05	AC	30 ms 12,160 KB
testcase_06	AC	110 ms 24,704 KB
testcase_07	AC	154 ms 22,472 KB
testcase_08	AC	131 ms 21,320 KB
testcase_09	AC	126 ms 21,248 KB
testcase_10	AC	101 ms 19,584 KB
testcase_11	AC	123 ms 21,248 KB
testcase_12	AC	114 ms 20,608 KB
testcase_13	AC	135 ms 21,828 KB
testcase_14	AC	114 ms 20,292 KB
testcase_15	AC	118 ms 20,800 KB
testcase_16	AC	113 ms 20,680 KB
testcase_17	AC	112 ms 20,164 KB
testcase_18	AC	175 ms 24,064 KB
testcase_19	AC	114 ms 20,480 KB
testcase_20	AC	137 ms 21,888 KB
testcase_21	AC	97 ms 19,396 KB
testcase_22	AC	81 ms 24,704 KB
testcase_23	AC	79 ms 24,644 KB
testcase_24	AC	82 ms 24,704 KB
testcase_25	AC	156 ms 24,704 KB
testcase_26	AC	157 ms 24,704 KB
testcase_27	AC	165 ms 24,704 KB
testcase_28	AC	177 ms 24,832 KB
testcase_29	AC	172 ms 24,704 KB
testcase_30	AC	164 ms 24,704 KB
testcase_31	AC	54 ms 14,464 KB
testcase_32	AC	55 ms 14,464 KB
testcase_33	AC	54 ms 14,464 KB
testcase_34	AC	56 ms 14,336 KB
testcase_35	AC	55 ms 14,464 KB
testcase_36	AC	54 ms 14,464 KB
testcase_37	AC	35 ms 14,344 KB
testcase_38	AC	130 ms 22,528 KB
testcase_39	AC	114 ms 21,188 KB
testcase_40	AC	79 ms 24,704 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m = mod) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 19;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

int gcd(int a, int b) {
	if (a < b)swap(a, b);
	while (b) {
		int r = a % b; a = b; b = r;
	}
	return a;
}
struct uf {
private:
	vector<int> par, ran;
public:
	uf(int n) {
		par.resize(n, 0);
		ran.resize(n, 0);
		rep(i, n) {
			par[i] = i;
		}
	}
	int find(int x) {
		if (par[x] == x)return x;
		else return par[x] = find(par[x]);
	}
	void unite(int x, int y) {
		x = find(x), y = find(y);
		if (x == y)return;
		if (ran[x] < ran[y]) {
			par[x] = y;
		}
		else {
			par[y] = x;
			if (ran[x] == ran[y])ran[x]++;
		}
	}
	bool same(int x, int y) {
		return find(x) == find(y);
	}
};
struct BIT {
private:
	vector<ll> node; int n;
public:
	BIT(int n_) {
		n = n_; node.resize(n, 0);
	}
	//0-indexed
	void add(int a, ll w) {
		for (int i = a; i < n; i |= i + 1)node[i] += w;
	}
	//[0,a)
	ll sum(int a) {
		ll ret = 0;
		for (int i = a - 1; i >= 0; i = (i & (i + 1)) - 1)ret += node[i];
		return ret;
	}
	//[a,b)
	ll sum(int a, int b) {
		return sum(b) - sum(a);
	}
};
void solve() {
	int n; cin >> n;
	vector<int> a(n), b(n);
	rep(i, n) {
		cin >> a[i];
	}
	rep(i, n) {
		cin >> b[i];
	}
	if (a[0] != b[0] || a.back() != b.back()) {
		cout << -1 << "\n"; return;
	}
	vector<int> c(n - 1), d(n - 1);
	rep(i, n - 1)c[i] = a[i] ^ a[i + 1];
	rep(i, n - 1)d[i] = b[i] ^ b[i + 1];
	n = c.size();
	map<int, vector<int>> loc;
	per(i, n) {
		loc[c[i]].push_back(i);
	}
	BIT bt(n);
	ll ans = 0;
	rep(i, n) {
		vector<int>& v = loc[d[i]];
		if (v.empty()) {
			cout << -1 << "\n"; return;
		}
		int id = v.back(); v.pop_back();
		ans += id - bt.sum(0, id);
		bt.add(id, 1);
	}
	cout << ans << "\n";
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(15);
	//init_f(); 
	//init();
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}

yukicoder

結果

テストケース

ソースコード