Submission #966837

#	Time	Username	Problem	Language	Result	Execution time	Memory
966837		josanneo22	Game (APIO22_game)	C++17	60 / 100	1574 ms	120904 KiB

game

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

const int nax = 30005;
const int kax = 1005;
int reach[kax][nax], N, K;
vector<int> G[nax];
bool ok;

void dfs(int tp, int u) {
	reach[tp][u] = 1;
	if (u <= tp) ok = true;
	for (auto & v : G[u]) {
		if (!reach[tp][v]) {
			dfs(tp, v);
		}
	}
}
void init(int n, int k) {
	N = n; K = k; ok = false;
	for (int i = 1; i <= k - 1; i++) G[i].push_back(i + 1);
	for (int i = 1; i <= k - 1; i++) dfs(i, i + 1);
}
int add_teleporter(int u, int v) {
	u++; v++;
	G[u].push_back(v);
	for (int i = 1; i <= K; i++) {
		if ((u == i || reach[i][u]) && !reach[i][v]) {
			dfs(i, v);
		}
	}
	return ok;
}

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