This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 200
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1e9+7;
const ll inf= 4e18;
const ld pai=acos(-1);
#include "game.h"
int n,NUM;
set<int>s[1509];
int done[1509];
void dfs(int node){
done[node]=NUM;
for(auto u:s[node]){
if(done[u])C;
dfs(u);
}
}
void initialize(int N){
n=N;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if( i == j )C;
s[i].ins(j);
}
}
}
int hasEdge(int u, int v) {
s[v].era(u);
s[u].era(v);
NUM++;
dfs(0);
int z=0;
for(int i=0;i<n;i++){
if(done[i]!=NUM){
z=1;
break;
}
}
if(z){
s[v].ins(u);
s[u].ins(v);
return 1;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |