oj.uz

Submission #598609

# Submission time Handle Problem Language Result Execution time Memory
598609 2022-07-18T14:58:48 Z definitelynotmee Keys (IOI21_keys) C++17
67 / 100
 1551 ms 51508 KB 
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template<typename t>
using matrix = vector<vector<t>>;


std::vector<int> find_reachable(std::vector<int> r, std::vector<int> u, std::vector<int> v, std::vector<int> c) {
	vector<int> ans(r.size(), 1);
	int n = r.size();

	matrix<pii> g(n);
	for(int i = 0; i < u.size(); i++){
		g[u[i]].push_back({v[i],c[i]});
		g[v[i]].push_back({u[i],c[i]});
	}
	if(n <= 2000){
		for(int root = 0; root < n; root++){
			vector<int> check(n), got(n);
			matrix<int> whenget(n);

			vector<int> st = {root};

			while(!st.empty()){
				int cur = st.back();
				st.pop_back();
				if(check[cur])
					continue;
				check[cur] = 1;
				got[r[cur]] = 1;
				while(!whenget[r[cur]].empty()){
					st.push_back(whenget[r[cur]].back());
					whenget[r[cur]].pop_back();
				}
				for(pii i : g[cur]){
					if(got[i.ss])
						st.push_back(i.ff);
					else whenget[i.ss].push_back(i.ff);
				}
			}
			ans[root] = accumulate(all(check),0);
		}

		int mini = *min_element(all(ans));
		for(int i = 0; i < n; i++)
			ans[i] = ans[i] == mini;
	} else {
		vector<int> color(n);
		for(int i = 0; i < n; i++)
			color[i] = 1<<r[i];

		int it = 30;
		vector<int> scc(n);
		int timer = -1;

		while(it--){
			fill(all(scc),0);

			vector<int> check(n), combcolor(n);
			vector<int> out;
			auto dfs =[&](int id, auto dfs)->void{
				check[id] = 1;
				for(pii i : g[id]){
					if(((1<<i.ss)&color[id])&&!check[i.ff])
						dfs(i.ff,dfs);
				}
				out.push_back(id);
			};

			for(int i = 0; i < n; i++){
				if(!check[i])
					dfs(i,dfs);
			}
			timer = -1;
			auto rdfs =[&](int id, auto dfs)->void{
				check[id] = 2;
				scc[id] = timer;
				combcolor[scc[id]]|=color[id];

				for(pii i : g[id]){
					if(((1<<i.ss)&color[i.ff])&&check[i.ff]!=2)
						dfs(i.ff,dfs);
				}
			};
			reverse(all(out));

			for(int i = 0; i < n; i++){
				if(check[out[i]]!=2)
					timer++,rdfs(out[i],rdfs);
			}
			for(int i = 0; i < n; i++){
				color[i] = combcolor[scc[i]];
			}
			// for(int i : scc)
			// 	cout << i << ' ';
			// cout << '\n';
		}
		vector<int> isvalid(n,1), sz(n,0);
		for(int v = 0; v < n; v++){
			for(pii i : g[v]){
				if(((1<<i.ss)&color[v])&&scc[i.ff]!=scc[v])
					isvalid[scc[v]] = 0;
			}
			sz[scc[v]]++;
		}
		int mini = 1<<30;

		for(int i = 0; i <= timer; i++){
			if(isvalid[i]) mini = min(mini,sz[i]);
			//cout << sz[i] << ' ' << isvalid[i] << '\n';
		}
		for(int i = 0; i < n; i++){
			ans[i] = sz[scc[i]] == mini && isvalid[scc[i]];
		}
	}


	return ans;
}

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:18:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |  for(int i = 0; i < u.size(); i++){
      |                 ~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 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 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 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 2 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 2 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 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 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 2 ms 212 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 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 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 2 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 2 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 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 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 2 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 75 ms 596 KB Output is correct
28 Correct 75 ms 568 KB Output is correct
29 Correct 77 ms 468 KB Output is correct
30 Correct 58 ms 428 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 408 KB Output is correct
34 Correct 23 ms 420 KB Output is correct
35 Correct 26 ms 340 KB Output is correct
36 Correct 101 ms 468 KB Output is correct
37 Correct 92 ms 468 KB Output is correct
38 Correct 138 ms 532 KB Output is correct
39 Correct 130 ms 516 KB Output is correct
40 Correct 9 ms 340 KB Output is correct
41 Correct 38 ms 468 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 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 963 ms 24184 KB Output is correct
11 Correct 929 ms 37528 KB Output is correct
12 Correct 186 ms 6972 KB Output is correct
13 Correct 1551 ms 33288 KB Output is correct
14 Correct 658 ms 51508 KB Output is correct

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 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 2 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 2 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 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 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 2 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 75 ms 596 KB Output is correct
28 Correct 75 ms 568 KB Output is correct
29 Correct 77 ms 468 KB Output is correct
30 Correct 58 ms 428 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 408 KB Output is correct
34 Correct 23 ms 420 KB Output is correct
35 Correct 26 ms 340 KB Output is correct
36 Correct 101 ms 468 KB Output is correct
37 Correct 92 ms 468 KB Output is correct
38 Correct 138 ms 532 KB Output is correct
39 Correct 130 ms 516 KB Output is correct
40 Correct 9 ms 340 KB Output is correct
41 Correct 38 ms 468 KB Output is correct
42 Correct 963 ms 24184 KB Output is correct
43 Correct 929 ms 37528 KB Output is correct
44 Correct 186 ms 6972 KB Output is correct
45 Correct 1551 ms 33288 KB Output is correct
46 Correct 658 ms 51508 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 499 ms 48884 KB Output is correct
51 Correct 548 ms 51428 KB Output is correct
52 Incorrect 893 ms 30828 KB Output isn't correct
53 Halted 0 ms 0 KB -