Submission #1006506

#TimeUsernameProblemLanguageResultExecution timeMemory
1006506kebineGame (IOI14_game)C++17
100 / 100
181 ms8788 KiB
#include<bits/stdc++.h>
using namespace std;
int freq[2000] ={0};
int N;
int hasEdge(int u,int v){
  freq[max(u,v)]++;
  return freq[max(u,v)] == max(u,v);
  
  
}

void initialize(int n){
  N = n;
}

       

             
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...