Submission #813587

#TimeUsernameProblemLanguageResultExecution timeMemory
813587LiudasGame (IOI14_game)C++17
0 / 100
1 ms212 KiB
#include "game.h" #include <bits/stdc++.h> using namespace std; static const int buf_size = 4096; vector<vector<int>> tree; void initialize(int N){ tree.assign(N, vector<int>(N, -1)); } int hasEdge(int u, int v){ int c = min(count(tree[v].begin(), tree[v].end(), -1), count(tree[u].begin(), tree[u].end(), -1)); cout << c << endl; if(c > 2){ tree[u][v] = 0; tree[v][u] = 0; return 0; } else{ tree[u][v] = 1; tree[v][u] = 1; return 1; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...