oj.uz

Submission #832907

# Submission time Handle Problem Language Result Execution time Memory
832907 2023-08-21T16:31:46 Z amunduzbaev Keys (IOI21_keys) C++17
67 / 100
 1248 ms 70684 KB 
#include "bits/stdc++.h"
using namespace std;

#define ar array
typedef long long ll;
//~ #define int ll

vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) {
	int n = r.size();
	int m = u.size();
	
	vector<vector<ar<int, 2>>> edges(n);
	for(int i=0;i<m;i++){
		edges[u[i]].push_back({v[i], c[i]});
		edges[v[i]].push_back({u[i], c[i]});
	}
	
	int res = n + 1;
	vector<int> mask(n);
	vector<int> ans;
	
	if(n <= 2000 && m <= 2000){
		vector<int> used(n), cviz(n);
		vector<vector<int>> q;
		int cnt = 0;
		
		for(int i=0;i<n;i++){
			fill(used.begin(), used.end(), 0);
			fill(cviz.begin(), cviz.end(), 0);
			q.assign(n, vector<int>());
			cnt = 0;
			
			queue<int> qq;
			qq.push(i);
			
			while(!qq.empty()){
				cnt++;
				int u = qq.front(); qq.pop();
				
				used[u] = 1;
				if(!cviz[r[u]]){
					cviz[r[u]] = 1;
					for(auto x : q[r[u]]){
						if(!used[x]){
							used[x] = 1;
							qq.push(x);
						}
					}
				}
				
				for(auto [x, c] : edges[u]){
					if(used[x]) continue;
					if(cviz[c]){
						used[x] = 1;
						qq.push(x);
					} else {
						//~ assert(false);
						q[c].push_back(x);
					}
				}
			}
			
			if(res > cnt) res = cnt, ans.clear();
			if(res == cnt) ans.push_back(i);
		}
		
		fill(used.begin(), used.end(), 0);
		for(auto x : ans) used[x] = 1;
		
		return used;
	}
	
	for(int i=0;i<n;i++){
		mask[i] |= (1 << r[i]);
	}
	
	vector<int> tin(n), fup(n), cmp(n), ss;
	for(int T=0;T<30;T++){
		int t = 0;
		fill(cmp.begin(), cmp.end(), 0);
		fill(tin.begin(), tin.end(), 0);
		fill(fup.begin(), fup.end(), 0);
		ss.clear();
		
		function<void(int)> dfs = [&](int u){
			tin[u] = fup[u] = ++t;
			ss.push_back(u);
			
			for(auto [x, c] : edges[u]){
				if(!(mask[u] >> c & 1)) continue;
				if(!tin[x]) {
					dfs(x);
					fup[u] = min(fup[u], fup[x]);
				} else if(!cmp[x]){
					fup[u] = min(fup[u], tin[x]);
				}
			}
			
			if(tin[u] == fup[u]){
				vector<int> tmp;
				int x, tot = 0;
				do{
					x = ss.back(); ss.pop_back();
					tmp.push_back(x);
					tot |= mask[x];
				}while(x != u);
				
				for(auto x : tmp){
					//~ cout<<x<<" ";
					cmp[x] = 1;
					mask[x] = tot;
				}
				
				//~ cout<<"\n";
			}
		};
		
		for(int i=0;i<n;i++){
			if(cmp[i]) continue;
			dfs(i);
		}
		//~ cout<<"\n";
	}
	//~ for(int i=0;i<n;i++){
		//~ for(int j=0;j<n;j++) cout<<(mask[i] >> j & 1);
		//~ cout<<"\n";
	//~ }
	
	int t = 0, last = 0;
	ss.clear();
	fill(cmp.begin(), cmp.end(), 0);
	fill(tin.begin(), tin.end(), 0);
	fill(fup.begin(), fup.end(), 0);
	function<void(int)> dfs = [&](int u){
		tin[u] = fup[u] = ++t;
		ss.push_back(u);
		
		for(auto [x, c] : edges[u]){
			if(!(mask[u] >> c & 1)) continue;
			if(!tin[x]) {
				dfs(x);
				fup[u] = min(fup[u], fup[x]);
			} else if(!cmp[x]){
				fup[u] = min(fup[u], tin[x]);
			}
		}
		
		if(tin[u] == fup[u]){
			last++;
			int x;
			do{
				x = ss.back(); ss.pop_back();
				cmp[x] = last;
				
				//~ cout<<x<<" ";
			}while(x != u);
			//~ cout<<"\n";
		}
	};
	
	vector<vector<int>> g(n + 1);
	for(int i=0;i<n;i++){
		if(cmp[i]) continue;
		dfs(i);
	}
	
	vector<int> sz(n + 1);
	for(int i=0;i<n;i++){
		sz[cmp[i]]++;
		for(auto [x, c] : edges[i]){
			if((mask[i] >> c & 1) && cmp[i] != cmp[x]){
				g[cmp[i]].push_back(cmp[x]);
			}
		}
	}
	
	vector<int> viz(n + 1), used(n);
	
	for(int i=1;i<=last;i++){
		if(g[i].empty()){
			if(res > sz[i]) res = sz[i], ans.clear();
			if(res == sz[i]) ans.push_back(i);
		}
	}
	
	for(auto x : ans){
		viz[x] = 1;
	}
	
	for(int i=0;i<n;i++){
		if(viz[cmp[i]]) used[i] = 1;
	}
	
	return used;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 296 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 33 ms 640 KB Output is correct
28 Correct 30 ms 624 KB Output is correct
29 Correct 31 ms 628 KB Output is correct
30 Correct 20 ms 440 KB Output is correct
31 Correct 4 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 3 ms 340 KB Output is correct
34 Correct 13 ms 340 KB Output is correct
35 Correct 16 ms 428 KB Output is correct
36 Correct 67 ms 560 KB Output is correct
37 Correct 55 ms 548 KB Output is correct
38 Correct 76 ms 596 KB Output is correct
39 Correct 65 ms 584 KB Output is correct
40 Correct 7 ms 452 KB Output is correct
41 Correct 27 ms 468 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 709 ms 29792 KB Output is correct
11 Correct 987 ms 47608 KB Output is correct
12 Correct 161 ms 7988 KB Output is correct
13 Correct 1248 ms 39064 KB Output is correct
14 Correct 497 ms 70684 KB Output is correct

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 296 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 33 ms 640 KB Output is correct
28 Correct 30 ms 624 KB Output is correct
29 Correct 31 ms 628 KB Output is correct
30 Correct 20 ms 440 KB Output is correct
31 Correct 4 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 3 ms 340 KB Output is correct
34 Correct 13 ms 340 KB Output is correct
35 Correct 16 ms 428 KB Output is correct
36 Correct 67 ms 560 KB Output is correct
37 Correct 55 ms 548 KB Output is correct
38 Correct 76 ms 596 KB Output is correct
39 Correct 65 ms 584 KB Output is correct
40 Correct 7 ms 452 KB Output is correct
41 Correct 27 ms 468 KB Output is correct
42 Correct 709 ms 29792 KB Output is correct
43 Correct 987 ms 47608 KB Output is correct
44 Correct 161 ms 7988 KB Output is correct
45 Correct 1248 ms 39064 KB Output is correct
46 Correct 497 ms 70684 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 385 ms 62260 KB Output is correct
51 Correct 409 ms 64844 KB Output is correct
52 Incorrect 934 ms 38164 KB Output isn't correct
53 Halted 0 ms 0 KB -