Submission #1008632

#TimeUsernameProblemLanguageResultExecution timeMemory
1008632hotboy2703Game (IOI14_game)C++14
100 / 100
193 ms16216 KiB
#include "game.h" #include<bits/stdc++.h> using namespace std; using ll = int; #define pll pair <ll,ll> #define fi first #define se second #define MP make_pair #define sz(a) (ll((a).size())) #define BIT(mask,i) (((mask) >> (i))&1) #define MASK(i) (1LL << (i)) ll n; ll cnt[1510]; void initialize(int N) { n=N; } int hasEdge(int u, int v) { return ++cnt[max(u,v)] == max(u,v); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...