| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 579711 | MrDeboo | 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 "game.h"
#include <bits/stdc++.h>
using namespace std;
int n;
vector<int>vct[1500];
void initialize(int N){
n=N;
for(int i=0;i<n;i++){
for(int w=0;w<n;w++){
if(i==w)continue;
vct[i].push_back(w);
vct[w].push_back(i);
}
}
}
vector<int>exception(vector<int>v,int a){
vector<int>vec;
for(auto &i:v)if(i!=a)vec.push_back(i);
return vec;
}
int hasEdge(int u, int v) {
deque<int>dq={u};
vector<bool>vis(n);
vis[u]=1;
bool bl=0;
while(dq.size()){
int a=dq.front();
dq.pop_front();
if(a==v){bl=1;break;}
for(auto &i:vct[a]){
if(!((a==u&&i==v)||vis[i])){
vis[i]=1;
dq.push_back(i);
}
}
}
if(bl){
vct[u]=exception(vct[u],v);
vct[v]=exception(vct[v],u);
}
return bl;
}