# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
835166 | gustason | Game (IOI14_game) | C++14 | 0 ms | 212 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 <bits/stdc++.h>
using namespace std;
constexpr int nax = 81;
int N;
set<int> adj[nax];
set<int> curr[nax];
bool vis[nax];
int cnt = 0;
void reset() {
for(int i = 0; i < N; i++) {
vis[i] = false;
}
cnt = 0;
}
void dfs(int v, bool all_y) {
vis[v] = true;
cnt++;
for(int u : curr[v]) {
if (!vis[u]) {
dfs(u, all_y);
}
}
if (all_y) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |