Submission #61430

#	Time	Username	Problem	Language	Result	Execution time	Memory
61430		qkxwsm	Collapse (JOI18_collapse)	C++17	5 / 100	15088 ms	29600 KiB

collapse

#include "collapse.h"
#include <bits/stdc++.h>

using namespace std;

template<class T>
void readi(T &x)
{
	T input = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		input = input * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		input = -input;
	}
	x = input;
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int aout[20];
	int ilen = 0;
	while(output)
	{
		aout[ilen] = ((output % 10));
		output /= 10;
		ilen++;
	}
	for (int i = ilen - 1; i >= 0; i--)
	{
		putchar(aout[i] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
long long randomize(long long mod)
{
	return ((1ll << 30) * rand() + (1ll << 15) * rand() + rand()) % mod;
}

#define MP make_pair
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-10;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 100000

long long normalize(long long x, long long mod = INF)
{
	return (((x % mod) + mod) % mod);
}

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

int N, K, Q;
bool eid[MAXN];
pii ed[MAXN];
pii quer[MAXN];
vector<pii> queries[MAXN];
int ans[MAXN];
set<int> edge[MAXN];
int dsu[MAXN];

int find_parent(int u)
{
	if (u == dsu[u])
	{
		return u;
	}
	dsu[u] = find_parent(dsu[u]);
	return dsu[u];
}
void merge(int u, int v)
{
	u = find_parent(u);
	v = find_parent(v);
	if (u == v)
	{
		return;
	}
	dsu[u] = v;
	return;
}
int slit(int x)
{
	for (int i = 0; i < N; i++)
	{
		dsu[i] = i;
	}
	for (int u = 0; u < N; u++)
	{
		for (int v : edge[u])
		{
			if (v > u)
			{
				break;
			}
			if (u > x && v <= x)
			{
				continue;
			}
			merge(u, v);
		}
	}
	int res = 0;
	for (int i = 0; i < N; i++)
	{
		if (find_parent(i) == i) res++;
	}
	return res;
}
vi simulateCollapse(int n, vi t, vi x, vi y, vi w, vi p)
{
	N = n;
	K = t.size();
	Q = w.size();
	for (int i = 0; i < K; i++)
	{
		eid[i] = t[i];
		ed[i] = MP(x[i], y[i]);
	}
	for (int i = 0; i < Q; i++)
	{
		quer[i] = MP(w[i], p[i]); //collapse at p
		queries[w[i]].PB(MP(p[i], i));
	}
//	cerr << "huh\n";
	for (int i = 0; i < K; i++)
	{
		int u = ed[i].fi, v = ed[i].se;
		if (eid[i])
		{
			edge[u].erase(v);
			edge[v].erase(u);
		}
		else
		{
			edge[u].insert(v);
			edge[v].insert(u);
		}
		for (pii x : queries[i])
		{
			ans[x.se] = slit(x.fi);
		}
	}
	vi res(Q);
	for (int i = 0; i < Q; i++)
	{
		res[i] = ans[i];
	}
	return res;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 30
• Subtask 3: 0 / 30
• Subtask 4: 0 / 35