답안 #300464

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
300464	2020-09-17T07:35:02 Z	mohammad	슈퍼트리 잇기 (IOI20_supertrees)	C++14	40 / 100	293 ms	22520 KB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll ;

int root[1020] , de[1020] , use[1020] , r[1020];

ll find(int u){
	if(root[u] == u) return u;
	return root[u] = find(root[u]);
}

int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>> answer(n , vector<int>(n , 0));
	for(int i = 0 ; i < n ; ++i){
		if(p[i][i] != 1) return 0 ;
		root[i] = i ; 
	}
	for(int i = 0 ; i < n; ++i)
		for(int j = 0 ; j < n; ++j){
			if(p[i][j] == 2 || p[i][j] == 0) r[i]++ ;
			if(!p[i][j]) continue ;
			root[find(i)] = find(j);
		}
	for(int i = 0 ; i < n ; ++i) {
		if(r[i] == n - 1) de[i] = 1;
		else de[i] = 0 ;
		find(i);
	}
	set<int> s[1020][3];
	for(int i = 0 ; i < n; ++i)
		for(int j = i + 1 ; j < n; ++j){
			if(p[i][j] == 0 && root[i] == root[j]) return 0 ;
			else if(p[i][j]){
				s[root[i]][de[i]].insert(i);
				s[root[i]][de[j]].insert(j);
			}
		}
	for(int i = 0 ; i < n; ++i){
		if(use[root[i]]) continue;
		use[root[i]] = 1;
		int ls = -1;
		if(!s[root[i]][1].size()){
			for(auto j : s[root[i]][0]){
				if(ls != -1){
					answer[ls][j] = 1;answer[j][ls] = 1;
				}else ls = j ;
			}
		}else if(!s[root[i]][0].size()){
			if(s[root[i]][1].size() <= 2) return 0;
			auto it = s[root[i]][1].begin();
			auto it1 = s[root[i]][1].begin(); it1++;
			auto it2 = s[root[i]][1].begin(); it2++;it2++;
			answer[*it][*it1] = 1;answer[*it1][*it] = 1;
			for(; it2 != s[root[i]][1].end(); it2++ , it1++){
				answer[*it2][*it1] = 1;answer[*it1][*it2] = 1;
			}
			answer[*it][*it1] = 1;answer[*it1][*it] = 1;
		}else{
			// if(s[root[i]][1].size() <= 1) return 0;
			for(auto j : s[root[i]][0]){
				if(ls != -1){
					answer[ls][j] = 1;answer[j][ls] = 1;
				}else ls = j ;
			}
			int it = ls;
			auto it1 = s[root[i]][1].begin();
			auto it2 = s[root[i]][1].begin(); it2++;
			answer[it][*it1] = 1;answer[*it1][it] = 1;
			for(; it2 != s[root[i]][1].end(); it2++ , it1++){
				answer[*it2][*it1] = 1;answer[*it1][*it2] = 1;
			}
			answer[it][*it1] = 1;answer[*it1][it] = 1;
		}
	}
	build(answer);
	return 1;
}

