Submission #1006501

#TimeUsernameProblemLanguageResultExecution timeMemory
1006501christinelynnGame (IOI14_game)C++17
0 / 100
1 ms348 KiB
#include<bits/stdc++.h>
using namespace std;
int freq[2000] ={0};
int N;
int hasEdge(int u,int v){

  freq[u]++;
  freq[v]++;
  return (freq[u] == N-1 || freq[v] == N-1);
  
}

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

       

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