oj.uz

Submission #419271

# Submission time Handle Problem Language Result Execution time Memory
419271 2021-06-06T17:27:55 Z SirCovidThe19th Zamjene (COCI16_zamjene) C++14
140 / 140
 3088 ms 374936 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;

#define ll long long

const ll mx = 1e6+5, p = 7261523;

int n, q; int vals[mx], sorted[mx];
int par[mx], sz[mx]; ll pPow[mx], cnP[mx], cnQ[mx];
gp_hash_table<ll, ll> diff; ll cnt;

int find(int node) { return (node == par[node]) ? node : par[node] = find(par[node]); }
void upd(int i, int change){
	change *= sz[i];
	if (cnP[i] != cnQ[i]) cnt += diff[cnQ[i]-cnP[i]]*(ll)change;
	diff[cnP[i]-cnQ[i]] += change;
}
void merge(int a, int b){
	a = find(a); b = find(b);
    if (a == b) return; 
    if (sz[a] > sz[b]) swap(a, b);
	upd(a, -1); upd(b, -1);
	par[a] = b; sz[b] += sz[a]; cnP[b] += cnP[a]; cnQ[b] += cnQ[a];
	upd(b, 1);
}
void Swap(int a, int b){
    int parA = find(a), parB = find(b);
	upd(parA, -1); upd(parB, -1);
	cnP[parA] = (cnP[parA]-pPow[vals[a]]+pPow[vals[b]]); 
	cnP[parB] = (cnP[parB]-pPow[vals[b]]+pPow[vals[a]]); 
	upd(parA, 1); upd(parB, 1);
	swap(vals[a], vals[b]);
}
int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); 
	cin >> n >> q; pPow[0] = 1; 
	for (int i = 0; i < n; i++){ 
		cin >> vals[i]; sorted[i] = vals[i]; 
		pPow[i+1] = (pPow[i]*p); 
	}
	sort(sorted, sorted+n); iota(par, par+n, 0); fill(sz, sz+n, 1);
	for (int i = 0; i < n; i++){
		cnP[i] = pPow[vals[i]], cnQ[i] = pPow[sorted[i]]; 
		diff[cnP[i]-cnQ[i]]++;
	}
    map<int, bool> visited;
	for (int i = 0; i < n; i++){
		if (cnP[i] != cnQ[i] and !visited[cnP[i]-cnQ[i]]){
			cnt += diff[cnP[i]-cnQ[i]]*diff[cnQ[i]-cnP[i]];
            visited[cnP[i]-cnQ[i]] = true; visited[cnQ[i]-cnP[i]] = true;
        }
    }
	for (int i = 0; i < q; i++){
		int t, a, b; cin >> t; if (t <= 2) { cin >> a >> b; a--; b--; }
		if (t == 1) Swap(a, b);
		if (t == 2) merge(a, b);
		if (t == 3) cout<<((diff[0] == n) ? "DA":"NE")<<endl;
		if (t == 4) cout<<cnt<<endl;
	}
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 2 ms 460 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 2 ms 460 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 2 ms 588 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 972 KB Output is correct
2 Correct 12 ms 980 KB Output is correct
3 Correct 13 ms 1100 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 4688 KB Output is correct
2 Correct 143 ms 6984 KB Output is correct
3 Correct 156 ms 14072 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1401 ms 41732 KB Output is correct
2 Correct 2454 ms 199532 KB Output is correct
3 Correct 3088 ms 374936 KB Output is correct

Subtask #9
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1789 ms 117080 KB Output is correct
2 Correct 2340 ms 126828 KB Output is correct
3 Correct 1673 ms 116152 KB Output is correct

Subtask #10
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1564 ms 47908 KB Output is correct
2 Correct 1835 ms 117080 KB Output is correct
3 Correct 1659 ms 115904 KB Output is correct