Subtask #1
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	512 KB	Output is correct
2	Correct	1 ms	512 KB	Output is correct
3	Correct	1 ms	512 KB	Output is correct
4	Correct	1 ms	512 KB	Output is correct
5	Correct	1 ms	512 KB	Output is correct
6	Correct	13 ms	1536 KB	Output is correct
7	Correct	285 ms	22360 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	512 KB	Output is correct
2	Correct	1 ms	512 KB	Output is correct
3	Correct	1 ms	512 KB	Output is correct
4	Correct	1 ms	512 KB	Output is correct
5	Correct	1 ms	512 KB	Output is correct
6	Correct	13 ms	1536 KB	Output is correct
7	Correct	285 ms	22360 KB	Output is correct
8	Correct	1 ms	512 KB	Output is correct
9	Correct	1 ms	512 KB	Output is correct
10	Correct	1 ms	512 KB	Output is correct
11	Correct	1 ms	512 KB	Output is correct
12	Correct	10 ms	1536 KB	Output is correct
13	Correct	235 ms	22264 KB	Output is correct
14	Correct	1 ms	512 KB	Output is correct
15	Correct	1 ms	512 KB	Output is correct
16	Correct	7 ms	896 KB	Output is correct
17	Correct	131 ms	12536 KB	Output is correct
18	Correct	1 ms	512 KB	Output is correct
19	Correct	1 ms	512 KB	Output is correct
20	Correct	61 ms	6008 KB	Output is correct
21	Correct	247 ms	22264 KB	Output is correct
22	Correct	253 ms	22264 KB	Output is correct
23	Correct	282 ms	22276 KB	Output is correct
24	Correct	239 ms	22392 KB	Output is correct
25	Correct	103 ms	12380 KB	Output is correct
26	Correct	99 ms	12280 KB	Output is correct
27	Correct	273 ms	22392 KB	Output is correct
28	Correct	244 ms	22264 KB	Output is correct

Subtask #3
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	512 KB	Output is correct
2	Correct	1 ms	512 KB	Output is correct
3	Correct	1 ms	512 KB	Output is correct
4	Correct	1 ms	512 KB	Output is correct
5	Correct	1 ms	512 KB	Output is correct
6	Correct	1 ms	512 KB	Output is correct
7	Correct	1 ms	512 KB	Output is correct
8	Correct	10 ms	1408 KB	Output is correct
9	Correct	243 ms	22264 KB	Output is correct
10	Correct	1 ms	512 KB	Output is correct
11	Correct	1 ms	512 KB	Output is correct
12	Correct	14 ms	1408 KB	Output is correct
13	Correct	293 ms	22392 KB	Output is correct
14	Correct	1 ms	512 KB	Output is correct
15	Correct	1 ms	512 KB	Output is correct
16	Correct	5 ms	896 KB	Output is correct
17	Correct	121 ms	12408 KB	Output is correct
18	Correct	1 ms	512 KB	Output is correct
19	Correct	1 ms	512 KB	Output is correct
20	Correct	1 ms	512 KB	Output is correct
21	Correct	63 ms	6008 KB	Output is correct
22	Correct	247 ms	22392 KB	Output is correct
23	Correct	243 ms	22264 KB	Output is correct
24	Correct	278 ms	22264 KB	Output is correct
25	Correct	100 ms	12280 KB	Output is correct
26	Correct	110 ms	12408 KB	Output is correct
27	Correct	244 ms	22264 KB	Output is correct
28	Correct	289 ms	22264 KB	Output is correct
29	Correct	102 ms	12536 KB	Output is correct

