oj.uz

답안 #547809

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
547809 2022-04-11T19:41:05 Z blue Collapse (JOI18_collapse) C++17
100 / 100
 14955 ms 29500 KB 
#include "collapse.h"
#include <vector>
#include <algorithm>
#include <set>
#include <queue>
#include <iostream>
using namespace std;

using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
#define sz(x) int(x.size())

const int bs = 450;





struct dss
{
	int Z;
	vi parent;
	vi subtree;

	dss()
	{
		;
	}

	dss(int Z_)
	{
		Z = Z_;
		parent = subtree = vi(Z);
		for(int i = 0; i < Z; i++)
		{
			parent[i] = i;
			subtree[i] = 1;
		}
	}

	int root(int u)
	{
		if(parent[u] == u) return u;
		else return (parent[u] = root(parent[u]));
	}

	bool join(int u, int v)
	{
		u = root(u);
		v = root(v);
		if(u == v) return 0;
		if(subtree[u] < subtree[v]) swap(u, v);
		parent[v] = u;
		subtree[u] += subtree[v];
		return 1;
	}

	bool connected(int u, int v)
	{
		return root(u) == root(v);
	}
};






vi simulateCollapse(int N, vi T, vi X, vi Y, vi W, vi P)
{	
	int C = sz(X);
	int Q = sz(W);

	for(int i = 0; i < C; i++)
	{
		if(X[i] > Y[i])
			swap(X[i], Y[i]);
	}

	vi queries[N];
	for(int q = 0; q < Q; q++)
		queries[P[q]].push_back(q);

	vi res(Q);




	for(int bl = 0; bl*bs < C; bl++)
	{
		int l = bl*bs, r = min((bl+1)*bs - 1, C-1);

		// cerr << "\n\n\n\n\n\n\n";
		// cerr << "l r = " << l << ' ' << r << '\n';

		set<pii> critical;
		for(int i = l; i <= r; i++)
		{
			critical.insert({X[i], Y[i]});
		}

		set<pii> edgeset;

		for(int i = 0; i < l; i++)
		{
			// if(critical.find({X[i], Y[i]}) != critical.end())
			// 	continue;

			if(T[i] == 0)
				edgeset.insert({X[i], Y[i]});
			else
				edgeset.erase({X[i], Y[i]});
		}

		set<pii> yescritical;

		for(pii z : critical)
		{
			if(edgeset.find(z) != edgeset.end())
			{
				edgeset.erase(z);
				yescritical.insert(z);
			}
		}

		vi fwdedge[N], backedge[N];
		for(auto e : edgeset)
		{
			fwdedge[e.first].push_back(e.second);
			backedge[e.second].push_back(e.first);
		}

		// cerr << "critical edges\n";
		// for(pii f : critical) cerr << f.first << ' ' << f.second << '\n';
		// 	cerr << '\n';
		// cerr << '\n';





























		dss dsu1(N);

		int comps = 0;

		vi checkedge[N];
		vi vis(N, 0);


		for(int i = 0; i <= N-2; i++)
		{
			comps++;

			for(int j : backedge[i])
			{
				comps -= dsu1.join(i, j);
			}

			for(int q : queries[i])
			{
				int t = W[q];

				if(!(l <= t && t <= r)) continue;

				set<pii> currcritical;

				for(pii w : yescritical)
					if(w.second <= P[q])
						currcritical.insert(w);

				vi vertlist;

				for(int ei = l; ei <= t; ei++)
				{
					if(Y[ei] >= P[q] + 1) continue;

					if(T[ei] == 0)
						currcritical.insert({X[ei], Y[ei]});
					else
						currcritical.erase({X[ei], Y[ei]});
				}

				for(auto k : currcritical)
				{
					int rx = dsu1.root(k.first);
					int ry = dsu1.root(k.second);

					checkedge[rx].push_back(ry);
					checkedge[ry].push_back(rx);

					vertlist.push_back(rx);
					vertlist.push_back(ry);
				}

				int thiscomps = comps;

				for(int z : vertlist)
				{
					if(vis[z]) continue;

					queue<int> tbv;
					tbv.push(z);
					vis[z] = 1;

					while(!tbv.empty())
					{
						int u = tbv.front();
						tbv.pop();

						for(int v : checkedge[u])
						{
							if(vis[v]) continue;
							vis[v] = 1;
							thiscomps--;
							tbv.push(v);
						}
					}
				}

				for(int v : vertlist)
				{
					vis[v] = 0;
					checkedge[v].clear();
				}

				res[q] += thiscomps;
				// cerr << "thiscomps = " << thiscomps << '\n';
			}
		}






















		dss dsu2(N);

		comps = 0;

		for(int i = 0; i < N; i++)
			checkedge[i].clear();

		vis = vi(N, 0);


		for(int i = N-1; i >= 1; i--)
		{
			comps++;

			for(int j : fwdedge[i])
			{
				comps -= dsu2.join(i, j);
			}

			for(int q : queries[i-1])
			{
				int t = W[q];
				if(!(l <= t && t <= r)) continue;

				set<pii> currcritical;

				for(pii w : yescritical)
					if(w.first >= P[q] + 1)
						currcritical.insert(w);

				vi vertlist;

				for(int ei = l; ei <= t; ei++)
				{
					if(X[ei] <= P[q]) continue;

					if(T[ei] == 0)
						currcritical.insert({X[ei], Y[ei]});
					else
						currcritical.erase({X[ei], Y[ei]});
				}

				// cerr << "l = " << l << ", t = " << t << '\n';

				for(auto k : currcritical)
				{
					int rx = dsu2.root(k.first);
					int ry = dsu2.root(k.second);

					checkedge[rx].push_back(ry);
					checkedge[ry].push_back(rx);

					vertlist.push_back(rx);
					vertlist.push_back(ry);
				}

				int thiscomps = comps;

				for(int z : vertlist)
				{
					if(vis[z]) continue;

					queue<int> tbv;
					tbv.push(z);
					vis[z] = 1;

					while(!tbv.empty())
					{
						int u = tbv.front();
						tbv.pop();

						for(int v : checkedge[u])
						{
							if(vis[v]) continue;
							vis[v] = 1;
							thiscomps--;
							tbv.push(v);
						}
					}
				}

				for(int v : vertlist)
				{
					vis[v] = 0;
					checkedge[v].clear();
				}

				res[q] += thiscomps;
				// cerr << "thiscomps = " << thiscomps << '\n';
			}
		}
	}




	return res;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 468 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 7 ms 340 KB Output is correct
4 Correct 10 ms 340 KB Output is correct
5 Correct 53 ms 552 KB Output is correct
6 Correct 131 ms 796 KB Output is correct
7 Correct 3 ms 1108 KB Output is correct
8 Correct 6 ms 1108 KB Output is correct
9 Correct 72 ms 1236 KB Output is correct
10 Correct 167 ms 1236 KB Output is correct
11 Correct 191 ms 1632 KB Output is correct
12 Correct 159 ms 1536 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 2764 KB Output is correct
2 Correct 40 ms 2772 KB Output is correct
3 Correct 2123 ms 5132 KB Output is correct
4 Correct 178 ms 2776 KB Output is correct
5 Correct 3076 ms 5132 KB Output is correct
6 Correct 1438 ms 3156 KB Output is correct
7 Correct 7073 ms 11436 KB Output is correct
8 Correct 3385 ms 6336 KB Output is correct
9 Correct 50 ms 14416 KB Output is correct
10 Correct 107 ms 14520 KB Output is correct
11 Correct 2031 ms 14856 KB Output is correct
12 Correct 4274 ms 17048 KB Output is correct
13 Correct 7245 ms 20792 KB Output is correct
14 Correct 11565 ms 25104 KB Output is correct
15 Correct 8717 ms 25068 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 2748 KB Output is correct
2 Correct 51 ms 2784 KB Output is correct
3 Correct 102 ms 2852 KB Output is correct
4 Correct 179 ms 2856 KB Output is correct
5 Correct 1833 ms 2752 KB Output is correct
6 Correct 1947 ms 3300 KB Output is correct
7 Correct 4669 ms 9496 KB Output is correct
8 Correct 8170 ms 13132 KB Output is correct
9 Correct 64 ms 17104 KB Output is correct
10 Correct 2819 ms 16292 KB Output is correct
11 Correct 10582 ms 26268 KB Output is correct
12 Correct 13827 ms 26784 KB Output is correct
13 Correct 12452 ms 28652 KB Output is correct
14 Correct 14955 ms 29168 KB Output is correct
15 Correct 11942 ms 28932 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 468 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 7 ms 340 KB Output is correct
4 Correct 10 ms 340 KB Output is correct
5 Correct 53 ms 552 KB Output is correct
6 Correct 131 ms 796 KB Output is correct
7 Correct 3 ms 1108 KB Output is correct
8 Correct 6 ms 1108 KB Output is correct
9 Correct 72 ms 1236 KB Output is correct
10 Correct 167 ms 1236 KB Output is correct
11 Correct 191 ms 1632 KB Output is correct
12 Correct 159 ms 1536 KB Output is correct
13 Correct 27 ms 2764 KB Output is correct
14 Correct 40 ms 2772 KB Output is correct
15 Correct 2123 ms 5132 KB Output is correct
16 Correct 178 ms 2776 KB Output is correct
17 Correct 3076 ms 5132 KB Output is correct
18 Correct 1438 ms 3156 KB Output is correct
19 Correct 7073 ms 11436 KB Output is correct
20 Correct 3385 ms 6336 KB Output is correct
21 Correct 50 ms 14416 KB Output is correct
22 Correct 107 ms 14520 KB Output is correct
23 Correct 2031 ms 14856 KB Output is correct
24 Correct 4274 ms 17048 KB Output is correct
25 Correct 7245 ms 20792 KB Output is correct
26 Correct 11565 ms 25104 KB Output is correct
27 Correct 8717 ms 25068 KB Output is correct
28 Correct 24 ms 2748 KB Output is correct
29 Correct 51 ms 2784 KB Output is correct
30 Correct 102 ms 2852 KB Output is correct
31 Correct 179 ms 2856 KB Output is correct
32 Correct 1833 ms 2752 KB Output is correct
33 Correct 1947 ms 3300 KB Output is correct
34 Correct 4669 ms 9496 KB Output is correct
35 Correct 8170 ms 13132 KB Output is correct
36 Correct 64 ms 17104 KB Output is correct
37 Correct 2819 ms 16292 KB Output is correct
38 Correct 10582 ms 26268 KB Output is correct
39 Correct 13827 ms 26784 KB Output is correct
40 Correct 12452 ms 28652 KB Output is correct
41 Correct 14955 ms 29168 KB Output is correct
42 Correct 11942 ms 28932 KB Output is correct
43 Correct 3633 ms 7228 KB Output is correct
44 Correct 7933 ms 13600 KB Output is correct
45 Correct 4625 ms 8912 KB Output is correct
46 Correct 9722 ms 15244 KB Output is correct
47 Correct 81 ms 17868 KB Output is correct
48 Correct 123 ms 16812 KB Output is correct
49 Correct 2994 ms 17140 KB Output is correct
50 Correct 4307 ms 18640 KB Output is correct
51 Correct 6469 ms 21252 KB Output is correct
52 Correct 10536 ms 23264 KB Output is correct
53 Correct 9350 ms 22680 KB Output is correct
54 Correct 12186 ms 25020 KB Output is correct
55 Correct 10333 ms 24356 KB Output is correct
56 Correct 11234 ms 26044 KB Output is correct
57 Correct 13258 ms 27396 KB Output is correct
58 Correct 12890 ms 28112 KB Output is correct
59 Correct 10806 ms 28952 KB Output is correct
60 Correct 13813 ms 29500 KB Output is correct