Submission #504884

#TimeUsernameProblemLanguageResultExecution timeMemory
504884amukkalirGame (IOI14_game)C++17
0 / 100
1 ms368 KiB
#include "game.h" #include <bits/stdc++.h> using namespace std; const int nax = 1500; int n; set<int> rem[nax+5]; void initialize(int N) { n = N; for(int i=0; i<n; i++) { for(int j=0; j<n; j++) { if(i!=j) rem[i].insert(j); } } } void err() { while(true){} } int hasEdge(int u, int v) { if(rem[u].count(v) == false) err(); if(rem[v].count(u) == false) err(); rem[u].erase(v); rem[v].erase(u); return rem[u].empty() || rem[v].empty(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...