# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
385928 | victoriad | Game (IOI14_game) | C++14 | 2 ms | 492 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 <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <utility>
#include <queue>
#include <map>
#include <iomanip>
#include <stack>
#include <fstream>
using namespace std;
vector<vector<int> >g;
void initialize(int n) {
vector<int>c;
for(int i=0;i<n;i++){
c.push_back(i);
}
for(int i=0;i<n;i++){
g[i]=c;
}
}
void dfs(int nodo,vector<bool>v){
v[nodo]=true;
for(int con:g[nodo]){
if(!v[con]){
dfs(con,v);
}
}
}
int hasEdge(int u, int v) {
vector<int>a;
vector<int>b;
vector<int>gu=g[u];
vector<int>gv=g[v];
for(int i=0;i<g[u].size();i++){
if(g[u][i]!=v){
a.push_back(g[u][i]);
}
}
for(int i=0;i<g[v].size();i++){
if(g[v][i]!=u){
a.push_back(g[v][i]);
}
}
vector<bool>visitados(g.size(),false);
g[u]=a;
g[v]=b;
bool p=true;
dfs(0,visitados);
for(int i=0;i<g.size();i++){
if(!visitados[i]){
p=false;
break;
}
}
if(p){
return 1;
}
else{
g[u]=gu;
g[v]=gv;
return 0;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |