oj.uz

Submission #540555

# Submission time Handle Problem Language Result Execution time Memory
540555 2022-03-21T00:37:36 Z Lyestria Keys (IOI21_keys) C++17
100 / 100
 1297 ms 149184 KB 
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef long long ll;

const int mn = 3e5+10;

vector<int> g[mn];
unordered_map<int,vector<int>> uval[mn];
set<int> keys[mn];

void merge(int a, int b) {
	for(int k:keys[b])keys[a].insert(k);
	g[a].insert(g[a].end(), g[b].begin(), g[b].end());
	for(auto& [k,v]: uval[b]) {
		if(keys[a].count(k)){
			g[a].insert(g[a].end(), v.begin(), v.end());
		}
		else {
			auto &v2 = uval[a][k];
			v2.insert(v2.end(), v.begin(), v.end());
		}
	}
	for(int k:keys[b]){
		auto &v = uval[a][k];
		g[a].insert(g[a].end(), v.begin(), v.end());
		uval[a].erase(k);
	}
	g[b].clear();
	uval[b].clear();
	keys[b].clear();
}

struct dsu {
	vi p, sz;
	dsu(int n) : p(n), sz(n, 1) {
		for (int i = 0; i < n; i++) p[i] = i;
	}
	int f(int x) { return p[x]==x ? x : p[x] = f(p[x]); }
	void mrg(int a,int b) {
		a = f(a), b = f(b);
		if (a == b) return;
		if (sz[a] < sz[b]) swap(a, b);
		merge(a,b);
		p[b] = a;
		sz[a] += sz[b];
	}
} dsu(mn);

int bans=0x3f3f3f3f;
set<int>ans;

bool vis[mn], ins[mn];
int dfs(int x){
	vis[x]=ins[x]=1;
	while(g[x].size()){
		int y=dsu.f(g[x].back());
		g[x].pop_back();
		if(x==y)continue;
		if(ins[y]){
			ins[x]=0;
			return y;
		}
		else if(vis[y]){
			ins[x]=0;
			return -1;
		}
		int ret = dfs(y);
		if(ret == -1) {
			ins[x]=0;
			return -1;
		}
		else{
			dsu.mrg(x,y);
			if(ret == x){
				ins[x]=0;
				x = dsu.f(x);
				return dfs(x);
			}
			else {
				ins[x]=0;
				return ret;
			}
		}
	}
	if(dsu.sz[x]<bans)ans.clear();
	if(dsu.sz[x]<=bans){
		ans.insert(x);
		bans=dsu.sz[x];
	}
	ins[x]=0;
	return -1;
}


std::vector<int> find_reachable(std::vector<int> r, std::vector<int> u, std::vector<int> v, std::vector<int> c) {
	int n = r.size();
	for(int i=0;i<n;i++)keys[i].insert(r[i]);
	auto addEdge = [&](int u, int v, int c) {
		if(keys[u].count(c))g[u].push_back(v);
		else uval[u][c].push_back(v);
	};
	for(int i=0;i<u.size();i++){
		addEdge(u[i],v[i],c[i]);
		addEdge(v[i],u[i],c[i]);
	}
	for(int i=0;i<n;i++)if(!vis[i])dfs(i);
	vi ret(n);
	for(int i=0;i<n;i++)if(ans.count(dsu.f(i)))ret[i]=1;
	return ret;
}

Compilation message

