제출 #1313046

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1313046		thieunguyenhuy	Game (APIO22_game)	C++20	0 / 100	12 ms	28588 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 = 3e5 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1e18;

int n, k;
int ma[N], mi[N];
vector<int> lab;
set<int> in[N], out[N];

void init(int _n, int _k) {
	n = _n, k = _k;
	for (int i = 0; i < n; ++i) {
		lab[i] = i;
		ma[i] = -inf, mi[i] = inf;
		out[i].emplace(i), in[i].emplace(i);
	}
}

int add_teleporter(int u, int v) {
	for (auto &x : out[v]) {
		maximize(ma[x], ma[u]);
		if (mi[x] <= ma[x]) return 1;
	}
	for (auto &x : in[u]) {
		minimize(mi[x], mi[v]);
		if (mi[x] <= ma[x]) return 1;
	}
	out[u].emplace(v), in[v].emplace(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