Submission #660522

#TimeUsernameProblemLanguageResultExecution timeMemory
660522atigunGame (IOI14_game)C++11
0 / 100
0 ms212 KiB
#include<bits/stdc++.h>
#include"game.h"

using namespace std;
typedef long long ll;

void initialize(int n);
int hasEdge(int u, int v);
const int maxn = 1500;
int N;
vector<int> cnt(maxn+5, 0);

void initialize(int n){
  N = n;
  cnt.assign(N+5, 0);
}

int hasEdge(int u, int v){
  cnt[v]++;
  cnt[u]++;
  if(max(cnt[u], cnt[v]) == N-1)
    return 1;
  else if(cnt[v] == cnt[u] && cnt[v] == N-2)
    return 1;
  else
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...