Submission #585682

#TimeUsernameProblemLanguageResultExecution timeMemory
585682SeDunionGame (IOI14_game)C++17
0 / 100
1 ms356 KiB
#include "game.h" #include<iostream> #include<vector> using namespace std; const int N = 2000; int frb[N][N]; int n; void initialize(int n_) { n = n_; for (int i = 0 ; i < n ; ++ i) { for (int j = 0 ; j < n ; ++ j) { frb[i][j] = 0; } } } int used[N]; vector<int>g[N]; void dfs(int v) { used[v] = 1; for (int to : g[v]) if (!used[to]) { dfs(to); } } int hasEdge(int u, int v) { return rand()%2; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...