제출 #131268

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
131268		Blagojce	게임 (IOI14_game)	C++11	0 / 100	2 ms	376 KiB

game

#include <bits/stdc++.h>
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define pb push_back
#define st first
#define nd second
#define pq priority_queue
#define all(x) begin(x),end(x)
#define what_is(x) cout<<#x<<' '<<x<<endl

#include "game.h"

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
ll const inf = 1e9;
ll const mod = 1e9 + 7;
ld const eps = 1e-9;

int link1[2000];
int SIZE1[2000];

int link2[2000];
int SIZE2[2000];
int A, B;
int findx1(int x){
        while(x != link1[x]) x = link1[x];
        return x;
}
bool same1(int a, int b){
        return findx1(a) == findx1(b);
}
void unite1(int a, int b){
        A --;
        a = findx1(a);
        b = findx1(b);
        if(SIZE1[a] < SIZE1[b]) swap(a, b);
        SIZE1[a] += SIZE1[b];
        link1[a] = b;
}

int findx2(int x){
        while(x != link2[x]) x = link2[x];
        return x;
}
bool same2(int a, int b){
        return findx2(a) == findx2(b);
}
void unite2(int a, int b){
        B --;
        a = findx2(a);
        b = findx2(b);
        if(SIZE2[a] < SIZE2[b]) swap(a, b);
        SIZE2[a] += SIZE2[b];
        link2[a] = b;
}

int deg[2000];

void initialize(int n) {
        fr(i, 0, n) deg[i] = n;
}
int hasEdge(int u, int v) {
        if(deg[u] > 1 && deg[v] > 1){
                deg[u] --;
                deg[v] --;
                return 0;
        }
        else return 1;
}/*
int main(){
        int n = 4;
        initialize(n);
        fr(i, 0, n * (n - 1) / 2){
                int a, b;
                cin >> a >> b;
                cout << hasEdge(a, b) << endl;
        }

}
*/

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