답안 #59831 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
59831	2018-07-23T07:42:07 Z	hamzqq9	게임 (IOI14_game)	C++14	15 / 100	19 ms	10532 KB

game

#include "game.h"
#include<bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define sz(x) x.size()
using namespace std;

#define N 1505

set< pair<int,int> > edge_set[N];

int ata[N],rem[N],n;

int bul(int node) {

	if(ata[node]==node) return node;

	return ata[node]=bul(ata[node]);

}

int ok[N][N];

void initialize(int n) {

	::n=n;

	for(int i=0;i<n;i++) {

		edge_set[i].clear();

		for(int j=0;j<n;j++) {

			if(j==i) continue ;

			edge_set[i].insert({min(i,j),max(i,j)});

		}

		ata[i]=i;
	
	}

	memset(ok,0,sizeof(ok));

}

void finish(int au) {

	int node1=edge_set[au].begin()->st;
	int node2=edge_set[au].begin()->nd;

	ok[node1][node2]=ok[node2][node1]=1;

	edge_set[bul(node1)].erase(edge_set[bul(node1)].find({min(node1,node2),max(node1,node2)}));
	edge_set[bul(node2)].erase(edge_set[bul(node2)].find({min(node1,node2),max(node1,node2)}));

	int anode1=bul(node1);
	int anode2=bul(node2);

	if(sz(edge_set[anode1])<sz(edge_set[anode2])) swap(anode1,anode2);

	ata[anode2]=anode1;

	if(sz(edge_set[bul(node1)])==1) {

		finish(bul(node1));

	}

}

bool flag=false;

int hasEdge(int u, int v) {

	if(flag) printf("ok[u][v]-->%d\n",ok[u][v]);

	if(ok[u][v]) return 1;

	int au=bul(u);
	int av=bul(v);

	if(flag) printf("au-->%d av-->%d\n",au,av);

	edge_set[au].erase(edge_set[au].find({min(u,v),max(u,v)}));
	edge_set[av].erase(edge_set[av].find({min(u,v),max(u,v)}));

	if(sz(edge_set[au])==1) {

		if(flag) printf("au-->%d\n",au);

		finish(au); 

	}

	if(sz(edge_set[av])==1) {

		if(flag) printf("av-->%d\n",av);

		finish(av);

	}
	
	return 0;
	
}
/*
#include <cstdio>
#include <cassert>
#include "game.h"

int read_int() {
    int x;
    assert(scanf("%d", &x) == 1);
    return x;
}

int bab[N];

int fin(int node) {

	if(bab[node]==node) return node;

	return bab[node]=fin(bab[node]);

}

void bug(vector< pair<int,int> > ed,int n) {

	flag=1;

	initialize(n);

	for(auto x:ed) {

		printf("%d %d\n",x.st,x.nd);

		printf("%d\n",hasEdge(x.st,x.nd));

	}

}

int main() {

    int n, u, v;
    n = 4;

    vector< pair<int,int> > ed;

    for(int i=0;i<4;i++) {

    	for(int j=0;j<i;j++) {

    		ed.push_back(mp(i,j));

    	}

    }

    int tot=0;

    do {

    	int comp=4;

    	for(int i=0;i<n;i++) bab[i]=i;

		initialize(n);
		for (int i = 0; i < n * (n - 1) / 2; i++) {
		    u = ed[i].st;
		    v = ed[i].nd;
		  //  printf("%d %d ",u,v);

		    int res=hasEdge(u,v);

		    if(res) {

		    	int bu=fin(u);
		    	int bv=fin(v);

		    	if(bu!=bv) {

		    		bab[bu]=bv;

		    		comp--;

		    	}

		    }

		    if(comp==1 && i<n*(n-1)/2-1) {

		    	bug(ed,n);

		    	return 0;

		    } 

		}

		if(comp>1) {

			bug(ed,n);

			return 0;

		}

	} while(next_permutation(ed.begin(),ed.end()));

    return 0;
}
*/

Subtask #1
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	9208 KB	Output is correct
2	Correct	10 ms	9444 KB	Output is correct
3	Correct	10 ms	9444 KB	Output is correct
4	Correct	9 ms	9444 KB	Output is correct
5	Correct	9 ms	9444 KB	Output is correct
6	Correct	11 ms	9444 KB	Output is correct
7	Correct	9 ms	9444 KB	Output is correct
8	Correct	10 ms	9444 KB	Output is correct
9	Correct	10 ms	9444 KB	Output is correct
10	Correct	12 ms	9444 KB	Output is correct
11	Correct	10 ms	9444 KB	Output is correct
12	Correct	12 ms	9452 KB	Output is correct
13	Correct	12 ms	9508 KB	Output is correct
14	Correct	10 ms	9512 KB	Output is correct
15	Correct	9 ms	9540 KB	Output is correct
16	Correct	11 ms	9540 KB	Output is correct
17	Correct	11 ms	9540 KB	Output is correct
18	Correct	11 ms	9540 KB	Output is correct
19	Correct	12 ms	9540 KB	Output is correct
20	Correct	12 ms	9540 KB	Output is correct
21	Correct	9 ms	9540 KB	Output is correct
22	Correct	9 ms	9540 KB	Output is correct
23	Correct	10 ms	9540 KB	Output is correct
24	Correct	13 ms	9540 KB	Output is correct

