# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1164056 | Aliyyiakbar | Game (IOI14_game) | C++20 | 1095 ms | 1476 KiB |
#include "bits/stdc++.h"
#include "game.h"
using namespace std;
const int sz = 2e3 + 9;
int used[sz];
int TIME = 0;
int cnt = 0;
bool v[sz][sz];
int n;
void dfs(int node)
{
used[node] = TIME;
++cnt;
for (int i = 0; i < n; ++i)
{
if (!v[node][i] && used[i] != TIME)
{
dfs(i);
}
}
}
void initialize(int __n)
{
n = __n;
cnt = 0;
TIME = 0;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |