Submission #779183

#	Time	Username	Problem	Language	Result	Execution time	Memory
779183		Sohsoh84	Game (IOI14_game)	C++17	42 / 100	1081 ms	26028 KiB

game

#include "game.h"
#include <bits/stdc++.h>

using namespace std;

#define all(x)		(x).begin(),(x).end()

const int MAXN = 1e6 + 10;

int n;
vector<int> adj[MAXN];
bool vis[MAXN];

void initialize(int n_) {
	n = n_;
	for (int i = 0; i < n; i++)
		for (int j = 0; j < n; j++)
			if (i != j)
				adj[i].push_back(j);
}

void dfs(int v) {
	vis[v] = true;
	for (int u : adj[v])
		if (!vis[u])
			dfs(u);
}

int hasEdge(int u, int v) {
	adj[u].erase(find(all(adj[u]), v));
	adj[v].erase(find(all(adj[v]), u));

	for (int i = 0; i < n; i++) vis[i] = false;
	dfs(1);

	bool flag = true;
	for (int i = 0; i < n; i++)
		if (!vis[i])
			flag = false;

	if (flag) return 0;

	adj[u].push_back(v);
	adj[v].push_back(u);
	return 1;
}

• Subtask 1: 15 / 15
• Subtask 2: 27 / 27
• Subtask 3: 0 / 58