oj.uz

Submission #434998

# Submission time Handle Problem Language Result Execution time Memory
434998 2021-06-22T18:41:33 Z grt Keys (IOI21_keys) C++17
20 / 100
 1520 ms 123792 KB 
#include <bits/stdc++.h>
#define ST first
#define ND second
#define PB push_back

using namespace std;
using ll = long long;
using pi = pair<int,int>;
using vi = vector<int>;

const int nax = 300 * 1000 + 10, INF = 1e9;
int n, m, nr;
map<int, vi>V[nax];
bool vis[2 * nax];
vi seen;
vi G[2 * nax];
vi Grev[2 * nax];
int topo[2 * nax];
int SCC[2 * nax];
bool ok[2 * nax];
int color;
int cnt[2 * nax];

void dfs(int x, int col) {
	vis[x] = true;
	seen.PB(x);
	for(auto ed : V[col][x]) if(!vis[ed]) {
		dfs(ed, col);
	}
}

void dfs2(int x) {
	vis[x] = true;
	for(int nbh : G[x]) {
		if(!vis[nbh]) {
			dfs2(nbh);
		}
	}
	topo[nr++] = x;
}

void dfs3(int x) {
	vis[x] = true;
	SCC[x] = color;
	if(x < n) cnt[color]++;
	for(int nbh : Grev[x]) if(!vis[nbh]) {
		dfs3(nbh);
	}
}

vi find_reachable(vi r, vi u, vi v, vi c) {
	n = (int)r.size();
	m = (int)u.size();
	for(int i = 0; i < m; ++i) {
		V[c[i]][u[i]].PB(v[i]);
		V[c[i]][v[i]].PB(u[i]);
	}
	int ver = n-1;
	for(int i = 0; i < n; ++i) {
		for(auto it : V[i]) {
			if(!vis[it.ST]) {
				seen.clear();
				dfs(it.ST, i);
				ver++;
				for(auto x : seen) {
					G[ver].PB(x);
					Grev[x].PB(ver);
					if(r[x] == i) {
						G[x].PB(ver);
						Grev[ver].PB(x);
					}
				}
			}
		}
		for(auto it : V[i]) vis[it.ST] = false;
	}
	for(int i = 0; i <= ver; ++i) {
		if(!vis[i]) {
			dfs2(i);
		}
	}
	for(int i = 0; i <= ver; ++i) {
		vis[i] = false;
	}
	for(int i = ver; i >= 0; --i) {
		if(!vis[topo[i]]) {
			color++;
			dfs3(topo[i]);
		}
	}
	for(int i = 0; i <= ver; ++i) ok[i] = false;
	for(int i = 0; i < n; ++i) ok[SCC[i]] = true;
	for(int i = 0; i <= ver; ++i) {
		//cout << SCC[i] << " ";
		for(int nbh : G[i]) {
			if(SCC[nbh] != SCC[i]) {
				ok[SCC[i]] = false;
			}
		}
	}
	//cout << "\n";
	int mi = INF;
	for(int i = 1; i <= color; ++i) {
		//cout << cnt[i] << " ";
		if(!ok[i]) continue;
		mi = min(mi, cnt[i]);
	}
	//cout << "\n";
	vector<int>ans(n);
	for(int i = 0; i < n; ++i) {
		if(ok[SCC[i]] && cnt[SCC[i]] == mi) {
			ans[i] = true;
		} else {
			ans[i] = false;
		}
	}
	return ans;
}

//int main() {
	//ios_base::sync_with_stdio(0);
	//cin.tie(0);
	//int N, M;
	//cin >> N >> M;
	//vi r(N), u(M), v(M), c(M);
	//for(int i = 0; i < N; ++i) {
		//cin >> r[i];
	//}
	//for(int i = 0; i < M; ++i) {
		//cin >> u[i] >> v[i] >> c[i];
	//}
	//vi w = find_reachable(r,u,v,c);
	//vi w = find_reachable({0, 1, 1, 2},{0, 0, 1, 1, 3}, {1, 2, 2, 3, 1}, {0, 0, 1, 0, 2});
	//vi w = find_reachable({0, 1, 1, 2, 2, 1, 2},{0, 0, 1, 1, 2, 3, 3, 4, 4, 5},
//{1, 2, 2, 3, 3, 4, 5, 5, 6, 6},
//{0, 0, 1, 0, 0, 1, 2, 0, 2, 1});
	//vi w = find_reachable({0, 0, 0}, {0}, {1}, {0});
	//for(int x : w) {
		//cout << x << " ";
	//}
//}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 42572 KB Output is correct
2 Correct 31 ms 42572 KB Output is correct
3 Correct 31 ms 42596 KB Output is correct
4 Correct 31 ms 42544 KB Output is correct
5 Correct 30 ms 42560 KB Output is correct
6 Correct 35 ms 42576 KB Output is correct
7 Correct 29 ms 42572 KB Output is correct
8 Correct 29 ms 42568 KB Output is correct
9 Correct 34 ms 42564 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 42572 KB Output is correct
2 Correct 31 ms 42572 KB Output is correct
3 Correct 31 ms 42596 KB Output is correct
4 Correct 31 ms 42544 KB Output is correct
5 Correct 30 ms 42560 KB Output is correct
6 Correct 35 ms 42576 KB Output is correct
7 Correct 29 ms 42572 KB Output is correct
8 Correct 29 ms 42568 KB Output is correct
9 Correct 34 ms 42564 KB Output is correct
10 Correct 33 ms 42560 KB Output is correct
11 Correct 32 ms 42572 KB Output is correct
12 Correct 32 ms 42668 KB Output is correct
13 Correct 31 ms 42548 KB Output is correct
14 Correct 30 ms 42604 KB Output is correct
15 Correct 32 ms 42600 KB Output is correct
16 Correct 34 ms 42572 KB Output is correct
17 Correct 29 ms 42604 KB Output is correct
18 Correct 31 ms 42528 KB Output is correct
19 Correct 31 ms 42564 KB Output is correct
20 Correct 29 ms 42604 KB Output is correct
21 Correct 32 ms 42572 KB Output is correct
22 Correct 30 ms 42604 KB Output is correct
23 Correct 30 ms 42588 KB Output is correct
24 Correct 32 ms 42640 KB Output is correct
25 Correct 33 ms 42700 KB Output is correct
26 Correct 35 ms 42624 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 42572 KB Output is correct
2 Correct 31 ms 42572 KB Output is correct
3 Correct 31 ms 42596 KB Output is correct
4 Correct 31 ms 42544 KB Output is correct
5 Correct 30 ms 42560 KB Output is correct
6 Correct 35 ms 42576 KB Output is correct
7 Correct 29 ms 42572 KB Output is correct
8 Correct 29 ms 42568 KB Output is correct
9 Correct 34 ms 42564 KB Output is correct
10 Correct 33 ms 42560 KB Output is correct
11 Correct 32 ms 42572 KB Output is correct
12 Correct 32 ms 42668 KB Output is correct
13 Correct 31 ms 42548 KB Output is correct
14 Correct 30 ms 42604 KB Output is correct
15 Correct 32 ms 42600 KB Output is correct
16 Correct 34 ms 42572 KB Output is correct
17 Correct 29 ms 42604 KB Output is correct
18 Correct 31 ms 42528 KB Output is correct
19 Correct 31 ms 42564 KB Output is correct
20 Correct 29 ms 42604 KB Output is correct
21 Correct 32 ms 42572 KB Output is correct
22 Correct 30 ms 42604 KB Output is correct
23 Correct 30 ms 42588 KB Output is correct
24 Correct 32 ms 42640 KB Output is correct
25 Correct 33 ms 42700 KB Output is correct
26 Correct 35 ms 42624 KB Output is correct
27 Correct 34 ms 43340 KB Output is correct
28 Correct 35 ms 43348 KB Output is correct
29 Correct 39 ms 43212 KB Output is correct
30 Correct 31 ms 43004 KB Output is correct
31 Correct 31 ms 42796 KB Output is correct
32 Incorrect 30 ms 42640 KB Output isn't correct
33 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 42572 KB Output is correct
2 Correct 31 ms 42572 KB Output is correct
3 Correct 31 ms 42596 KB Output is correct
4 Correct 31 ms 42544 KB Output is correct
5 Correct 30 ms 42560 KB Output is correct
6 Correct 35 ms 42576 KB Output is correct
7 Correct 29 ms 42572 KB Output is correct
8 Correct 29 ms 42568 KB Output is correct
9 Correct 34 ms 42564 KB Output is correct
10 Correct 1520 ms 123792 KB Output is correct
11 Incorrect 1172 ms 111648 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 42572 KB Output is correct
2 Correct 31 ms 42572 KB Output is correct
3 Correct 31 ms 42596 KB Output is correct
4 Correct 31 ms 42544 KB Output is correct
5 Correct 30 ms 42560 KB Output is correct
6 Correct 35 ms 42576 KB Output is correct
7 Correct 29 ms 42572 KB Output is correct
8 Correct 29 ms 42568 KB Output is correct
9 Correct 34 ms 42564 KB Output is correct
10 Correct 33 ms 42560 KB Output is correct
11 Correct 32 ms 42572 KB Output is correct
12 Correct 32 ms 42668 KB Output is correct
13 Correct 31 ms 42548 KB Output is correct
14 Correct 30 ms 42604 KB Output is correct
15 Correct 32 ms 42600 KB Output is correct
16 Correct 34 ms 42572 KB Output is correct
17 Correct 29 ms 42604 KB Output is correct
18 Correct 31 ms 42528 KB Output is correct
19 Correct 31 ms 42564 KB Output is correct
20 Correct 29 ms 42604 KB Output is correct
21 Correct 32 ms 42572 KB Output is correct
22 Correct 30 ms 42604 KB Output is correct
23 Correct 30 ms 42588 KB Output is correct
24 Correct 32 ms 42640 KB Output is correct
25 Correct 33 ms 42700 KB Output is correct
26 Correct 35 ms 42624 KB Output is correct
27 Correct 34 ms 43340 KB Output is correct
28 Correct 35 ms 43348 KB Output is correct
29 Correct 39 ms 43212 KB Output is correct
30 Correct 31 ms 43004 KB Output is correct
31 Correct 31 ms 42796 KB Output is correct
32 Incorrect 30 ms 42640 KB Output isn't correct
33 Halted 0 ms 0 KB -