제출 #246948

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
246948		oscarsierra12	게임 (IOI14_game)	C++14	15 / 100	6 ms	444 KiB

game

#include "game.h"
#include <iostream>
#include <stdio.h>
#include <fstream>
#include <string.h>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <set>
#include <deque>
#include <utility>
#include <sstream>
#include <queue>
#include <stack>
#include <bitset>
#include <math.h>
#include <algorithm>
#include <limits.h>
using namespace std ;

const int N = 1502 ;

int degree[N] ;
set <int> pr[N] ;
int comp, father[N] ;

int fnd ( int x ) {
    if ( father[x] == x ) return x ;
    return father[x] = x ;
}
void uni ( int x, int y ) {
    int fx = fnd ( x ), fy = fnd ( y ) ;
    if ( fx==fy ) return ;
    father[fx] = fy ;
    comp-- ;
}
void initialize(int n) {
    comp = n ;
    for ( int i = 0 ; i < n ; ++i ) degree[i] = n-1, father[i] = i  ;
    for ( int i = 0 ; i < n ; ++i ) {
        for ( int j = 0 ; j < n ; ++j )
            if ( j!=i ) pr[i].insert ( j );
    }
}

int hasEdge(int u, int v) {
    int ans = 0 ;
    if ( comp == 2 ) return 0 ;
    if ( min(degree[u], degree[v]) <= 1 ) ans = 1, uni(u,v);
    degree[u]-- ; degree[v]-- ;
    pr[u].erase ( v ) ;
    pr[v].erase ( u ) ;
    if ( degree[u] == 1 ) degree[*pr[u].begin()]-- ;
    if ( degree[v] == 1 ) degree[*pr[v].begin()]-- ;
    return ans;
}

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