oj.uz

Submission #443170

# Submission time Handle Problem Language Result Execution time Memory
443170 2021-07-10T01:50:57 Z penguinhacker Zamjene (COCI16_zamjene) C++14
98 / 140
 4830 ms 77752 KB 
#include <bits/stdc++.h>
using namespace std;

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

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];
map<ull, ll> mp;
ll ans;

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

void add(int i) {
	int u=find(i);
	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 i) {
	int u=find(i);
	if (h1[u]^h2[u]) {
		--bad;
		auto it=mp.find(h1[u]-h2[u]);
		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;
			rem(x), rem(y);
			h1[find(x)]-=val[a[x]], h1[find(y)]-=val[a[y]];
			swap(a[x], a[y]);
			h1[find(x)]+=val[a[x]], h1[find(y)]+=val[a[y]];
			add(x), add(y);
		} 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
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 8132 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 8108 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 8100 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 8140 KB Output is correct
2 Correct 13 ms 8184 KB Output is correct
3 Correct 13 ms 8136 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 8192 KB Output is correct
2 Correct 13 ms 8196 KB Output is correct
3 Correct 15 ms 8160 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 8620 KB Output is correct
2 Correct 18 ms 8564 KB Output is correct
3 Correct 22 ms 8700 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 12708 KB Output is correct
2 Correct 97 ms 13256 KB Output is correct
3 Correct 157 ms 14160 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1046 ms 38032 KB Output is correct
2 Correct 4306 ms 61216 KB Output is correct
3 Correct 4830 ms 67780 KB Output is correct

Subtask #9
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1822 ms 62732 KB Output is correct
2 Correct 4003 ms 77752 KB Output is correct
3 Correct 1641 ms 76560 KB Output is correct

Subtask #10
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1025 ms 55248 KB Output is correct
2 Correct 2009 ms 63428 KB Output is correct
3 Correct 1640 ms 76476 KB Output is correct