Submission #1313042

#	Time	Username	Problem	Language	Result	Execution time	Memory
1313042		thieunguyenhuy	게임 (APIO22_game)	C++20	0 / 100	0 ms	332 KiB

game

#ifndef hwe
	#include "game.h"
#endif

#include <bits/stdc++.h>
using namespace std;

#define POPCOUNT(n) (__builtin_popcountll((n)))
#define CLZ(n) (__builtin_clzll((n)))
#define CTZ(n) (__builtin_ctzll((n)))
#define LOG(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))

#define Int __int128
#define fi first
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;

template <class T1, class T2> bool maximize(T1 &x, T2 y) {
	if (x < y) {
		x = y;
		return true;
	}
	return false;
}
template <class T1, class T2> bool minimize(T1 &x, T2 y) {
	if (x > y) {
		x = y;
		return true;
	}
	return false;
}

template <class T> void remove_duplicate(vector<T> &ve) {
	sort (ve.begin(), ve.end());
	ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
long long random(long long l, long long r) {
	return uniform_int_distribution<long long>(l, r)(rng);
}
template <class T> T random(T r) {
	return rng() % r;
}

const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1e18;

struct DSU {
	vector<int> lab, special;

	DSU() {}

	void resize(int n, int k) {
		lab.assign(n, -1), special.assign(n, 0);
		for (int i = 0; i < k; ++i) special[i] = 1;
	}

	int find_set(int p) {
		return lab[p] < 0 ? p : lab[p] = find_set(lab[p]);
	}

	bool join(int u, int v) {
		u = find_set(u), v = find_set(v);
		if (u != v) {
			if (lab[u] > lab[v]) swap(u, v);
			lab[u] += lab[v], lab[v] = u;
			return true;
		}
		return false;
	}
} dsu;

void init(int n, int k) {
	dsu.resize(n, k);
	for (int i = 0; i + 1 < k; ++i) dsu.join(i, i + 1);
}

int add_teleporter(int u, int v) {
	if (!dsu.join(u, v)) return dsu.special[dsu.find_set(u)];
	return 0;
}

#ifdef hwe
signed main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);



	return 0;
}
#endif

• Subtask 1: 0 / 2
• Subtask 2: 0 / 10
• Subtask 3: 0 / 18
• Subtask 4: 0 / 30
• Subtask 5: 0 / 40