제출 #204622

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
204622		awlintqaa	게임 (IOI14_game)	C++14	42 / 100	1082 ms	12920 KiB

game

#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;
set<int>s[1509];
int done[1509];
void dfs(int node){
        done[node]=1;
        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);
        mem(done,0);
        dfs(0);
        int z=0;
        for(int i=0;i<n;i++){
                if(done[i]==0){
                        z=1;
                        break;
                }
        }
        if(z){
                s[v].ins(u);
                s[u].ins(v);
                return 1;
        }
        return 0;
}

• Subtask 1: 15 / 15
• Subtask 2: 27 / 27
• Subtask 3: 0 / 58