Submission #939924

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
939924	2024-03-07T01:01:22 Z	beaboss	Keys (IOI21_keys)	C++17	100 / 100	655 ms	54124 KB

keys

// Source: https://oj.uz/problem/view/IOI21_candies
// 
#include "keys.h"
#include "bits/stdc++.h"

using namespace std;

#define s second
#define f first
#define pb push_back

typedef long long ll;

typedef pair<int, int> pii;
typedef vector<pii> vpii;

typedef vector<int> vi;

#define FOR(i, a, b) for (int i = (a); i<b; i++)

bool ckmin(int& a, int b){ return b < a ? a = b, true : false; }

bool ckmax(int& a, int b){ return b > a ? a = b, true : false; }

const int N = 3e5 + 10;
vpii adj[N];
bool fin[N], vis[N], have[N];
vi vislist, block[N];
vi e;
int here[N], res[N];

int mn = N;

void reset(){
	for (auto val: vislist) {
		have[here[val]]=false;
		vis[val]=false;
	}
	for (auto val: e) block[val].clear();
	vislist.clear();
	e.clear();
}

int bfs(int _) {
	queue<int> q;
	q.push(_);
	vis[_]=true;
	vislist.pb(_);
	int sz = 0;
	while (!q.empty() && sz <= mn) {
		sz++;
		int cur = q.front();
		q.pop();
		// cout << cur << ' ' << here[cur] << endl;
		int key = here[cur];
		for (auto val: block[key]) {
			if (!vis[val]) {
				if (fin[val]) return N; // 
				vislist.pb(val);
				vis[val]=true;
				q.push(val);
				// sz++;
			}
		}

		block[key].clear();

		have[key]=true;
		// cout << ' ' << key << endl;
		for (auto val: adj[cur]) {
			// cout << ' ' << cur << val.f << val.s << key << endl;
			if (vis[val.f]) continue;
			if (have[val.s]) {
				if (fin[val.f]) return N; // 
				vislist.pb(val.f);
				vis[val.f]=true;
				q.push(val.f);
				// sz++;
			} else {
				block[val.s].pb(val.f);
				e.pb(val.s);
			}

		}

	}

	if (sz > mn) return N;

	for (auto val: vislist) res[val] = min(res[val], sz);
		// cout << sz << endl;
	return sz;
}

vi find_reachable(vi c, vi l, vi r, vi v) {


	mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

	int n = c.size();
	FOR(i, 0, n) {
		here[i] = c[i];
		
		res[i] = N;
	}
	int m = l.size();

	FOR(i, 0, m) {
		adj[l[i]].pb({r[i], v[i]});
		adj[r[i]].pb({l[i], v[i]});
	}

	vi p(2*m);
	FOR(i, 0, m) {
		p[2*i]=l[i];
		p[2*i+1]=r[i];
	}
	// vi p(n);
	// FOR(i, 0, n) p[i]=i;
	shuffle(p.begin(), p.end(), rng);

	for (auto i: p) {
		
		if (!fin[i]) {
			int h = bfs(i);
			res[i] = min(res[i], h);
			// cout << i << h << endl;
			fin[i]=true;
			// cout << i << h << endl;
			mn = min(mn, res[i]);
			reset();
		}
	}

	FOR(i, 0, n) {
		
		if (!fin[i]) {
			int h = bfs(i);
			res[i] = min(res[i], h);
			// cout << i << h << endl;
			fin[i]=true;
			// cout << i << h << endl;
			mn = min(mn, res[i]);
			reset();
		}
	}

	vi ans(n, 0);
	FOR(i, 0, n) {
		if (res[i] == mn) {
			ans[i]=1;
		}
	}

	return ans;

}

// int main() {
// 	ios::sync_with_stdio(false);
// 	cin.tie(nullptr);

// 	vi h = find_reachable({0, 1, 1, 2}, {0, 0, 1, 1, 3}, {1, 2, 2, 3, 1}, {0, 0, 1, 0, 2});
// 	for (auto val: h) cout << val << endl;




// }

Subtask #1
9.0 / 9.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	17500 KB	Output is correct
2	Correct	5 ms	17500 KB	Output is correct
3	Correct	3 ms	17500 KB	Output is correct
4	Correct	4 ms	17500 KB	Output is correct
5	Correct	3 ms	17500 KB	Output is correct
6	Correct	4 ms	17500 KB	Output is correct
7	Correct	4 ms	17500 KB	Output is correct
8	Correct	5 ms	17500 KB	Output is correct
9	Correct	4 ms	17500 KB	Output is correct
10	Correct	4 ms	17500 KB	Output is correct
11	Correct	4 ms	17496 KB	Output is correct
12	Correct	4 ms	17500 KB	Output is correct
13	Correct	3 ms	17500 KB	Output is correct
14	Correct	4 ms	17500 KB	Output is correct
15	Correct	4 ms	17608 KB	Output is correct
16	Correct	4 ms	17584 KB	Output is correct
17	Correct	4 ms	17500 KB	Output is correct
18	Correct	4 ms	17500 KB	Output is correct
19	Correct	3 ms	17500 KB	Output is correct
20	Correct	4 ms	17500 KB	Output is correct
21	Correct	4 ms	17496 KB	Output is correct
22	Correct	5 ms	17500 KB	Output is correct
23	Correct	4 ms	17500 KB	Output is correct
24	Correct	4 ms	17500 KB	Output is correct
25	Correct	4 ms	17500 KB	Output is correct
26	Correct	5 ms	17500 KB	Output is correct
27	Correct	5 ms	17756 KB	Output is correct
28	Correct	5 ms	17752 KB	Output is correct
29	Correct	6 ms	17756 KB	Output is correct
30	Correct	4 ms	17500 KB	Output is correct
31	Correct	4 ms	17496 KB	Output is correct
32	Correct	4 ms	17500 KB	Output is correct
33	Correct	4 ms	17500 KB	Output is correct
34	Correct	4 ms	17500 KB	Output is correct
35	Correct	5 ms	17500 KB	Output is correct
36	Correct	5 ms	17752 KB	Output is correct
37	Correct	6 ms	17756 KB	Output is correct
38	Correct	5 ms	18008 KB	Output is correct
39	Correct	5 ms	17756 KB	Output is correct
40	Correct	5 ms	17500 KB	Output is correct
41	Correct	4 ms	17500 KB	Output is correct

Subtask #4
30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	17500 KB	Output is correct
2	Correct	5 ms	17500 KB	Output is correct
3	Correct	3 ms	17500 KB	Output is correct
4	Correct	4 ms	17500 KB	Output is correct
5	Correct	3 ms	17500 KB	Output is correct
6	Correct	4 ms	17500 KB	Output is correct
7	Correct	4 ms	17500 KB	Output is correct
8	Correct	5 ms	17500 KB	Output is correct
9	Correct	4 ms	17500 KB	Output is correct
10	Correct	137 ms	36864 KB	Output is correct
11	Correct	196 ms	47292 KB	Output is correct
12	Correct	35 ms	22352 KB	Output is correct
13	Correct	193 ms	38992 KB	Output is correct
14	Correct	213 ms	41156 KB	Output is correct

