Submission #1116160

#TimeUsernameProblemLanguageResultExecution timeMemory
1116160vladiliusGame (IOI14_game)C++17
0 / 100
1 ms508 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; #define pb push_back #define ff first #define ss second vector<int> g; int n; int hasEdge(int u, int v){ g[u]++; g[v]++; return (g[u] == (n - 1) || g[v] == (n - 1)); } void initialize(int N){ n = N; g.resize(n); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...