oj.uz

Submission #435915

# Submission time Handle Problem Language Result Execution time Memory
435915 2021-06-23T23:32:57 Z frodakcin Keys (IOI21_keys) C++17
100 / 100
 2136 ms 164904 KB 
#include <cassert>
#include <cstring>
#include <stack>
#include <vector>
#include <set>

template<typename T> bool ckmax(T& a, const T& b) {return b>a?a=b,1:0;}
template<typename T> bool ckmin(T& a, const T& b) {return b<a?a=b,1:0;}

const int MN = 3e5+10;

int N, M;
struct edge
{
	public:
		int n, w;
		bool operator < (const edge& o) const {return w < o.w || !(o.w < w) && n < o.n;}
};

struct DSU
{
	public:
		std::vector<int> p, r;

		DSU(int N): p(N, -1), r(N, 0) {}
		int find(int n) {return p[n]==-1 ? n : p[n]=find(p[n]);}
		bool merge(int a, int b)
		{
			a=find(a), b=find(b);
			assert(a!=b);
			if(a==b) return 0;
			if(r[a]<r[b]) std::swap(a,b);
			p[b]=a, r[a]+=r[a]==r[b], r[b]=-1;
			return 1;
		}
};
DSU dsu(MN);

std::set<edge> a[MN];
std::set<int> col[MN];
std::vector<int> todo[MN];

int d[MN], l[MN], ctr, cc, sz[MN]; // scc
bool in_stack[MN], out[MN], good[MN];
std::stack<int> stk;
std::vector<int> g[MN];

void dfs(int n)
{
	d[n] = l[n] = ctr++;
	stk.push(n);
	in_stack[n] = 1;

	for(;!todo[n].empty();)
	{
		int x=todo[n].back(); todo[n].pop_back();
		if(d[x] == -1)
		{
			dfs(x), ckmin(l[n], l[x]);
			if(!in_stack[x])
				out[n]=1;
		}
		else if(in_stack[x])
			ckmin(l[n], d[x]);
		else
			out[n]=1;

		int u=dsu.find(n), v=dsu.find(x);
		if(u!=v)
		{
			dsu.merge(u, v);
			if(dsu.p[v] == -1) std::swap(u,v);
			//v -> u
			if(col[u].size()+a[u].size() < col[v].size()+a[v].size())
				col[u].swap(col[v]), a[u].swap(a[v]);

			for(int c:col[v])
				if(col[u].insert(c).second)
				{
					auto it=a[u].lower_bound({-1,c});
					for(;it != a[u].end() && it->w == c;it=a[u].erase(it))
						todo[n].push_back(it->n);
				}
			for(auto c:a[v])
				if(col[u].find(c.w) != col[u].end())
					todo[n].push_back(c.n);
				else a[u].insert(c);

			col[v].clear();
			a[v].clear();
		}
		/*
		printf("MERGE %d - %d\n", n, x);
		printf("COL: "); for(auto z:col[dsu.find(n)]) printf("%d ", z); printf("\n");
		printf("EDG: "); for(auto z:a[dsu.find(n)]) printf("(%d,%d) ", z.n, z.w); printf("\n");
		*/
	}

	if(l[n] == d[n])
	{
		++cc;
		good[cc]=1;
		for(;;)
		{
			int x=stk.top(); stk.pop();
			++sz[cc];
			if(out[x]) good[cc]=0;
			g[cc].push_back(x);
			in_stack[x] = 0;

			if(x == n) break;
		}
	}
}

std::vector<int> find_reachable(std::vector<int> r, std::vector<int> u, std::vector<int> v, std::vector<int> c)
{
	memset(d, -1, sizeof d);

	N = r.size();
	M = u.size();
	std::vector<int> ans(r.size(), 0);

	for(int i=0;i<M;++i)
	{
		a[u[i]].insert({v[i], c[i]});
		a[v[i]].insert({u[i], c[i]});
	}
	for(int i=0;i<N;++i)
	{
		col[i].insert(r[i]);
		auto it=a[i].lower_bound({-1,r[i]});
		for(;it != a[i].end() && it->w == r[i];it = a[i].erase(it))
			todo[i].push_back(it->n);
	}

	for(int i=0;i<N;++i)
	{
		if(d[i] == -1)
			dfs(i);
	}

	int msz=N;
	for(int i=1;i<=cc;++i)
		if(good[i])
			ckmin(msz, sz[i]);
	for(int i=1;i<=cc;++i)
		if(good[i] && sz[i] == msz)
			for(int x:g[i])
				ans[x]=1;

	return ans;
}

