Submission #982778

#	Time	Username	Problem	Language	Result	Execution time	Memory
982778		vjudge1	Game (APIO22_game)	C++17	30 / 100	35 ms	1136 KiB

game

#include "game.h"

#include <bits/stdc++.h>
#define all(x) begin((x)), end((x))
using ll = long long;
using namespace std;

vector<vector<int>> g(1001);
ll                  planets, specials;

void init(int n, int k) {
	planets = n, specials = k;
	for (int i = 0; i < k - 1; i++) g[i].push_back(i + 1);
}

bool dfs(ll v, vector<bool>& vis, ll cut) {
	vis[v] = true;

	if (v < specials) cut = v;
	for (const int& nei : g[v])
		if (nei <= cut || (!vis[nei] && dfs(nei, vis, cut)))
			return true;

	return false;
}
int add_teleporter(int u, int v) {
	g[u].push_back(v);
	vector<bool> vis(1001);
	return dfs(0, vis, INT_MIN);
}

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