| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1289185 | muhammad-mutahir | Game (IOI14_game) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
#include "game.h"
void initialize(int ki){
n = ki;
map<int,int>cnt;
}
int hasEdge(int u,int v){
if(u>v)swap(u,v);
cnt[u]++;
cnt[v]++;
// int path = findcnt(u,v);
if(cnt[u] == n-1 or cnt[v] == n-1){
return 1;
}
else{
return 0;
}
}