Subtask #5
33.0 / 33.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	17500 KB	Output is correct
2	Correct	5 ms	17500 KB	Output is correct
3	Correct	3 ms	17500 KB	Output is correct
4	Correct	4 ms	17500 KB	Output is correct
5	Correct	3 ms	17500 KB	Output is correct
6	Correct	4 ms	17500 KB	Output is correct
7	Correct	4 ms	17500 KB	Output is correct
8	Correct	5 ms	17500 KB	Output is correct
9	Correct	4 ms	17500 KB	Output is correct
10	Correct	4 ms	17500 KB	Output is correct
11	Correct	4 ms	17496 KB	Output is correct
12	Correct	4 ms	17500 KB	Output is correct
13	Correct	3 ms	17500 KB	Output is correct
14	Correct	4 ms	17500 KB	Output is correct
15	Correct	4 ms	17608 KB	Output is correct
16	Correct	4 ms	17584 KB	Output is correct
17	Correct	4 ms	17500 KB	Output is correct
18	Correct	4 ms	17500 KB	Output is correct
19	Correct	3 ms	17500 KB	Output is correct
20	Correct	4 ms	17500 KB	Output is correct
21	Correct	4 ms	17496 KB	Output is correct
22	Correct	5 ms	17500 KB	Output is correct
23	Correct	4 ms	17500 KB	Output is correct
24	Correct	4 ms	17500 KB	Output is correct
25	Correct	4 ms	17500 KB	Output is correct
26	Correct	5 ms	17500 KB	Output is correct
27	Correct	5 ms	17756 KB	Output is correct
28	Correct	5 ms	17752 KB	Output is correct
29	Correct	6 ms	17756 KB	Output is correct
30	Correct	4 ms	17500 KB	Output is correct
31	Correct	4 ms	17496 KB	Output is correct
32	Correct	4 ms	17500 KB	Output is correct
33	Correct	4 ms	17500 KB	Output is correct
34	Correct	4 ms	17500 KB	Output is correct
35	Correct	5 ms	17500 KB	Output is correct
36	Correct	5 ms	17752 KB	Output is correct
37	Correct	6 ms	17756 KB	Output is correct
38	Correct	5 ms	18008 KB	Output is correct
39	Correct	5 ms	17756 KB	Output is correct
40	Correct	5 ms	17500 KB	Output is correct
41	Correct	4 ms	17500 KB	Output is correct
42	Correct	137 ms	36864 KB	Output is correct
43	Correct	196 ms	47292 KB	Output is correct
44	Correct	35 ms	22352 KB	Output is correct
45	Correct	193 ms	38992 KB	Output is correct
46	Correct	213 ms	41156 KB	Output is correct
47	Correct	3 ms	17500 KB	Output is correct
48	Correct	4 ms	17500 KB	Output is correct
49	Correct	4 ms	17500 KB	Output is correct
50	Correct	201 ms	43112 KB	Output is correct
51	Correct	226 ms	42692 KB	Output is correct
52	Correct	188 ms	40268 KB	Output is correct
53	Correct	189 ms	40336 KB	Output is correct
54	Correct	220 ms	41340 KB	Output is correct
55	Correct	151 ms	38252 KB	Output is correct
56	Correct	262 ms	44796 KB	Output is correct
57	Correct	233 ms	44552 KB	Output is correct
58	Correct	248 ms	54124 KB	Output is correct
59	Correct	640 ms	53412 KB	Output is correct
60	Correct	590 ms	51528 KB	Output is correct
61	Correct	655 ms	51884 KB	Output is correct
62	Correct	398 ms	47420 KB	Output is correct
63	Correct	190 ms	46908 KB	Output is correct
64	Correct	7 ms	18008 KB	Output is correct
65	Correct	7 ms	18012 KB	Output is correct
66	Correct	384 ms	47452 KB	Output is correct
67	Correct	20 ms	20560 KB	Output is correct
68	Correct	33 ms	22488 KB	Output is correct
69	Correct	608 ms	53616 KB	Output is correct
70	Correct	61 ms	27344 KB	Output is correct
71	Correct	222 ms	47252 KB	Output is correct
72	Correct	558 ms	53300 KB	Output is correct
73	Correct	423 ms	47444 KB	Output is correct

Submission #939924

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 11.0 / 11.0

Subtask #3 17.0 / 17.0

Subtask #4 30.0 / 30.0

Subtask #5 33.0 / 33.0

Subtask #1
9.0 / 9.0

Subtask #2
11.0 / 11.0

Subtask #3
17.0 / 17.0

Subtask #4
30.0 / 30.0

Subtask #5
33.0 / 33.0