oj.uz

Submission #443177

# Submission time Handle Problem Language Result Execution time Memory
443177 2021-07-10T02:51:23 Z penguinhacker Zamjene (COCI16_zamjene) C++14
140 / 140
 1666 ms 60720 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ar array
#define ull unsigned ll

const int mxN=1e6;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, q, a[mxN], b[mxN], p[mxN], s[mxN], bad;
ull val[mxN], h1[mxN], h2[mxN];
unordered_map<ull, ll> mp;
ll ans;

int find(int i) {
	return i^p[i]?p[i]=find(p[i]):i;
}

void add(int u) {
	assert(p[u]==u);
	if (h1[u]^h2[u]) {
		++bad;
		mp[h1[u]-h2[u]]+=s[u];
		auto it=mp.find(h2[u]-h1[u]);
		if (it!=mp.end())
			ans+=s[u]*it->second;
	}
}

void rem(int u) {
	assert(p[u]==u);
	if (h1[u]^h2[u]) {
		--bad;
		auto it=mp.find(h1[u]-h2[u]);
		assert(it!=mp.end());
		if ((it->second-=s[u])==0)
			mp.erase(it);
		it=mp.find(h2[u]-h1[u]);
		if (it!=mp.end())
			ans-=s[u]*it->second;
	}
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> q;
	for (int i=0; i<n; ++i) {
		cin >> a[i], --a[i];
		b[i]=a[i];
	}
	sort(b, b+n);
	for (int i=0; i<mxN; ++i)
		val[i]=rng();
	for (int i=0; i<n; ++i) {
		p[i]=i, s[i]=1;
		h1[i]=val[a[i]];
		h2[i]=val[b[i]];
		add(i);
	}
	while(q--) {
		int t;
		cin >> t;
		if (t==1) {
			int x, y;
			cin >> x >> y, --x, --y;
			int u=find(x), v=find(y);
			if (u==v) {
				swap(a[x], a[y]);
				continue;
			}
			rem(u), rem(v);
			h1[u]-=val[a[x]], h1[v]-=val[a[y]];
			swap(a[x], a[y]);
			h1[u]+=val[a[x]], h1[v]+=val[a[y]];
			add(u), add(v);
		} else if (t==2) {
			int x, y;
			cin >> x >> y, --x, --y;
			int u=find(x), v=find(y);
			if (u==v)
				continue;
			if (s[u]<s[v])
				swap(u, v);
			rem(u), rem(v);
			p[v]=u, s[u]+=s[v];
			h1[u]+=h1[v], h2[u]+=h2[v];
			add(u);
		} else if (t==3) {
			cout << (!bad?"DA":"NE") << "\n";
		} else {
			cout << ans << "\n";
		}
	}
	return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 8140 KB Output is correct
2 Correct 14 ms 8132 KB Output is correct
3 Correct 13 ms 8140 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 8140 KB Output is correct
2 Correct 13 ms 8096 KB Output is correct
3 Correct 13 ms 8128 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 8140 KB Output is correct
2 Correct 12 ms 8188 KB Output is correct
3 Correct 13 ms 8088 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 8124 KB Output is correct
2 Correct 17 ms 8164 KB Output is correct
3 Correct 17 ms 8084 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 8140 KB Output is correct
2 Correct 14 ms 8108 KB Output is correct
3 Correct 13 ms 8172 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 8524 KB Output is correct
2 Correct 17 ms 8556 KB Output is correct
3 Correct 20 ms 8568 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 11604 KB Output is correct
2 Correct 80 ms 11896 KB Output is correct
3 Correct 104 ms 12640 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 667 ms 28188 KB Output is correct
2 Correct 1526 ms 44008 KB Output is correct
3 Correct 1666 ms 46772 KB Output is correct

Subtask #9
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 948 ms 48120 KB Output is correct
2 Correct 1593 ms 60720 KB Output is correct
3 Correct 1012 ms 55168 KB Output is correct

Subtask #10
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 768 ms 43944 KB Output is correct
2 Correct 1045 ms 48496 KB Output is correct
3 Correct 954 ms 55132 KB Output is correct