Submission #398346

#TimeUsernameProblemLanguageResultExecution timeMemory
398346kevinxiehkGame (IOI14_game)C++17
100 / 100
432 ms16360 KiB
#include <game.h>
int count[1505],target[1505],n;
void initialize(int N) {
  // TODO: implementation
  n=N;
  for(int i=0;i<N;i++)count[i]=0;
}
int max(int a,int b){
    if(a>b)return a;
    return b;
}
int hasEdge(int u, int v) {
  // TODO: implementation
  count[max(u,v)]++;
  if(count[max(u,v)]==max(u,v))return 1;
  return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...