제출 #18698

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
18698	2016-02-14 06:36:07	mindol	게임 (IOI14_game)	C++14	15 / 100	3 ms	19128 KiB

game

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<set>
int n;
std::set<int> s[1500];
int e[1500][1500];
void initialize(int N)
{
    n=N;
    for(int i=0;i<N;i++)
        for(int j=0;j<N;j++)
            if(i!=j) s[i].insert(j);
}
int hasEdge(int a,int b)
{
    if(s[a].find(b)==s[a].end()) return e[a][b];
    s[a].erase(b); s[b].erase(a);
    while(s[a].size()==1)
    {
        int next=*s[a].begin();
        e[a][next]=e[next][a]=1;
        s[a].erase(next); s[next].erase(a);
        a=next;
    }
    while(s[b].size()==1)
    {
        int next=*s[b].begin();
        e[b][next]=e[next][b]=1;
        s[b].erase(next); s[next].erase(b);
        b=next;
    }
    return 0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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