# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
924513 | tosivanmak | Game (IOI14_game) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#ifdef __cplusplus
extern "C" {
#endif
void initialize(int n);
int hasEdge(int u, int v);
#ifdef __cplusplus
}
#endif
// TODO: global variables can be declared here
ll cnt[1505];
ll cancut,outn;
ll cutedges=0;
void initialize(int n) {
// TODO: implementation
for(int i=0;i<1500;i++){
cnt[i]=0;
}
cancut=n*(n-1)/2-(n-1);
outn=n;
}
int hasEdge(int u, int v) {
// TODO: implementation
cnt[u]++,cnt[v]++;
if(cutedges>=cancut){
return 1;
}
if(cnt[u]==outn or cnt[v]==outn){
return 1;
}
return 0;
}