Submission #568313

#TimeUsernameProblemLanguageResultExecution timeMemory
568313losmi247Game (IOI14_game)C++14
0 / 100
1 ms312 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1502;

int n;
int cnt = 0,kolko[N];

void initialize(int br){
    n = br;
    cnt = 0;
    for(int i = 0; i <= n; i++) kolko[i] = 0;
}

int hasEdge(int u,int v){
    u++;
    v++;
    cnt++;

    kolko[u]++;
    kolko[v]++;

    if(kolko[u] == n-1 || kolko[v] == n-1){
        return 1;
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...