Submission #370908

#TimeUsernameProblemLanguageResultExecution timeMemory
370908FystyGame (IOI14_game)C++17
100 / 100
406 ms14572 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll,ll> pll; #define rep(i,n) for(int i=0;i<n;i++) #define rep1(i,n) for(int i=1;i<=n;i++) #define F first #define S second #define pb push_back int cnt[1505]; void initialize(int n){} int hasEdge(int u,int v) { if(u<v) swap(u,v); cnt[u]++; if(cnt[u]==u) return 1; else return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...