# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
66841 | Kubalionzzale | Game (IOI14_game) | C++14 | 694 ms | 263168 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "game.h"
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
std::vector< std::vector<int> > g(1510);
int cnt[1510] = { 0 }, cnting = 0;
int curi, curj;
int n;
bool visited[1510] = { 0 };
void dfs(int index)
{
++cnting;
for (int i = 0; i < g[index].size(); ++i)
{
int next = g[index][i];
if ((curi == index && curj == next) || (curi == next && curj == index))
{
continue;
}
if (!visited[next])
dfs(next);
}
}
void dfss(int index)
{
for (int i = 0; i < n; ++i)
{
visited[i] = 0;
}
dfs(0);
}
void initialize(int N) {
n = N;
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
{
if (i == j)
continue;
g[i].push_back(j);
g[j].push_back(i);
}
}
}
int hasEdge(int u, int v) {
curi = u;
curj = v;
dfss(0);
if (cnting == n)
{
return 0;
}
else
{
for (int i = 0; i < g[u].size(); ++i)
{
if (g[u][i] == v)
{
g[u].erase(g[u].begin() + i);
break;
}
}
for (int i = 0; i < g[v].size(); ++i)
{
if (g[v][i] == u)
{
g[v].erase(g[v].begin() + i);
break;
}
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |