# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1166969 | HappyCapybara | Game (IOI14_game) | C++17 | 1094 ms | 11980 KiB |
#include "game.h"
#include<bits/stdc++.h>
using namespace std;
int n;
vector<unordered_set<int>> h;
bool check(){
vector<bool> seen(n, false);
int x = 0;
queue<int> q;
q.push(0);
while (!q.empty()){
int cur = q.front();
q.pop();
if (seen[cur]) continue;
seen[cur] = true;
x++;
for (int next : h[cur]) q.push(next);
}
return (x == n);
}
void initialize(int n){
::n = n;
h.resize(n);
for (int i=0; i<n; i++){
for (int j=0; j<n; j++){
if (i != j) h[i].insert(j);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |