oj.uz

Submission #800812

# Submission time Handle Problem Language Result Execution time Memory
800812 2023-08-01T21:43:24 Z Johann Keys (IOI21_keys) C++17
67 / 100
 3000 ms 154896 KB 
#include "bits/stdc++.h"
using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef vector<bool> vb;
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()

const int MAXN = 300007;

int N, M;
vvi dag;
vi R;
vi P;
vi num, low;
stack<int> st;
vb active;
vector<map<int, vi>> npk; // neighbors per key
vvi nodesInC;			  // nodes in component
vector<set<int>> keys;	  // keys per node
vvi todo;				  // nodes to to from a given node

struct unionfind
{
	vi arr;
	void init(int _size)
	{
		arr.resize(_size);
		iota(all(arr), 0);
	}
	int find(int a) { return arr[a] = (arr[a] == a) ? a : find(arr[a]); }
	void merge(int a, int b)
	{
		a = find(a);
		b = find(b);
		arr[a] = b;
	}
};
unionfind uf;

void merge(vi &base, vi &add)
{
	if (sz(base) < sz(add))
		swap(base, add);
	for (int x : add)
		base.push_back(x);
	add.clear();
}
void merge(set<int> &base, set<int> &add)
{
	if (sz(base) < sz(add))
		swap(base, add);
	for (int x : add)
		base.insert(x);
	add.clear();
}

void dfs(int v, int &idx)
{
	num[v] = low[v] = idx++;
	st.push(v);
	active[v] = true;

	while (!todo[v].empty())
	{
		while (!todo[v].empty())
		{
			int u = todo[v].back();
			todo[v].pop_back();

			if (num[u] == -1)
				dfs(u, idx);
			if (active[u] && low[u] <= num[v])
				low[v] = min(low[v], low[u]);
		}
		if (low[v] == num[v])
		{
			// start collecting the component
			// poping nodes from the stack
			while (st.top() != v)
			{
				int u = st.top();
				st.pop();
				// todo
				merge(todo[v], todo[u]);
				// nodes
				merge(nodesInC[v], nodesInC[u]);
				// keys
				for (int k : keys[u])
					if (npk[v].find(k) != npk[v].end())
					{
						merge(todo[v], npk[v][k]);
						npk[v].erase(k);
					}
				merge(keys[v], keys[u]);
				// undone edges
				for (auto it : npk[u])
				{
					if (keys[v].find(it.first) != keys[v].end())
						merge(todo[v], it.second);
					else
						merge(npk[v][it.first], it.second);
				}
				npk[u].clear();
			}
		}
	}
	if (low[v] == num[v])
	{
		// finish collecting the component
		// deactivating all nodes
		assert(st.top() == v);
		st.pop();
		for (int u : nodesInC[v])
			active[u] = false;
	}
}

std::vector<int> find_reachable(std::vector<int> r, std::vector<int> u, std::vector<int> v, std::vector<int> c)
{
	N = sz(r), M = sz(u);
	R = r;

	keys.resize(N);
	for (int i = 0; i < N; ++i)
		keys[i].insert(r[i]);

	npk.resize(N);
	todo.resize(N);
	for (int i = 0; i < sz(u); ++i)
	{
		if (R[u[i]] != c[i])
			npk[u[i]][c[i]].push_back(v[i]);
		else
			todo[u[i]].push_back(v[i]);

		if (R[v[i]] != c[i])
			npk[v[i]][c[i]].push_back(u[i]);
		else
			todo[v[i]].push_back(u[i]);
	}

	// tarjan precomputation
	active.assign(N, false);
	nodesInC.resize(N);
	for (int i = 0; i < N; ++i)
		nodesInC[i].push_back(i);
	num.assign(N, -1), low.assign(N, -1);
	int idx = 0;
	for (int i = 0; i < N; ++i)
		if (num[i] == -1)
			dfs(i, idx);

	// gen dag
	int comp = 0;
	vi belongs(N, -1);
	vi size;
	vector<set<int>> KC;
	for (int i = 0; i < N; ++i)
		if (!nodesInC[i].empty())
		{
			KC.push_back(set<int>());
			size.push_back(sz(nodesInC[i]));
			for (int x : nodesInC[i])
				belongs[x] = comp, KC[comp].insert(R[x]);
			++comp;
		}

	vi out(comp, 0);
	for (int i = 0; i < M; ++i)
	{
		if (belongs[u[i]] == belongs[v[i]])
			continue;
		int uu = belongs[u[i]];
		int vv = belongs[v[i]];
		if (KC[uu].find(c[i]) != KC[uu].end())
			++out[uu];
		if (KC[vv].find(c[i]) != KC[vv].end())
			++out[vv];
	}

	// gen anwer
	int mini = N + 1;
	for (int i = 0; i < comp; ++i)
		if (out[i] == 0)
			mini = min(mini, size[i]);

	vi ans(N, 0);
	for (int i = 0; i < N; ++i)
		ans[i] = (out[belongs[i]] == 0 && mini == size[belongs[i]]);

	return ans;
}

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 0 ms 340 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 0 ms 340 KB Output is correct
9 Correct 0 ms 340 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 0 ms 340 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 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 300 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 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 0 ms 340 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 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 300 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 1364 KB Output is correct
28 Correct 2 ms 1340 KB Output is correct
29 Correct 2 ms 1364 KB Output is correct
30 Correct 2 ms 824 KB Output is correct
31 Correct 1 ms 724 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 596 KB Output is correct
34 Correct 1 ms 852 KB Output is correct
35 Correct 2 ms 724 KB Output is correct
36 Correct 3 ms 1336 KB Output is correct
37 Correct 2 ms 1236 KB Output is correct
38 Correct 3 ms 1492 KB Output is correct
39 Correct 3 ms 1492 KB Output is correct
40 Correct 2 ms 724 KB Output is correct
41 Correct 2 ms 852 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 0 ms 340 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 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 772 ms 88976 KB Output is correct
11 Correct 336 ms 99604 KB Output is correct
12 Correct 74 ms 23716 KB Output is correct
13 Correct 586 ms 123140 KB Output is correct
14 Correct 207 ms 154896 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 0 ms 340 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 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 300 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 1364 KB Output is correct
28 Correct 2 ms 1340 KB Output is correct
29 Correct 2 ms 1364 KB Output is correct
30 Correct 2 ms 824 KB Output is correct
31 Correct 1 ms 724 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 596 KB Output is correct
34 Correct 1 ms 852 KB Output is correct
35 Correct 2 ms 724 KB Output is correct
36 Correct 3 ms 1336 KB Output is correct
37 Correct 2 ms 1236 KB Output is correct
38 Correct 3 ms 1492 KB Output is correct
39 Correct 3 ms 1492 KB Output is correct
40 Correct 2 ms 724 KB Output is correct
41 Correct 2 ms 852 KB Output is correct
42 Correct 772 ms 88976 KB Output is correct
43 Correct 336 ms 99604 KB Output is correct
44 Correct 74 ms 23716 KB Output is correct
45 Correct 586 ms 123140 KB Output is correct
46 Correct 207 ms 154896 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 229 ms 122864 KB Output is correct
51 Correct 192 ms 125732 KB Output is correct
52 Correct 284 ms 115684 KB Output is correct
53 Correct 292 ms 115784 KB Output is correct
54 Correct 284 ms 115712 KB Output is correct
55 Execution timed out 3069 ms 102800 KB Time limit exceeded
56 Halted 0 ms 0 KB -