Subtask #4
0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	512 KB	Output is correct
2	Correct	1 ms	512 KB	Output is correct
3	Correct	1 ms	512 KB	Output is correct
4	Correct	61 ms	6008 KB	Output is correct
5	Correct	248 ms	22520 KB	Output is correct
6	Correct	241 ms	22392 KB	Output is correct
7	Correct	276 ms	22392 KB	Output is correct
8	Correct	1 ms	640 KB	Output is correct
9	Correct	61 ms	6136 KB	Output is correct
10	Correct	247 ms	22360 KB	Output is correct
11	Correct	239 ms	22264 KB	Output is correct
12	Correct	289 ms	22392 KB	Output is correct
13	Correct	1 ms	512 KB	Output is correct
14	Correct	1 ms	512 KB	Output is correct
15	Correct	1 ms	512 KB	Output is correct
16	Incorrect	67 ms	6008 KB	Too few ways to get from 0 to 24, should be 2 found 1
17	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	512 KB	Output is correct
2	Correct	1 ms	512 KB	Output is correct
3	Correct	1 ms	512 KB	Output is correct
4	Correct	1 ms	512 KB	Output is correct
5	Correct	1 ms	512 KB	Output is correct
6	Correct	13 ms	1536 KB	Output is correct
7	Correct	285 ms	22360 KB	Output is correct
8	Correct	1 ms	512 KB	Output is correct
9	Correct	1 ms	512 KB	Output is correct
10	Correct	1 ms	512 KB	Output is correct
11	Correct	1 ms	512 KB	Output is correct
12	Correct	10 ms	1536 KB	Output is correct
13	Correct	235 ms	22264 KB	Output is correct
14	Correct	1 ms	512 KB	Output is correct
15	Correct	1 ms	512 KB	Output is correct
16	Correct	7 ms	896 KB	Output is correct
17	Correct	131 ms	12536 KB	Output is correct
18	Correct	1 ms	512 KB	Output is correct
19	Correct	1 ms	512 KB	Output is correct
20	Correct	61 ms	6008 KB	Output is correct
21	Correct	247 ms	22264 KB	Output is correct
22	Correct	253 ms	22264 KB	Output is correct
23	Correct	282 ms	22276 KB	Output is correct
24	Correct	239 ms	22392 KB	Output is correct
25	Correct	103 ms	12380 KB	Output is correct
26	Correct	99 ms	12280 KB	Output is correct
27	Correct	273 ms	22392 KB	Output is correct
28	Correct	244 ms	22264 KB	Output is correct
29	Correct	1 ms	512 KB	Output is correct
30	Correct	1 ms	512 KB	Output is correct
31	Correct	1 ms	512 KB	Output is correct
32	Correct	1 ms	512 KB	Output is correct
33	Correct	1 ms	512 KB	Output is correct
34	Correct	1 ms	512 KB	Output is correct
35	Correct	1 ms	512 KB	Output is correct
36	Correct	10 ms	1408 KB	Output is correct
37	Correct	243 ms	22264 KB	Output is correct
38	Correct	1 ms	512 KB	Output is correct
39	Correct	1 ms	512 KB	Output is correct
40	Correct	14 ms	1408 KB	Output is correct
41	Correct	293 ms	22392 KB	Output is correct
42	Correct	1 ms	512 KB	Output is correct
43	Correct	1 ms	512 KB	Output is correct
44	Correct	5 ms	896 KB	Output is correct
45	Correct	121 ms	12408 KB	Output is correct
46	Correct	1 ms	512 KB	Output is correct
47	Correct	1 ms	512 KB	Output is correct
48	Correct	1 ms	512 KB	Output is correct
49	Correct	63 ms	6008 KB	Output is correct
50	Correct	247 ms	22392 KB	Output is correct
51	Correct	243 ms	22264 KB	Output is correct
52	Correct	278 ms	22264 KB	Output is correct
53	Correct	100 ms	12280 KB	Output is correct
54	Correct	110 ms	12408 KB	Output is correct
55	Correct	244 ms	22264 KB	Output is correct
56	Correct	289 ms	22264 KB	Output is correct
57	Correct	102 ms	12536 KB	Output is correct
58	Correct	1 ms	512 KB	Output is correct
59	Correct	1 ms	512 KB	Output is correct
60	Correct	6 ms	896 KB	Output is correct
61	Correct	126 ms	12408 KB	Output is correct
62	Correct	1 ms	512 KB	Output is correct
63	Correct	1 ms	512 KB	Output is correct
64	Correct	1 ms	512 KB	Output is correct
65	Incorrect	75 ms	6008 KB	Too few ways to get from 1 to 11, should be 2 found 1
66	Halted	0 ms	0 KB	-