Subtask #2
0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	11 ms	9540 KB	Output is correct
2	Correct	12 ms	9540 KB	Output is correct
3	Correct	10 ms	9540 KB	Output is correct
4	Correct	11 ms	9540 KB	Output is correct
5	Correct	10 ms	9540 KB	Output is correct
6	Correct	10 ms	9540 KB	Output is correct
7	Correct	12 ms	9540 KB	Output is correct
8	Correct	11 ms	9540 KB	Output is correct
9	Correct	10 ms	9540 KB	Output is correct
10	Correct	12 ms	9540 KB	Output is correct
11	Correct	11 ms	9540 KB	Output is correct
12	Correct	11 ms	9540 KB	Output is correct
13	Correct	12 ms	9540 KB	Output is correct
14	Correct	11 ms	9540 KB	Output is correct
15	Correct	12 ms	9544 KB	Output is correct
16	Correct	10 ms	9624 KB	Output is correct
17	Correct	11 ms	9624 KB	Output is correct
18	Correct	12 ms	9624 KB	Output is correct
19	Correct	12 ms	9624 KB	Output is correct
20	Correct	8 ms	9692 KB	Output is correct
21	Correct	10 ms	9692 KB	Output is correct
22	Correct	12 ms	9692 KB	Output is correct
23	Correct	13 ms	9696 KB	Output is correct
24	Correct	12 ms	9696 KB	Output is correct
25	Correct	14 ms	9740 KB	Output is correct
26	Correct	11 ms	9752 KB	Output is correct
27	Correct	12 ms	9752 KB	Output is correct
28	Correct	10 ms	9752 KB	Output is correct
29	Correct	10 ms	9752 KB	Output is correct
30	Correct	10 ms	9760 KB	Output is correct
31	Correct	13 ms	9764 KB	Output is correct
32	Correct	16 ms	9768 KB	Output is correct
33	Correct	14 ms	9772 KB	Output is correct
34	Correct	17 ms	9992 KB	Output is correct
35	Correct	16 ms	10100 KB	Output is correct
36	Correct	16 ms	10100 KB	Output is correct
37	Correct	18 ms	10124 KB	Output is correct
38	Correct	15 ms	10160 KB	Output is correct
39	Correct	14 ms	10180 KB	Output is correct
40	Correct	18 ms	10280 KB	Output is correct
41	Correct	18 ms	10348 KB	Output is correct
42	Incorrect	19 ms	10348 KB	Output isn't correct
43	Halted	0 ms	0 KB	-

Subtask #3
0 / 58.0

#	결과	실행 시간	메모리	Grader output
1	Correct	11 ms	10348 KB	Output is correct
2	Correct	10 ms	10348 KB	Output is correct
3	Correct	10 ms	10348 KB	Output is correct
4	Correct	12 ms	10348 KB	Output is correct
5	Correct	11 ms	10348 KB	Output is correct
6	Correct	14 ms	10348 KB	Output is correct
7	Correct	12 ms	10348 KB	Output is correct
8	Correct	12 ms	10348 KB	Output is correct
9	Correct	13 ms	10348 KB	Output is correct
10	Correct	11 ms	10348 KB	Output is correct
11	Correct	13 ms	10348 KB	Output is correct
12	Correct	11 ms	10348 KB	Output is correct
13	Correct	11 ms	10348 KB	Output is correct
14	Correct	11 ms	10348 KB	Output is correct
15	Correct	11 ms	10348 KB	Output is correct
16	Correct	13 ms	10348 KB	Output is correct
17	Correct	13 ms	10348 KB	Output is correct
18	Correct	10 ms	10348 KB	Output is correct
19	Correct	9 ms	10348 KB	Output is correct
20	Correct	10 ms	10348 KB	Output is correct
21	Correct	11 ms	10348 KB	Output is correct
22	Correct	12 ms	10348 KB	Output is correct
23	Correct	11 ms	10348 KB	Output is correct
24	Correct	12 ms	10348 KB	Output is correct
25	Correct	12 ms	10348 KB	Output is correct
26	Correct	12 ms	10348 KB	Output is correct
27	Correct	17 ms	10348 KB	Output is correct
28	Correct	12 ms	10348 KB	Output is correct
29	Correct	12 ms	10348 KB	Output is correct
30	Correct	11 ms	10348 KB	Output is correct
31	Correct	11 ms	10348 KB	Output is correct
32	Correct	12 ms	10348 KB	Output is correct
33	Correct	10 ms	10348 KB	Output is correct
34	Correct	14 ms	10380 KB	Output is correct
35	Correct	14 ms	10412 KB	Output is correct
36	Correct	14 ms	10480 KB	Output is correct
37	Correct	13 ms	10488 KB	Output is correct
38	Correct	14 ms	10488 KB	Output is correct
39	Correct	19 ms	10492 KB	Output is correct
40	Correct	16 ms	10512 KB	Output is correct
41	Correct	14 ms	10532 KB	Output is correct
42	Incorrect	16 ms	10532 KB	Output isn't correct
43	Halted	0 ms	0 KB	-

답안 #59831

Compilation message

Subtask #1 15.0 / 15.0

Subtask #2 0 / 27.0

Subtask #3 0 / 58.0

Subtask #1
15.0 / 15.0

Subtask #2
0 / 27.0

Subtask #3
0 / 58.0