Submission #168188

#	Time	Username	Problem	Language	Result	Execution time	Memory
168188		johutha	Game (IOI14_game)	C++14	42 / 100	1077 ms	516 KiB

game

#include "game.h"
#include <vector>
#include <iostream>

using namespace std;

struct graph
{
	int n;
	vector<vector<bool>> adjmatrix;

	vector<int> visited;

	void dfs(int curr)
	{
		if (visited[curr]) return;
		visited[curr] = true;

		for (int i = 0; i < n; i++)
		{
			if (i == curr || !adjmatrix[curr][i]) continue;
			dfs(i);
		}
	}

	bool shouldadd(int a, int b)
	{
		adjmatrix[a][b] = false;
		adjmatrix[b][a] = false;

		visited.assign(n, false);
		visited[a] = 0;

		dfs(a);

		bool all = true;

		for (int i = 0; i < n; i++)
		{
			if (!visited[i]) all = false;
		}

		if (!all)
		{
			adjmatrix[a][b] = true;
			adjmatrix[b][a] = true;
		}

		return !all;
	}
};

graph g;

void initialize(int n)
{
	g.n = n;
	g.adjmatrix.resize(n, vector<bool>(n, true));
	g.visited.resize(n, false);
}

int hasEdge(int u, int v) 
{
    return g.shouldadd(u, v);
}

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