oj.uz

Submission #596767

# Submission time Handle Problem Language Result Execution time Memory
596767 2022-07-15T03:38:03 Z balbit Keys (IOI21_keys) C++17
100 / 100
 1662 ms 175184 KB 
#include <vector>
#include <bits/stdc++.h>
#ifndef BALBIT
#include "keys.h"
#endif
using namespace std;
 
#define ll long long
#define pii pair<int, int>
#define f first
#define s second
 
#define REP(i,n) for (int i = 0; i<n; ++i)
#define REP1(i,n) for (int i = 1; i<=n; ++i)
 
#define MX(a,b) a = max(a,b)
#define MN(a,b) a = min(a,b)
#define pb push_back
#define SZ(x) (int)(x).size()
#define ALL(x) (x).begin(), (x).end()
 
#ifdef BALBIT
#define bug(...) cerr<<"#"<<__LINE__<<": "<<#__VA_ARGS__<<"- ", _do(__VA_ARGS__)
template<typename T> void _do(T && x) {cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T && x, S && ...y) {cerr<<x<<", "; _do(y...);}
#else
#define bug(...)
#endif // BALBIT


const int maxn = 3e5+5;
int /*head[maxn], */par[maxn];
// int szedges[maxn]; // size of number of edges left

map<int, vector<int> > E[maxn]; // edges not done being worked
set<int> todo[maxn];
set<int> owned[maxn]; // todo is a subset of owned
vector<int> nhere[maxn]; // nodes in this set

int find(int x){return x == par[x]? x : par[x] = find(par[x]);}
inline int WHO(int x){return find(x);}

int dead[maxn]; // 1: this head is dead, 2: this head touches a dead, so it's super dead

int getone(int v) {
	while (!todo[v].empty()) {
		int c = *todo[v].begin();
		if (!E[v].count(c)) {
			todo[v].erase(c); continue;
		}
		// bug(v,c,SZ(E[v][c]));
		while (SZ(E[v][c])) {
			int go = WHO(E[v][c].back());
			E[v][c].pop_back();
			if (dead[go]) {
				bug(v, go, "dead!");
				return -2;
			}
			if (go != v) bug(v,go);
			if (go!=v) return go;
		}
		E[v].erase(c); todo[v].erase(c);
	}
	return -1;
}

void mrg(int a, int b, int newhead) {
	if (SZ(nhere[a]) < SZ(nhere[b])) swap(a,b);
	// a is the greater one
	for (int x : owned[b]) {
		if (owned[a].insert(x).s) {
			if (E[a].count(x)) {
				todo[a].insert(x);
			}
		}
	}
	for (auto &p : E[b]) {
		if (owned[a].count(p.f)) todo[a].insert(p.f); // consider merging todo later (?)
		E[a][p.f].insert(E[a][p.f].end(), ALL(p.s));
	}
	nhere[a].insert(nhere[a].end(), ALL(nhere[b]));

	map<int, vector<int> >().swap(E[b]);
	set<int>().swap(owned[b]);
	set<int>().swap(todo[b]);
	vector<int>().swap(nhere[b]);

	if (newhead != a) {
		assert(newhead == b);
		E[a].swap(E[b]);
		owned[a].swap(owned[b]);
		todo[a].swap(todo[b]);
		nhere[a].swap(nhere[b]);
		par[a] = b;
	}else{
		par[b] = a;
	}
}

vector<int> stk;
bool instk[maxn];

void runstack(){
	while (!stk.empty()) {
		int v = stk.back();
		int to = getone(v);
		assert(to != v);
		if (to == -1) {
			dead[v] = 1;
			instk[v] = 0;
			stk.pop_back();
			to = -2;
		}
		if (to == -2) {
			for (int e : stk) {
				dead[e] = 2; 
				instk[e] = 0;
			}
			stk.clear();
			return;
		}
		if (!instk[to]) {
			instk[to] = 1;
			stk.pb(to);
			continue;
		}else{
			while (stk.back() != to) {
				int last = stk.back(); instk[last] = 0; stk.pop_back();
				int pl = stk.back();
				mrg(last, pl, pl);
			}

		}
	}

}

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

	REP(i,m) {
		int U = u[i], V = v[i], C = c[i];
		REP(barbar, 2) {
			E[U][C].pb(V);
			swap(U,V);
		}
	}

	REP(i,n) {
		par[i] = i;
		nhere[i].pb(i);
		owned[i].insert(r[i]);
		if (E[i].count(r[i])) {
			todo[i].insert(r[i]);
			bug(i, "todo", r[i]);
		}
	}


	REP(i,n) {
		if (!dead[i]) {
			instk[i] = 1;
			stk.pb(i);
			runstack();
		}
	}

	vector<int> raw(n, n+1);

	REP(i,n) {
		int FI = find(i);
		bug(i, dead[i], FI);
		if (FI == i && dead[i] != 2) {
			for (int e : nhere[i]) {
				raw[e] = SZ(nhere[i]);
			}
		}
	}

	REP(i,n) {
		bug(i, raw[i]);
	}

	int mne = *min_element(ALL(raw));
	for (int &e : raw) {
		e = (e==mne?1:0);
	}

	return raw;
}


#ifdef BALBIT
signed main(){
// 	vector<int> yay = 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});
	vector<int> yay = find_reachable({0, 0, 0}, {0}, {1}, {0});
	for (int t : yay) bug(t);
}
#endif

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 49612 KB Output is correct
2 Correct 25 ms 49544 KB Output is correct
3 Correct 22 ms 49576 KB Output is correct
4 Correct 22 ms 49584 KB Output is correct
5 Correct 27 ms 49620 KB Output is correct
6 Correct 23 ms 49632 KB Output is correct
7 Correct 23 ms 49636 KB Output is correct
8 Correct 24 ms 49624 KB Output is correct
9 Correct 24 ms 49620 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 49612 KB Output is correct
2 Correct 25 ms 49544 KB Output is correct
3 Correct 22 ms 49576 KB Output is correct
4 Correct 22 ms 49584 KB Output is correct
5 Correct 27 ms 49620 KB Output is correct
6 Correct 23 ms 49632 KB Output is correct
7 Correct 23 ms 49636 KB Output is correct
8 Correct 24 ms 49624 KB Output is correct
9 Correct 24 ms 49620 KB Output is correct
10 Correct 23 ms 49624 KB Output is correct
11 Correct 24 ms 49712 KB Output is correct
12 Correct 25 ms 49632 KB Output is correct
13 Correct 23 ms 49620 KB Output is correct
14 Correct 23 ms 49544 KB Output is correct
15 Correct 23 ms 49624 KB Output is correct
16 Correct 23 ms 49620 KB Output is correct
17 Correct 23 ms 49548 KB Output is correct
18 Correct 24 ms 49632 KB Output is correct
19 Correct 23 ms 49600 KB Output is correct
20 Correct 22 ms 49620 KB Output is correct
21 Correct 22 ms 49624 KB Output is correct
22 Correct 24 ms 49540 KB Output is correct
23 Correct 24 ms 49632 KB Output is correct
24 Correct 22 ms 49652 KB Output is correct
25 Correct 23 ms 49664 KB Output is correct
26 Correct 23 ms 49604 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 49612 KB Output is correct
2 Correct 25 ms 49544 KB Output is correct
3 Correct 22 ms 49576 KB Output is correct
4 Correct 22 ms 49584 KB Output is correct
5 Correct 27 ms 49620 KB Output is correct
6 Correct 23 ms 49632 KB Output is correct
7 Correct 23 ms 49636 KB Output is correct
8 Correct 24 ms 49624 KB Output is correct
9 Correct 24 ms 49620 KB Output is correct
10 Correct 23 ms 49624 KB Output is correct
11 Correct 24 ms 49712 KB Output is correct
12 Correct 25 ms 49632 KB Output is correct
13 Correct 23 ms 49620 KB Output is correct
14 Correct 23 ms 49544 KB Output is correct
15 Correct 23 ms 49624 KB Output is correct
16 Correct 23 ms 49620 KB Output is correct
17 Correct 23 ms 49548 KB Output is correct
18 Correct 24 ms 49632 KB Output is correct
19 Correct 23 ms 49600 KB Output is correct
20 Correct 22 ms 49620 KB Output is correct
21 Correct 22 ms 49624 KB Output is correct
22 Correct 24 ms 49540 KB Output is correct
23 Correct 24 ms 49632 KB Output is correct
24 Correct 22 ms 49652 KB Output is correct
25 Correct 23 ms 49664 KB Output is correct
26 Correct 23 ms 49604 KB Output is correct
27 Correct 24 ms 50376 KB Output is correct
28 Correct 26 ms 50268 KB Output is correct
29 Correct 25 ms 50304 KB Output is correct
30 Correct 27 ms 49972 KB Output is correct
31 Correct 24 ms 49768 KB Output is correct
32 Correct 24 ms 49748 KB Output is correct
33 Correct 24 ms 50004 KB Output is correct
34 Correct 24 ms 49968 KB Output is correct
35 Correct 25 ms 49924 KB Output is correct
36 Correct 29 ms 50348 KB Output is correct
37 Correct 26 ms 50356 KB Output is correct
38 Correct 30 ms 50444 KB Output is correct
39 Correct 29 ms 50320 KB Output is correct
40 Correct 26 ms 49968 KB Output is correct
41 Correct 27 ms 50152 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 49612 KB Output is correct
2 Correct 25 ms 49544 KB Output is correct
3 Correct 22 ms 49576 KB Output is correct
4 Correct 22 ms 49584 KB Output is correct
5 Correct 27 ms 49620 KB Output is correct
6 Correct 23 ms 49632 KB Output is correct
7 Correct 23 ms 49636 KB Output is correct
8 Correct 24 ms 49624 KB Output is correct
9 Correct 24 ms 49620 KB Output is correct
10 Correct 677 ms 124824 KB Output is correct
11 Correct 585 ms 137748 KB Output is correct
12 Correct 140 ms 72300 KB Output is correct
13 Correct 638 ms 158292 KB Output is correct
14 Correct 329 ms 137304 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 49612 KB Output is correct
2 Correct 25 ms 49544 KB Output is correct
3 Correct 22 ms 49576 KB Output is correct
4 Correct 22 ms 49584 KB Output is correct
5 Correct 27 ms 49620 KB Output is correct
6 Correct 23 ms 49632 KB Output is correct
7 Correct 23 ms 49636 KB Output is correct
8 Correct 24 ms 49624 KB Output is correct
9 Correct 24 ms 49620 KB Output is correct
10 Correct 23 ms 49624 KB Output is correct
11 Correct 24 ms 49712 KB Output is correct
12 Correct 25 ms 49632 KB Output is correct
13 Correct 23 ms 49620 KB Output is correct
14 Correct 23 ms 49544 KB Output is correct
15 Correct 23 ms 49624 KB Output is correct
16 Correct 23 ms 49620 KB Output is correct
17 Correct 23 ms 49548 KB Output is correct
18 Correct 24 ms 49632 KB Output is correct
19 Correct 23 ms 49600 KB Output is correct
20 Correct 22 ms 49620 KB Output is correct
21 Correct 22 ms 49624 KB Output is correct
22 Correct 24 ms 49540 KB Output is correct
23 Correct 24 ms 49632 KB Output is correct
24 Correct 22 ms 49652 KB Output is correct
25 Correct 23 ms 49664 KB Output is correct
26 Correct 23 ms 49604 KB Output is correct
27 Correct 24 ms 50376 KB Output is correct
28 Correct 26 ms 50268 KB Output is correct
29 Correct 25 ms 50304 KB Output is correct
30 Correct 27 ms 49972 KB Output is correct
31 Correct 24 ms 49768 KB Output is correct
32 Correct 24 ms 49748 KB Output is correct
33 Correct 24 ms 50004 KB Output is correct
34 Correct 24 ms 49968 KB Output is correct
35 Correct 25 ms 49924 KB Output is correct
36 Correct 29 ms 50348 KB Output is correct
37 Correct 26 ms 50356 KB Output is correct
38 Correct 30 ms 50444 KB Output is correct
39 Correct 29 ms 50320 KB Output is correct
40 Correct 26 ms 49968 KB Output is correct
41 Correct 27 ms 50152 KB Output is correct
42 Correct 677 ms 124824 KB Output is correct
43 Correct 585 ms 137748 KB Output is correct
44 Correct 140 ms 72300 KB Output is correct
45 Correct 638 ms 158292 KB Output is correct
46 Correct 329 ms 137304 KB Output is correct
47 Correct 27 ms 49620 KB Output is correct
48 Correct 24 ms 49632 KB Output is correct
49 Correct 26 ms 49620 KB Output is correct
50 Correct 290 ms 138456 KB Output is correct
51 Correct 311 ms 140880 KB Output is correct
52 Correct 415 ms 128532 KB Output is correct
53 Correct 364 ms 128460 KB Output is correct
54 Correct 360 ms 128404 KB Output is correct
55 Correct 888 ms 135576 KB Output is correct
56 Correct 427 ms 146564 KB Output is correct
57 Correct 298 ms 129428 KB Output is correct
58 Correct 627 ms 175184 KB Output is correct
59 Correct 1662 ms 160636 KB Output is correct
60 Correct 525 ms 151356 KB Output is correct
61 Correct 1542 ms 154472 KB Output is correct
62 Correct 1116 ms 140316 KB Output is correct
63 Correct 370 ms 144532 KB Output is correct
64 Correct 26 ms 51156 KB Output is correct
65 Correct 27 ms 51124 KB Output is correct
66 Correct 1094 ms 140288 KB Output is correct
67 Correct 51 ms 58956 KB Output is correct
68 Correct 65 ms 64924 KB Output is correct
69 Correct 1614 ms 161188 KB Output is correct
70 Correct 118 ms 80392 KB Output is correct
71 Correct 295 ms 143512 KB Output is correct
72 Correct 1573 ms 160912 KB Output is correct
73 Correct 1133 ms 140384 KB Output is correct