Submission #746871

#	Time	Username	Problem	Language	Result	Execution time	Memory
746871		tutis	Game (APIO22_game)	C++17	2 / 100	12 ms	14344 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[2][N];
int mx[2][N];
void init(int n, int k) {
	K = k;
	for (int i = 0; i < n; i++)
		mx[0][i] = -k;
	for (int i = 0; i < k; i++)
		mx[0][i] = -(i + 1);
	for (int i = 0; i < k; i++)
		mx[1][i] = i;
	for (int i = k; i < n; i++)
		mx[1][i] = -1;
}

int add_teleporter(int u, int v) {
	int x = min(v, -mx[0][v]);
	int y = mx[1][u];
	if (y >= x)
		return 1;
	int V[2] = { -x, y};
	for (int t : {1, 0})
	{
		function<void(int)>dfs = [&](int i) {
			mx[t][i] = V[t];
			for (int j : adj[t][i])
				if (V[t] > mx[t][j])
					dfs(j);
		};
		if (V[t] > mx[t][v])
			dfs(v);
		swap(u, v);
	}
	return 0;
}

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