結果

問題 No.1788 Same Set
ユーザー heno239heno239
提出日時 2021-12-17 02:23:04
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,890 ms / 4,000 ms
コード長 6,998 bytes
コンパイル時間 2,527 ms
コンパイル使用メモリ 162,708 KB
実行使用メモリ 62,204 KB
最終ジャッジ日時 2023-10-12 02:56:26
合計ジャッジ時間 40,529 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 17 ms
30,072 KB
testcase_01 AC 17 ms
30,056 KB
testcase_02 AC 18 ms
30,180 KB
testcase_03 AC 18 ms
30,000 KB
testcase_04 AC 17 ms
30,112 KB
testcase_05 AC 16 ms
30,000 KB
testcase_06 AC 18 ms
30,160 KB
testcase_07 AC 18 ms
30,076 KB
testcase_08 AC 18 ms
30,012 KB
testcase_09 AC 17 ms
30,088 KB
testcase_10 AC 17 ms
30,144 KB
testcase_11 AC 255 ms
43,512 KB
testcase_12 AC 308 ms
43,628 KB
testcase_13 AC 346 ms
43,712 KB
testcase_14 AC 438 ms
44,192 KB
testcase_15 AC 631 ms
44,028 KB
testcase_16 AC 854 ms
44,244 KB
testcase_17 AC 1,534 ms
56,776 KB
testcase_18 AC 1,651 ms
50,788 KB
testcase_19 AC 1,095 ms
62,204 KB
testcase_20 AC 434 ms
44,128 KB
testcase_21 AC 667 ms
44,088 KB
testcase_22 AC 822 ms
44,240 KB
testcase_23 AC 830 ms
44,372 KB
testcase_24 AC 1,202 ms
44,872 KB
testcase_25 AC 1,351 ms
44,896 KB
testcase_26 AC 1,114 ms
44,972 KB
testcase_27 AC 620 ms
46,360 KB
testcase_28 AC 1,794 ms
47,552 KB
testcase_29 AC 1,228 ms
45,892 KB
testcase_30 AC 662 ms
46,200 KB
testcase_31 AC 1,417 ms
46,100 KB
testcase_32 AC 1,138 ms
49,016 KB
testcase_33 AC 1,332 ms
48,984 KB
testcase_34 AC 1,778 ms
50,004 KB
testcase_35 AC 1,890 ms
51,100 KB
testcase_36 AC 1,834 ms
51,088 KB
testcase_37 AC 1,793 ms
51,496 KB
testcase_38 AC 1,628 ms
50,660 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#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<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
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 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 double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-4;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	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)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
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];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}

int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
template<typename T>
struct BIT {
private:
	vector<T> node; int n;
public:
	BIT(int n_) {
		n = n_; node.resize(n, 0);
	}
	//0-indexed
	void add(int a, T w) {
		for (int i = a; i < n; i |= i + 1)node[i] += w;
	}
	//[0,a)
	T sum(int a) {
		T ret = 0;
		for (int i = a - 1; i >= 0; i = (i & (i + 1)) - 1)ret += node[i];
		return ret;
	}
	//[a,b)
	T sum(int a, int b) {
		return sum(b) - sum(a);
	}
};


const int sup = 400005;
void solve() {
	int n; cin >> n;
	vector<int> a(n);
	vector<int> b(n);
	rep(i, n)cin >> a[i];
	rep(i, n)cin >> b[i];
	vector<vector<int>> va(sup), vb(sup);
	rep(i, n) {
		va[a[i]].push_back(i);
		vb[b[i]].push_back(i);
	}
	vector<int> nexaa(n, n), nexab(n, n), nexba(n, n), nexbb(n, n);
	vector<int> preaa(n, -1), preab(n, -1), preba(n, -1), prebb(n, -1);
	rep(i, n) {
		int loc = upper_bound(all(va[a[i]]), i) - va[a[i]].begin();
		if (loc < va[a[i]].size()) {
			int to = va[a[i]][loc];
			nexaa[i] = to; preaa[to] = i;
		}
		loc = upper_bound(all(vb[a[i]]), i) - vb[a[i]].begin();
		if (loc < vb[a[i]].size()) {
			int to = vb[a[i]][loc];
			nexab[i] = to, preba[to] = i;
		}
		loc = upper_bound(all(va[b[i]]), i) - va[b[i]].begin();
		if (loc < va[b[i]].size()) {
			int to = va[b[i]][loc];
			nexba[i] = to; preab[to] = i;
		}
		loc = upper_bound(all(vb[b[i]]), i) - vb[b[i]].begin();
		if (loc < vb[b[i]].size()) {
			int to = vb[b[i]][loc];
			nexbb[i] = to; prebb[to] = i;
		}
	}
	ll ans = 0;
	function<void(int, int)> yaru = [&](int l, int r) {
		if (l + 1 == r) {
			if (a[l] == b[l])ans++;
			return;
		}
		int m = (l + r) / 2;
		yaru(l, m); yaru(m, r);
		BIT<int> bt(r - m);
		vector<vector<int>> adid(m-l);
		multiset<int> st;
		auto findloc = [&](int val, int isa, int low) {
			int res;
			if (isa) {
				res = lower_bound(all(vb[val]), m) - vb[val].begin();
				if (low)res--;
				if (res == (int)vb[val].size()) {
					res = n;
				}
				else if (res >= 0)res = vb[val][res];
			}
			else {
				res = lower_bound(all(va[val]), m) - va[val].begin();
				if (low)res--;
				if (res == (int)va[val].size()) {
					res = n;
				}
				else if (res >= 0)res = va[val][res];
			}
			return res;
		};
		st.insert(m - 1);
		for (int i = m; i < r; i++) {
			if (preaa[i]<m) {
				if (preab[i]<m) {
					int loc = findloc(a[i], 1, 1);
					st.insert(loc);
				}
				else {
					int loc = findloc(a[i], 0, 1);
					st.erase(st.find(loc));
				}
			}
			if (prebb[i]<m) {
				if (preba[i]<m&&a[i]!=b[i]) {
					int loc = findloc(b[i], 0, 1);
					st.insert(loc);
				}
				else {
					int loc = findloc(b[i], 1, 1);
					st.erase(st.find(loc));
				}
			}
			int mi = *st.begin();
			if (mi >= l) {
				adid[mi - l].push_back(i - m);
			}
		}
		st.clear();
		st.insert(m);
		for (int i = m - 1; i >= l; i--) {
			for (int id : adid[i - l]) {
				bt.add(id, 1);
			}
			if (nexaa[i]>=m) {
				if (nexab[i]>=m) {
					int loc = findloc(a[i], 1, 0);
					st.insert(loc);
				}
				else {
					int loc = findloc(a[i], 0, 0);
					st.erase(st.find(loc));
				}
			}
			if (nexbb[i]>=m) {
				if (nexba[i]>=m&&a[i]!=b[i]) {
					int loc = findloc(b[i], 0, 0);
					st.insert(loc);
				}
				else {
					int loc = findloc(b[i], 1, 0);
					st.erase(st.find(loc));
				}
			}
			int le = *--st.end(); le -= m;
			if (le < r - m) {
				ans += bt.sum(le, r - m);
			}
		}
	};
	yaru(0, n);
	cout << ans << "\n";
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(8);
	//init_f();
	//init();
	//while(true)
	//expr();
	//init();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}
0