Subtask #6
0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	512 KB	Output is correct
2	Correct	1 ms	512 KB	Output is correct
3	Correct	1 ms	512 KB	Output is correct
4	Correct	1 ms	512 KB	Output is correct
5	Correct	1 ms	512 KB	Output is correct
6	Correct	13 ms	1536 KB	Output is correct
7	Correct	285 ms	22360 KB	Output is correct
8	Correct	1 ms	512 KB	Output is correct
9	Correct	1 ms	512 KB	Output is correct
10	Correct	1 ms	512 KB	Output is correct
11	Correct	1 ms	512 KB	Output is correct
12	Correct	10 ms	1536 KB	Output is correct
13	Correct	235 ms	22264 KB	Output is correct
14	Correct	1 ms	512 KB	Output is correct
15	Correct	1 ms	512 KB	Output is correct
16	Correct	7 ms	896 KB	Output is correct
17	Correct	131 ms	12536 KB	Output is correct
18	Correct	1 ms	512 KB	Output is correct
19	Correct	1 ms	512 KB	Output is correct
20	Correct	61 ms	6008 KB	Output is correct
21	Correct	247 ms	22264 KB	Output is correct
22	Correct	253 ms	22264 KB	Output is correct
23	Correct	282 ms	22276 KB	Output is correct
24	Correct	239 ms	22392 KB	Output is correct
25	Correct	103 ms	12380 KB	Output is correct
26	Correct	99 ms	12280 KB	Output is correct
27	Correct	273 ms	22392 KB	Output is correct
28	Correct	244 ms	22264 KB	Output is correct
29	Correct	1 ms	512 KB	Output is correct
30	Correct	1 ms	512 KB	Output is correct
31	Correct	1 ms	512 KB	Output is correct
32	Correct	1 ms	512 KB	Output is correct
33	Correct	1 ms	512 KB	Output is correct
34	Correct	1 ms	512 KB	Output is correct
35	Correct	1 ms	512 KB	Output is correct
36	Correct	10 ms	1408 KB	Output is correct
37	Correct	243 ms	22264 KB	Output is correct
38	Correct	1 ms	512 KB	Output is correct
39	Correct	1 ms	512 KB	Output is correct
40	Correct	14 ms	1408 KB	Output is correct
41	Correct	293 ms	22392 KB	Output is correct
42	Correct	1 ms	512 KB	Output is correct
43	Correct	1 ms	512 KB	Output is correct
44	Correct	5 ms	896 KB	Output is correct
45	Correct	121 ms	12408 KB	Output is correct
46	Correct	1 ms	512 KB	Output is correct
47	Correct	1 ms	512 KB	Output is correct
48	Correct	1 ms	512 KB	Output is correct
49	Correct	63 ms	6008 KB	Output is correct
50	Correct	247 ms	22392 KB	Output is correct
51	Correct	243 ms	22264 KB	Output is correct
52	Correct	278 ms	22264 KB	Output is correct
53	Correct	100 ms	12280 KB	Output is correct
54	Correct	110 ms	12408 KB	Output is correct
55	Correct	244 ms	22264 KB	Output is correct
56	Correct	289 ms	22264 KB	Output is correct
57	Correct	102 ms	12536 KB	Output is correct
58	Correct	1 ms	512 KB	Output is correct
59	Correct	1 ms	512 KB	Output is correct
60	Correct	1 ms	512 KB	Output is correct
61	Correct	61 ms	6008 KB	Output is correct
62	Correct	248 ms	22520 KB	Output is correct
63	Correct	241 ms	22392 KB	Output is correct
64	Correct	276 ms	22392 KB	Output is correct
65	Correct	1 ms	640 KB	Output is correct
66	Correct	61 ms	6136 KB	Output is correct
67	Correct	247 ms	22360 KB	Output is correct
68	Correct	239 ms	22264 KB	Output is correct
69	Correct	289 ms	22392 KB	Output is correct
70	Correct	1 ms	512 KB	Output is correct
71	Correct	1 ms	512 KB	Output is correct
72	Correct	1 ms	512 KB	Output is correct
73	Incorrect	67 ms	6008 KB	Too few ways to get from 0 to 24, should be 2 found 1
74	Halted	0 ms	0 KB	-

답안 #300464

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 10.0 / 10.0

Subtask #3 19.0 / 19.0

Subtask #4 0 / 35.0

Subtask #5 0 / 21.0

Subtask #6 0 / 4.0

Subtask #1
11.0 / 11.0

Subtask #2
10.0 / 10.0

Subtask #3
19.0 / 19.0

Subtask #4
0 / 35.0

Subtask #5
0 / 21.0

Subtask #6
0 / 4.0