제출 #428328

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
428328		Rouge_Hugo	게임 (IOI14_game)	C++14	0 / 100	1 ms	204 KiB

game

#include<bits/stdc++.h>
#include "game.h"
#define ll long long
#define fi first
#define se second
#define pb push_back
using namespace std;
int n;
const int N=100;
int pa[N],sz[N],vis[N][N];
vector<int>v[N];
void merge(int x,int y)
{
    if(sz[x]<sz[y])swap(x,y);
    for(auto it:v[y])
    {
        pa[it]=x;
        v[x].pb(it);
        sz[x]++;
    }
    v[y].clear();
}
void initialize(int N) {
    n=N;
    for(int i=0;i<n;i++)
    {
        v[i].pb(i);
        pa[i]=i;
        sz[i]=1;
    }

}

int hasEdge(int x, int y) {
    if(pa[x]==pa[y])return 1;
    int xx=x,yy=y;
    x=pa[x];y=pa[y];int r=0,rr=0;
    for(auto it:v[x])
    {
        for(int i=0;i<n;i++)
        {
            int u=pa[i];
            if(u==x)continue;
            if(vis[it][i])continue;
            if(i==yy)continue;
            r=1;break;
        }
    }
    for(auto it:v[y])
    {
        for(int i=0;i<n;i++)
        {
            int u=pa[i];
            if(u==y)continue;
            if(vis[it][i])continue;
            if(i==xx)continue;
            rr=1;
        }
    }
    if(r>0&&rr>0)
    {
        vis[xx][yy]=1;
        vis[yy][xx]=1;
        return 0;
    }

    merge(x,y);
    return 1;
}
/*
4
0 1
0 2
0 3
3 1
1 2
3 2
*/

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