oj.uz

Submission #459232

# Submission time Handle Problem Language Result Execution time Memory
459232 2021-08-08T10:56:06 Z Peti Keys (IOI21_keys) C++17
100 / 100
 2325 ms 141136 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxn = (int)3e5+1;

vector<map<int, vector<int>>> elek;
vector<vector<int>> g;
vector<set<int>> keys;
vector<int> osok, mely, meret, pontdb;
vector<bool> volt, kesz, kiel;
int n;

int os(int x) { return osok[x] == -1 ? x : osok[x] = os(osok[x]); }

void unio(int a, int b){
	//cout<<"union"<<endl;
	a = os(a);
	b = os(b);
	if(a == b){
		//cout<<"end union"<<endl;
		return;
	}
	if(mely[a] < mely[b]) swap(a, b);

	if(meret[a] < meret[b]){
		swap(g[a], g[b]);
		swap(elek[a], elek[b]);
		swap(keys[a], keys[b]);
	}

	g[a].insert(g[a].end(), g[b].begin(), g[b].end());
	for(const int &x : keys[b]){
		if(keys[a].insert(x).second){
			auto it = elek[a].find(x);
			if(it != elek[a].end()){
				g[a].insert(g[a].end(), it->second.begin(), it->second.end());
				elek[a].erase(it);
			}
		} else
			meret[a]--;
	}
	for(auto &d : elek[b]){
		if(keys[a].count(d.first)){
			g[a].insert(g[a].begin(), d.second.begin(), d.second.end());
		} else{
			vector<int> &v = elek[a][d.first];
			v.insert(v.end(), d.second.begin(), d.second.end());
		}
	}

	osok[b] = a;
	meret[a] += meret[b];
	pontdb[a] += pontdb[b];
	mely[a] += (int)(mely[a] == mely[b]);
	kiel[a] = kiel[a] || kiel[b];
	//cout<<"end union"<<endl;
}

int pont[maxn];
void bejar(int s){
	//cout<<"start"<<endl;
	int x = 0;
	pont[x++] = s;
	while (x > 0)
	{
		//cout<<x<<' '<<pont[x-1]<<'\n';
		int p = pont[x-1];
		//cout<<"node: "<<p<<'\n';
		volt[p] = true;
		if(g[p].empty()){
			//cout<<"case 1"<<endl;
			--x;
			kesz[p] = true;
			if(x > 0)
				kiel[pont[x-1]] = true;
			//cout<<"back "<<p<<'\n';
		} else if(volt[os(g[p].back())] && !kesz[os(g[p].back())]){
			//cout<<"case 2"<<endl;
			int temp = os(g[p].back());
			g[p].pop_back();
			while (pont[x-1] != temp)
			{
				unio(pont[x-1], pont[x-2]);
				--x;
			}
			pont[x-1] = os(p);
		} else if(!volt[os(g[p].back())]){
			//cout<<"case 3"<<endl;
			pont[x++] = os(g[p].back());
			g[p].pop_back();
		} else{
			//cout<<"case 4"<<endl;
			kiel[p] = true;
			g[p].pop_back();
		}
	}
}

std::vector<int> find_reachable(std::vector<int> r, std::vector<int> u, std::vector<int> v, std::vector<int> c) {
	n = (int)r.size();
	g.resize(n);
	elek.resize(n);
	keys.resize(n);
	osok.assign(n, -1);
	mely.assign(n, 0);
	meret.assign(n, 1);
	pontdb.assign(n, 1);
	volt.assign(n, false);
	kiel.assign(n, false);
	kesz.assign(n, false);

	for(int i = 0; i < n; i++)
		keys[i].insert(r[i]);

	for(int i = 0; i < (int)u.size(); i++){
		++meret[u[i]];
		++meret[v[i]];
		if(r[u[i]] == c[i])
			g[u[i]].push_back(v[i]);
		else
			elek[u[i]][c[i]].push_back(v[i]);
		if(r[v[i]] == c[i])
			g[v[i]].push_back(u[i]);
		else
			elek[v[i]][c[i]].push_back(u[i]);
	}

	for(int i = 0; i < n; i++)
		if(!volt[os(i)])
			bejar(os(i));

	int legk = maxn;
	for(int i = 0; i < n; i++)
		if(!kiel[os(i)])
			legk = min(legk, pontdb[os(i)]);

	vector<int> ret(n, 0);
	for(int i = 0; i < n; i++){
		//cout<<i<<": "<<os(i)<<' '<<pontdb[os(i)]<<' '<<kiel[os(i)]<<'\n';
		if(!kiel[os(i)] && pontdb[os(i)] == legk)
			ret[i] = 1;
	}

	return ret;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 300 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 300 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 300 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 300 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 300 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 300 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 300 KB Output is correct
27 Correct 3 ms 1100 KB Output is correct
28 Correct 2 ms 1100 KB Output is correct
29 Correct 3 ms 1100 KB Output is correct
30 Correct 2 ms 716 KB Output is correct
31 Correct 2 ms 588 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 2 ms 588 KB Output is correct
34 Correct 1 ms 588 KB Output is correct
35 Correct 2 ms 588 KB Output is correct
36 Correct 4 ms 972 KB Output is correct
37 Correct 3 ms 972 KB Output is correct
38 Correct 3 ms 1100 KB Output is correct
39 Correct 3 ms 1100 KB Output is correct
40 Correct 2 ms 716 KB Output is correct
41 Correct 3 ms 972 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 300 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 638 ms 78136 KB Output is correct
11 Correct 407 ms 80340 KB Output is correct
12 Correct 105 ms 22176 KB Output is correct
13 Correct 548 ms 103704 KB Output is correct
14 Correct 259 ms 82272 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 300 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 300 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 300 KB Output is correct
27 Correct 3 ms 1100 KB Output is correct
28 Correct 2 ms 1100 KB Output is correct
29 Correct 3 ms 1100 KB Output is correct
30 Correct 2 ms 716 KB Output is correct
31 Correct 2 ms 588 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 2 ms 588 KB Output is correct
34 Correct 1 ms 588 KB Output is correct
35 Correct 2 ms 588 KB Output is correct
36 Correct 4 ms 972 KB Output is correct
37 Correct 3 ms 972 KB Output is correct
38 Correct 3 ms 1100 KB Output is correct
39 Correct 3 ms 1100 KB Output is correct
40 Correct 2 ms 716 KB Output is correct
41 Correct 3 ms 972 KB Output is correct
42 Correct 638 ms 78136 KB Output is correct
43 Correct 407 ms 80340 KB Output is correct
44 Correct 105 ms 22176 KB Output is correct
45 Correct 548 ms 103704 KB Output is correct
46 Correct 259 ms 82272 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 236 ms 80488 KB Output is correct
51 Correct 233 ms 82256 KB Output is correct
52 Correct 323 ms 84584 KB Output is correct
53 Correct 303 ms 84460 KB Output is correct
54 Correct 307 ms 84456 KB Output is correct
55 Correct 646 ms 92492 KB Output is correct
56 Correct 409 ms 110476 KB Output is correct
57 Correct 324 ms 106984 KB Output is correct
58 Correct 636 ms 115088 KB Output is correct
59 Correct 2224 ms 125008 KB Output is correct
60 Correct 759 ms 106268 KB Output is correct
61 Correct 815 ms 106660 KB Output is correct
62 Correct 1064 ms 140948 KB Output is correct
63 Correct 336 ms 92204 KB Output is correct
64 Correct 5 ms 1612 KB Output is correct
65 Correct 4 ms 1612 KB Output is correct
66 Correct 963 ms 141136 KB Output is correct
67 Correct 23 ms 8524 KB Output is correct
68 Correct 39 ms 14016 KB Output is correct
69 Correct 2325 ms 119784 KB Output is correct
70 Correct 75 ms 27716 KB Output is correct
71 Correct 237 ms 83060 KB Output is correct
72 Correct 2260 ms 119764 KB Output is correct
73 Correct 988 ms 141088 KB Output is correct