Submission #992518

#TimeUsernameProblemLanguageResultExecution timeMemory
992518AlfraganusGame (IOI14_game)C++17
0 / 100
4 ms740 KiB
#include "game.h" #include <bits/stdc++.h> using namespace std; vector<bitset<1500>> friends(1500); int N; void initialize(int n) { N = n; for(int i = 0; i < 1500; i ++) for(int j = 0; j < 1500; j ++) friends[i][j] = 0; for(int i = 0; i < n; i ++) for(int j = 0; j < n; j ++) friends[i][j] = 1; } int hasEdge(int u, int v) { friends[u][v] = 0; friends[v][u] = 0; bitset<1500> res = friends[u] & friends[v]; if(res.count()) return 0; friends[u][v] = 1; friends[v][u] = 1; return 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...