oj.uz

답안 #547810

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
547810 2022-04-11T19:43:00 Z blue Collapse (JOI18_collapse) C++17
35 / 100
 15000 ms 26652 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 = 500;





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 7 ms 468 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 9 ms 340 KB Output is correct
4 Correct 10 ms 448 KB Output is correct
5 Correct 52 ms 560 KB Output is correct
6 Correct 163 ms 912 KB Output is correct
7 Correct 3 ms 1108 KB Output is correct
8 Correct 6 ms 1108 KB Output is correct
9 Correct 80 ms 1220 KB Output is correct
10 Correct 182 ms 1260 KB Output is correct
11 Correct 204 ms 1644 KB Output is correct
12 Correct 171 ms 1504 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 2764 KB Output is correct
2 Correct 40 ms 2764 KB Output is correct
3 Correct 1991 ms 5132 KB Output is correct
4 Correct 210 ms 2772 KB Output is correct
5 Correct 2999 ms 5132 KB Output is correct
6 Correct 1608 ms 3156 KB Output is correct
7 Correct 6667 ms 11376 KB Output is correct
8 Correct 3349 ms 6240 KB Output is correct
9 Correct 49 ms 14412 KB Output is correct
10 Correct 106 ms 14500 KB Output is correct
11 Correct 2066 ms 14992 KB Output is correct
12 Correct 4449 ms 17340 KB Output is correct
13 Correct 6948 ms 20364 KB Output is correct
14 Correct 11571 ms 25148 KB Output is correct
15 Correct 9120 ms 25032 KB Output is correct

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 2744 KB Output is correct
2 Correct 59 ms 2708 KB Output is correct
3 Correct 115 ms 2756 KB Output is correct
4 Correct 193 ms 2772 KB Output is correct
5 Correct 2439 ms 2764 KB Output is correct
6 Correct 2305 ms 3340 KB Output is correct
7 Correct 5216 ms 9376 KB Output is correct
8 Correct 8922 ms 13164 KB Output is correct
9 Correct 76 ms 17096 KB Output is correct
10 Correct 3714 ms 16184 KB Output is correct
11 Correct 11520 ms 26604 KB Output is correct
12 Correct 14999 ms 26652 KB Output is correct
13 Correct 12140 ms 26156 KB Output is correct
14 Execution timed out 15078 ms 26448 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 468 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 9 ms 340 KB Output is correct
4 Correct 10 ms 448 KB Output is correct
5 Correct 52 ms 560 KB Output is correct
6 Correct 163 ms 912 KB Output is correct
7 Correct 3 ms 1108 KB Output is correct
8 Correct 6 ms 1108 KB Output is correct
9 Correct 80 ms 1220 KB Output is correct
10 Correct 182 ms 1260 KB Output is correct
11 Correct 204 ms 1644 KB Output is correct
12 Correct 171 ms 1504 KB Output is correct
13 Correct 26 ms 2764 KB Output is correct
14 Correct 40 ms 2764 KB Output is correct
15 Correct 1991 ms 5132 KB Output is correct
16 Correct 210 ms 2772 KB Output is correct
17 Correct 2999 ms 5132 KB Output is correct
18 Correct 1608 ms 3156 KB Output is correct
19 Correct 6667 ms 11376 KB Output is correct
20 Correct 3349 ms 6240 KB Output is correct
21 Correct 49 ms 14412 KB Output is correct
22 Correct 106 ms 14500 KB Output is correct
23 Correct 2066 ms 14992 KB Output is correct
24 Correct 4449 ms 17340 KB Output is correct
25 Correct 6948 ms 20364 KB Output is correct
26 Correct 11571 ms 25148 KB Output is correct
27 Correct 9120 ms 25032 KB Output is correct
28 Correct 24 ms 2744 KB Output is correct
29 Correct 59 ms 2708 KB Output is correct
30 Correct 115 ms 2756 KB Output is correct
31 Correct 193 ms 2772 KB Output is correct
32 Correct 2439 ms 2764 KB Output is correct
33 Correct 2305 ms 3340 KB Output is correct
34 Correct 5216 ms 9376 KB Output is correct
35 Correct 8922 ms 13164 KB Output is correct
36 Correct 76 ms 17096 KB Output is correct
37 Correct 3714 ms 16184 KB Output is correct
38 Correct 11520 ms 26604 KB Output is correct
39 Correct 14999 ms 26652 KB Output is correct
40 Correct 12140 ms 26156 KB Output is correct
41 Execution timed out 15078 ms 26448 KB Time limit exceeded
42 Halted 0 ms 0 KB -