# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
413370 | Antekb | 게임 (IOI14_game) | C++14 | 1084 ms | 2608 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;
const int N=1505;
vector<int> E[N];
int n;
void initialize(int _n){
n=_n;
for(int i=0; i<n; i++){
for(int j=0; j<i; j++){
E[i].push_back(j);
E[j].push_back(i);
}
}
}
int d[N];
bool bfs(int s){
vector<int> V={s};
d[s]=1;
for(int i=0; i<V.size(); i++){
int v=V[i];
for(int u:E[v]){
if(!d[u]){
d[u]=d[v]+1;
V.push_back(u);
}
}
}
for(int i:V)d[i]=0;
return (V.size()==n);
}
int hasEdge(int u, int v) {
for(int &j:E[u])if(j==v)swap(j, E[u].back());
for(int &j:E[v])if(j==u)swap(j, E[v].back());
E[u].pop_back();
E[v].pop_back();
if(bfs(u)){
return 0;
}
E[u].push_back(v);
E[v].push_back(u);
return 1;
}
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... |