Submission #1006902

#TimeUsernameProblemLanguageResultExecution timeMemory
1006902Khanhcsp2Game (IOI14_game)C++14
100 / 100
198 ms16216 KiB
#include<bits/stdc++.h> #define el '\n' #define fi first #define sc second //#define int ll #define pii pair<int, int> #define all(v) v.begin(), v.end() using namespace std; using ll=long long; using ull=unsigned long long; using ld=long double; const int mod=1e9+7; const int N=1e5+11; int mp[N]; void initialize(int n) { } int hasEdge(int u, int v) { u=max(u, v); mp[u]++; return (mp[u]==u); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...