Submission #746851

#	Time	Username	Problem	Language	Result	Execution time	Memory
746851		tutis	Game (APIO22_game)	C++17	60 / 100	4040 ms	27408 KiB

game

#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
const int N = 300000;
int K;

vector<int>adj_[N];
int mn[N];
void init(int n, int k) {
	K = k;
	for (int i = 0; i < n; i++)
		mn[i] = k;
	for (int i = 0; i < k; i++)
		mn[i] = i + 1;
}

int add_teleporter(int u, int v) {
	int x = min(v, mn[v]);
	int ret = 0;
	function<void(int)>dfs = [&](int i) {
		mn[i] = x;
		if (i < K && x <= i) {
			ret = 1;
		}
		for (int j : adj_[i])
			if (mn[j] > x)
				dfs(j);
	};
	if (mn[u] > x)
		dfs(u);
	adj_[v].push_back(u);
	return ret;
}

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