답안 #807338

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
807338	2023-08-04T16:08:38 Z	nemethm	슈퍼트리 잇기 (IOI20_supertrees)	C++17	21 / 100	144 ms	24004 KB

supertrees

#include "supertrees.h"
#include <vector>

using namespace std;

int cmp[1010] = {0};

int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	std::vector<std::vector<int>> answer;
	for (int i = 0; i < n; i++) {
		std::vector<int> row;
		row.resize(n);
		answer.push_back(row);
	}
	int id = 0;
	vector<vector<pair<int,int>>> elek;
	for(int i = 0; i < n; ++i){
		bool uj = false;
		if(cmp[i] == 0){
			++id;
			cmp[i] = id;
			uj = true;
			elek.push_back({});
		}
		for(int j = 0; j < n; ++j){
			if(j == i) continue;
			if(p[i][j] == 1){
				if(cmp[j] != cmp[i] && !uj){
					return 0;
				}
				else if(uj){
					cmp[j] = cmp[i];
					elek.back().push_back({j, i});
				}
			}
			else{
				if(cmp[j] == cmp[i]){
					return 0;
				}
			}
		}
	}
	for(auto& v : elek){
		for(auto i : v){
			answer[i.first][i.second] = answer[i.second][i.first] = 1;
		}
	}
	build(answer);
	return 1;
}

Subtask #1

11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	6 ms	1092 KB	Output is correct
7	Correct	144 ms	22020 KB	Output is correct

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	6 ms	1092 KB	Output is correct
7	Correct	144 ms	22020 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	6 ms	1108 KB	Output is correct
13	Correct	136 ms	21952 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	3 ms	724 KB	Output is correct
17	Correct	62 ms	12028 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	35 ms	6172 KB	Output is correct
21	Correct	141 ms	23976 KB	Output is correct
22	Correct	144 ms	24004 KB	Output is correct
23	Correct	142 ms	23916 KB	Output is correct
24	Correct	136 ms	23952 KB	Output is correct
25	Correct	60 ms	14028 KB	Output is correct
26	Correct	59 ms	14056 KB	Output is correct
27	Correct	144 ms	23912 KB	Output is correct
28	Correct	134 ms	23980 KB	Output is correct

Subtask #3

0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Incorrect	0 ms	212 KB	Answer gives possible 1 while actual possible 0
5	Halted	0 ms	0 KB	-

Subtask #4

0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Incorrect	0 ms	212 KB	Too few ways to get from 0 to 1, should be 2 found 0
3	Halted	0 ms	0 KB	-

Subtask #5

0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	6 ms	1092 KB	Output is correct
7	Correct	144 ms	22020 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	6 ms	1108 KB	Output is correct
13	Correct	136 ms	21952 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	3 ms	724 KB	Output is correct
17	Correct	62 ms	12028 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	35 ms	6172 KB	Output is correct
21	Correct	141 ms	23976 KB	Output is correct
22	Correct	144 ms	24004 KB	Output is correct
23	Correct	142 ms	23916 KB	Output is correct
24	Correct	136 ms	23952 KB	Output is correct
25	Correct	60 ms	14028 KB	Output is correct
26	Correct	59 ms	14056 KB	Output is correct
27	Correct	144 ms	23912 KB	Output is correct
28	Correct	134 ms	23980 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Incorrect	0 ms	212 KB	Answer gives possible 1 while actual possible 0
33	Halted	0 ms	0 KB	-

Subtask #6

0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	6 ms	1092 KB	Output is correct
7	Correct	144 ms	22020 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	6 ms	1108 KB	Output is correct
13	Correct	136 ms	21952 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	3 ms	724 KB	Output is correct
17	Correct	62 ms	12028 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	35 ms	6172 KB	Output is correct
21	Correct	141 ms	23976 KB	Output is correct
22	Correct	144 ms	24004 KB	Output is correct
23	Correct	142 ms	23916 KB	Output is correct
24	Correct	136 ms	23952 KB	Output is correct
25	Correct	60 ms	14028 KB	Output is correct
26	Correct	59 ms	14056 KB	Output is correct
27	Correct	144 ms	23912 KB	Output is correct
28	Correct	134 ms	23980 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Incorrect	0 ms	212 KB	Answer gives possible 1 while actual possible 0
33	Halted	0 ms	0 KB	-