keys.cpp: In function 'std::vector<int> find_reachable(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
keys.cpp:103:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |  for(int i=0;i<u.size();i++){
      |              ~^~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 40148 KB Output is correct
2 Correct 22 ms 40212 KB Output is correct
3 Correct 22 ms 40148 KB Output is correct
4 Correct 22 ms 40240 KB Output is correct
5 Correct 22 ms 40220 KB Output is correct
6 Correct 22 ms 40224 KB Output is correct
7 Correct 22 ms 40212 KB Output is correct
8 Correct 22 ms 40148 KB Output is correct
9 Correct 21 ms 40220 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 40148 KB Output is correct
2 Correct 22 ms 40212 KB Output is correct
3 Correct 22 ms 40148 KB Output is correct
4 Correct 22 ms 40240 KB Output is correct
5 Correct 22 ms 40220 KB Output is correct
6 Correct 22 ms 40224 KB Output is correct
7 Correct 22 ms 40212 KB Output is correct
8 Correct 22 ms 40148 KB Output is correct
9 Correct 21 ms 40220 KB Output is correct
10 Correct 22 ms 40276 KB Output is correct
11 Correct 22 ms 40180 KB Output is correct
12 Correct 23 ms 40224 KB Output is correct
13 Correct 22 ms 40152 KB Output is correct
14 Correct 22 ms 40148 KB Output is correct
15 Correct 23 ms 40256 KB Output is correct
16 Correct 22 ms 40148 KB Output is correct
17 Correct 22 ms 40148 KB Output is correct
18 Correct 22 ms 40220 KB Output is correct
19 Correct 22 ms 40148 KB Output is correct
20 Correct 22 ms 40228 KB Output is correct
21 Correct 23 ms 40288 KB Output is correct
22 Correct 22 ms 40192 KB Output is correct
23 Correct 22 ms 40288 KB Output is correct
24 Correct 22 ms 40248 KB Output is correct
25 Correct 21 ms 40236 KB Output is correct
26 Correct 26 ms 40244 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 40148 KB Output is correct
2 Correct 22 ms 40212 KB Output is correct
3 Correct 22 ms 40148 KB Output is correct
4 Correct 22 ms 40240 KB Output is correct
5 Correct 22 ms 40220 KB Output is correct
6 Correct 22 ms 40224 KB Output is correct
7 Correct 22 ms 40212 KB Output is correct
8 Correct 22 ms 40148 KB Output is correct
9 Correct 21 ms 40220 KB Output is correct
10 Correct 22 ms 40276 KB Output is correct
11 Correct 22 ms 40180 KB Output is correct
12 Correct 23 ms 40224 KB Output is correct
13 Correct 22 ms 40152 KB Output is correct
14 Correct 22 ms 40148 KB Output is correct
15 Correct 23 ms 40256 KB Output is correct
16 Correct 22 ms 40148 KB Output is correct
17 Correct 22 ms 40148 KB Output is correct
18 Correct 22 ms 40220 KB Output is correct
19 Correct 22 ms 40148 KB Output is correct
20 Correct 22 ms 40228 KB Output is correct
21 Correct 23 ms 40288 KB Output is correct
22 Correct 22 ms 40192 KB Output is correct
23 Correct 22 ms 40288 KB Output is correct
24 Correct 22 ms 40248 KB Output is correct
25 Correct 21 ms 40236 KB Output is correct
26 Correct 26 ms 40244 KB Output is correct
27 Correct 25 ms 41036 KB Output is correct
28 Correct 24 ms 40908 KB Output is correct
29 Correct 24 ms 40952 KB Output is correct
30 Correct 23 ms 40516 KB Output is correct
31 Correct 24 ms 40448 KB Output is correct
32 Correct 24 ms 40276 KB Output is correct
33 Correct 23 ms 40512 KB Output is correct
34 Correct 23 ms 40532 KB Output is correct
35 Correct 23 ms 40532 KB Output is correct
36 Correct 25 ms 40900 KB Output is correct
37 Correct 24 ms 40892 KB Output is correct
38 Correct 26 ms 41072 KB Output is correct
39 Correct 25 ms 41004 KB Output is correct
40 Correct 23 ms 40532 KB Output is correct
41 Correct 24 ms 40636 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 40148 KB Output is correct
2 Correct 22 ms 40212 KB Output is correct
3 Correct 22 ms 40148 KB Output is correct
4 Correct 22 ms 40240 KB Output is correct
5 Correct 22 ms 40220 KB Output is correct
6 Correct 22 ms 40224 KB Output is correct
7 Correct 22 ms 40212 KB Output is correct
8 Correct 22 ms 40148 KB Output is correct
9 Correct 21 ms 40220 KB Output is correct
10 Correct 635 ms 108304 KB Output is correct
11 Correct 433 ms 105460 KB Output is correct
12 Correct 135 ms 57804 KB Output is correct
13 Correct 774 ms 127292 KB Output is correct
14 Correct 233 ms 116588 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 40148 KB Output is correct
2 Correct 22 ms 40212 KB Output is correct
3 Correct 22 ms 40148 KB Output is correct
4 Correct 22 ms 40240 KB Output is correct
5 Correct 22 ms 40220 KB Output is correct
6 Correct 22 ms 40224 KB Output is correct
7 Correct 22 ms 40212 KB Output is correct
8 Correct 22 ms 40148 KB Output is correct
9 Correct 21 ms 40220 KB Output is correct
10 Correct 22 ms 40276 KB Output is correct
11 Correct 22 ms 40180 KB Output is correct
12 Correct 23 ms 40224 KB Output is correct
13 Correct 22 ms 40152 KB Output is correct
14 Correct 22 ms 40148 KB Output is correct
15 Correct 23 ms 40256 KB Output is correct
16 Correct 22 ms 40148 KB Output is correct
17 Correct 22 ms 40148 KB Output is correct
18 Correct 22 ms 40220 KB Output is correct
19 Correct 22 ms 40148 KB Output is correct
20 Correct 22 ms 40228 KB Output is correct
21 Correct 23 ms 40288 KB Output is correct
22 Correct 22 ms 40192 KB Output is correct
23 Correct 22 ms 40288 KB Output is correct
24 Correct 22 ms 40248 KB Output is correct
25 Correct 21 ms 40236 KB Output is correct
26 Correct 26 ms 40244 KB Output is correct
27 Correct 25 ms 41036 KB Output is correct
28 Correct 24 ms 40908 KB Output is correct
29 Correct 24 ms 40952 KB Output is correct
30 Correct 23 ms 40516 KB Output is correct
31 Correct 24 ms 40448 KB Output is correct
32 Correct 24 ms 40276 KB Output is correct
33 Correct 23 ms 40512 KB Output is correct
34 Correct 23 ms 40532 KB Output is correct
35 Correct 23 ms 40532 KB Output is correct
36 Correct 25 ms 40900 KB Output is correct
37 Correct 24 ms 40892 KB Output is correct
38 Correct 26 ms 41072 KB Output is correct
39 Correct 25 ms 41004 KB Output is correct
40 Correct 23 ms 40532 KB Output is correct
41 Correct 24 ms 40636 KB Output is correct
42 Correct 635 ms 108304 KB Output is correct
43 Correct 433 ms 105460 KB Output is correct
44 Correct 135 ms 57804 KB Output is correct
45 Correct 774 ms 127292 KB Output is correct
46 Correct 233 ms 116588 KB Output is correct
47 Correct 22 ms 40132 KB Output is correct
48 Correct 22 ms 40152 KB Output is correct
49 Correct 22 ms 40228 KB Output is correct
50 Correct 210 ms 97420 KB Output is correct
51 Correct 229 ms 119236 KB Output is correct
52 Correct 399 ms 115404 KB Output is correct
53 Correct 399 ms 115292 KB Output is correct
54 Correct 406 ms 115236 KB Output is correct
55 Correct 729 ms 117620 KB Output is correct
56 Correct 517 ms 149184 KB Output is correct
57 Correct 455 ms 145100 KB Output is correct
58 Correct 389 ms 108964 KB Output is correct
59 Correct 1297 ms 128176 KB Output is correct
60 Correct 548 ms 129228 KB Output is correct
61 Correct 1057 ms 146944 KB Output is correct
62 Correct 1141 ms 115000 KB Output is correct
63 Correct 333 ms 114684 KB Output is correct
64 Correct 25 ms 41552 KB Output is correct
65 Correct 27 ms 41496 KB Output is correct
66 Correct 1175 ms 115084 KB Output is correct
67 Correct 42 ms 47948 KB Output is correct
68 Correct 57 ms 52940 KB Output is correct
69 Correct 1103 ms 130052 KB Output is correct
70 Correct 93 ms 65828 KB Output is correct
71 Correct 226 ms 117336 KB Output is correct
72 Correct 1142 ms 130068 KB Output is correct
73 Correct 1142 ms 115444 KB Output is correct