Compilation message

keys.cpp: In member function 'bool edge::operator<(const edge&) const':
keys.cpp:17:71: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   17 |   bool operator < (const edge& o) const {return w < o.w || !(o.w < w) && n < o.n;}
      |                                                            ~~~~~~~~~~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 46028 KB Output is correct
2 Correct 33 ms 46028 KB Output is correct
3 Correct 36 ms 46096 KB Output is correct
4 Correct 30 ms 46080 KB Output is correct
5 Correct 31 ms 46020 KB Output is correct
6 Correct 30 ms 45964 KB Output is correct
7 Correct 28 ms 46028 KB Output is correct
8 Correct 29 ms 46144 KB Output is correct
9 Correct 28 ms 46028 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 46028 KB Output is correct
2 Correct 33 ms 46028 KB Output is correct
3 Correct 36 ms 46096 KB Output is correct
4 Correct 30 ms 46080 KB Output is correct
5 Correct 31 ms 46020 KB Output is correct
6 Correct 30 ms 45964 KB Output is correct
7 Correct 28 ms 46028 KB Output is correct
8 Correct 29 ms 46144 KB Output is correct
9 Correct 28 ms 46028 KB Output is correct
10 Correct 29 ms 46112 KB Output is correct
11 Correct 36 ms 46084 KB Output is correct
12 Correct 31 ms 46056 KB Output is correct
13 Correct 32 ms 46024 KB Output is correct
14 Correct 30 ms 45980 KB Output is correct
15 Correct 29 ms 46160 KB Output is correct
16 Correct 30 ms 46032 KB Output is correct
17 Correct 31 ms 46060 KB Output is correct
18 Correct 30 ms 46132 KB Output is correct
19 Correct 34 ms 46028 KB Output is correct
20 Correct 35 ms 46028 KB Output is correct
21 Correct 29 ms 46156 KB Output is correct
22 Correct 29 ms 46064 KB Output is correct
23 Correct 28 ms 46160 KB Output is correct
24 Correct 31 ms 46148 KB Output is correct
25 Correct 28 ms 46180 KB Output is correct
26 Correct 29 ms 46072 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 46028 KB Output is correct
2 Correct 33 ms 46028 KB Output is correct
3 Correct 36 ms 46096 KB Output is correct
4 Correct 30 ms 46080 KB Output is correct
5 Correct 31 ms 46020 KB Output is correct
6 Correct 30 ms 45964 KB Output is correct
7 Correct 28 ms 46028 KB Output is correct
8 Correct 29 ms 46144 KB Output is correct
9 Correct 28 ms 46028 KB Output is correct
10 Correct 29 ms 46112 KB Output is correct
11 Correct 36 ms 46084 KB Output is correct
12 Correct 31 ms 46056 KB Output is correct
13 Correct 32 ms 46024 KB Output is correct
14 Correct 30 ms 45980 KB Output is correct
15 Correct 29 ms 46160 KB Output is correct
16 Correct 30 ms 46032 KB Output is correct
17 Correct 31 ms 46060 KB Output is correct
18 Correct 30 ms 46132 KB Output is correct
19 Correct 34 ms 46028 KB Output is correct
20 Correct 35 ms 46028 KB Output is correct
21 Correct 29 ms 46156 KB Output is correct
22 Correct 29 ms 46064 KB Output is correct
23 Correct 28 ms 46160 KB Output is correct
24 Correct 31 ms 46148 KB Output is correct
25 Correct 28 ms 46180 KB Output is correct
26 Correct 29 ms 46072 KB Output is correct
27 Correct 32 ms 46628 KB Output is correct
28 Correct 34 ms 46504 KB Output is correct
29 Correct 34 ms 46744 KB Output is correct
30 Correct 29 ms 46284 KB Output is correct
31 Correct 31 ms 46284 KB Output is correct
32 Correct 30 ms 46144 KB Output is correct
33 Correct 30 ms 46144 KB Output is correct
34 Correct 29 ms 46412 KB Output is correct
35 Correct 29 ms 46412 KB Output is correct
36 Correct 33 ms 46824 KB Output is correct
37 Correct 33 ms 46728 KB Output is correct
38 Correct 32 ms 46928 KB Output is correct
39 Correct 37 ms 46812 KB Output is correct
40 Correct 30 ms 46296 KB Output is correct
41 Correct 30 ms 46416 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 46028 KB Output is correct
2 Correct 33 ms 46028 KB Output is correct
3 Correct 36 ms 46096 KB Output is correct
4 Correct 30 ms 46080 KB Output is correct
5 Correct 31 ms 46020 KB Output is correct
6 Correct 30 ms 45964 KB Output is correct
7 Correct 28 ms 46028 KB Output is correct
8 Correct 29 ms 46144 KB Output is correct
9 Correct 28 ms 46028 KB Output is correct
10 Correct 1035 ms 103448 KB Output is correct
11 Correct 1047 ms 98604 KB Output is correct
12 Correct 150 ms 55684 KB Output is correct
13 Correct 695 ms 92484 KB Output is correct
14 Correct 403 ms 164784 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 46028 KB Output is correct
2 Correct 33 ms 46028 KB Output is correct
3 Correct 36 ms 46096 KB Output is correct
4 Correct 30 ms 46080 KB Output is correct
5 Correct 31 ms 46020 KB Output is correct
6 Correct 30 ms 45964 KB Output is correct
7 Correct 28 ms 46028 KB Output is correct
8 Correct 29 ms 46144 KB Output is correct
9 Correct 28 ms 46028 KB Output is correct
10 Correct 29 ms 46112 KB Output is correct
11 Correct 36 ms 46084 KB Output is correct
12 Correct 31 ms 46056 KB Output is correct
13 Correct 32 ms 46024 KB Output is correct
14 Correct 30 ms 45980 KB Output is correct
15 Correct 29 ms 46160 KB Output is correct
16 Correct 30 ms 46032 KB Output is correct
17 Correct 31 ms 46060 KB Output is correct
18 Correct 30 ms 46132 KB Output is correct
19 Correct 34 ms 46028 KB Output is correct
20 Correct 35 ms 46028 KB Output is correct
21 Correct 29 ms 46156 KB Output is correct
22 Correct 29 ms 46064 KB Output is correct
23 Correct 28 ms 46160 KB Output is correct
24 Correct 31 ms 46148 KB Output is correct
25 Correct 28 ms 46180 KB Output is correct
26 Correct 29 ms 46072 KB Output is correct
27 Correct 32 ms 46628 KB Output is correct
28 Correct 34 ms 46504 KB Output is correct
29 Correct 34 ms 46744 KB Output is correct
30 Correct 29 ms 46284 KB Output is correct
31 Correct 31 ms 46284 KB Output is correct
32 Correct 30 ms 46144 KB Output is correct
33 Correct 30 ms 46144 KB Output is correct
34 Correct 29 ms 46412 KB Output is correct
35 Correct 29 ms 46412 KB Output is correct
36 Correct 33 ms 46824 KB Output is correct
37 Correct 33 ms 46728 KB Output is correct
38 Correct 32 ms 46928 KB Output is correct
39 Correct 37 ms 46812 KB Output is correct
40 Correct 30 ms 46296 KB Output is correct
41 Correct 30 ms 46416 KB Output is correct
42 Correct 1035 ms 103448 KB Output is correct
43 Correct 1047 ms 98604 KB Output is correct
44 Correct 150 ms 55684 KB Output is correct
45 Correct 695 ms 92484 KB Output is correct
46 Correct 403 ms 164784 KB Output is correct
47 Correct 29 ms 46080 KB Output is correct
48 Correct 31 ms 46008 KB Output is correct
49 Correct 31 ms 46112 KB Output is correct
50 Correct 337 ms 127800 KB Output is correct
51 Correct 434 ms 127708 KB Output is correct
52 Correct 953 ms 91920 KB Output is correct
53 Correct 1022 ms 102924 KB Output is correct
54 Correct 1054 ms 103332 KB Output is correct
55 Correct 1545 ms 102696 KB Output is correct
56 Correct 1338 ms 106512 KB Output is correct
57 Correct 1283 ms 101436 KB Output is correct
58 Correct 1613 ms 97360 KB Output is correct
59 Correct 2136 ms 117652 KB Output is correct
60 Correct 1422 ms 143368 KB Output is correct
61 Correct 1401 ms 142912 KB Output is correct
62 Correct 1349 ms 121288 KB Output is correct
63 Correct 292 ms 89256 KB Output is correct
64 Correct 34 ms 48076 KB Output is correct
65 Correct 34 ms 48056 KB Output is correct
66 Correct 1358 ms 121404 KB Output is correct
67 Correct 61 ms 58052 KB Output is correct
68 Correct 81 ms 66144 KB Output is correct
69 Correct 2033 ms 117308 KB Output is correct
70 Correct 138 ms 85628 KB Output is correct
71 Correct 358 ms 164904 KB Output is correct
72 Correct 2050 ms 117564 KB Output is correct
73 Correct 1380 ms 121484 KB Output is correct