답안 #771561

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
771561	2023-07-03T06:27:43 Z	khshg	슈퍼트리 잇기 (IOI20_supertrees)	C++14	21 / 100	234 ms	22096 KB

supertrees

#include"supertrees.h"
#include<bits/stdc++.h>
using namespace std;

int N;
vector<vector<int>> P, ans, D;
vector<int> par;

int parent(int x) {
	return (par[x] == x ? x : par[x] = parent(par[x]));
}

int unite(int x, int y) {
	x = parent(x);
	y = parent(y);
	if(x == y) return 1;
	if((int)D[x].size() < (int)D[y].size()) swap(x, y);
	for(auto& u : D[x]) for(auto& v : D[y]) {
		if(P[u][v] != 1) return 0;
	}
	for(auto& u : D[y]) D[x].emplace_back(u);
	par[y] = x;
	return 1;
}

int construct(vector<vector<int>> _p) {
	swap(P, _p);
	N = (int)P.size();
	D.resize(N);
	par.resize(N); iota(begin(par), end(par), 0);
	for(int i = 0; i < N; ++i) D[i].push_back(i);
	for(int i = 0; i < N; ++i) {
		for(int j = i + 1; j < N; ++j) {
			if(P[i][j] == 1) {
				if(!unite(i, j)) {
					return 0;
				}
			}
		}
	}
	vector<int> comps;
	{
		set<int> s;
		for(int i = 0; i < N; ++i) {
			s.insert(parent(i));
		}
		comps = vector<int>(begin(s), end(s));
	}
	ans = vector<vector<int>>(N, vector<int>(N, 0));
	for(auto& u : comps) {
		for(int i = 0; i < (int)D[u].size(); ++i) {
			if(D[u][i] == u) swap(D[u][i], D[u][0]);
		}
		for(int i = 1; i < (int)D[u].size(); ++i) {
			ans[u][D[u][i]] = 1;
			ans[D[u][i]][u] = 1;
		}
	}
	for(int i = 0; i < N; ++i) {
		vector<int> ids = {i};
		for(int j = i + 1; j < N; ++j) {
			if(P[i][j] == 2) {
				ids.push_back(j);
			}
		}
		if((int)ids.size() == 1) continue;
		{
			set<int> s;
			for(auto& u : ids) {
				s.insert(parent(u));
			}
			ids = vector<int>(begin(s), end(s));
		}
		ans[ids[0]][ids.back()] = 1;
		ans[ids.back()][ids[0]] = 1;
		for(int i = 1; i < (int)ids.size(); ++i) {
			ans[ids[i]][ids[i - 1]] = 1;
			ans[ids[i - 1]][ids[i]] = 1;
		}
	}
	build(ans);
	return 1;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	216 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	7 ms	1188 KB	Output is correct
7	Correct	234 ms	22020 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	7 ms	1108 KB	Output is correct
13	Correct	178 ms	22024 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	3 ms	596 KB	Output is correct
17	Correct	66 ms	8196 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	40 ms	5764 KB	Output is correct
21	Correct	203 ms	22016 KB	Output is correct
22	Correct	160 ms	22012 KB	Output is correct
23	Correct	169 ms	22040 KB	Output is correct
24	Correct	211 ms	22092 KB	Output is correct
25	Correct	62 ms	8192 KB	Output is correct
26	Correct	62 ms	8200 KB	Output is correct
27	Correct	166 ms	22056 KB	Output is correct
28	Correct	180 ms	22096 KB	Output is correct

Subtask #3
0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 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	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	40 ms	5716 KB	Output is correct
5	Correct	159 ms	22092 KB	Output is correct
6	Correct	162 ms	22092 KB	Output is correct
7	Correct	166 ms	22040 KB	Output is correct
8	Incorrect	0 ms	212 KB	Too many ways to get from 0 to 3, should be 2 found no less than 3
9	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	216 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	7 ms	1188 KB	Output is correct
7	Correct	234 ms	22020 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	7 ms	1108 KB	Output is correct
13	Correct	178 ms	22024 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	3 ms	596 KB	Output is correct
17	Correct	66 ms	8196 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	40 ms	5764 KB	Output is correct
21	Correct	203 ms	22016 KB	Output is correct
22	Correct	160 ms	22012 KB	Output is correct
23	Correct	169 ms	22040 KB	Output is correct
24	Correct	211 ms	22092 KB	Output is correct
25	Correct	62 ms	8192 KB	Output is correct
26	Correct	62 ms	8200 KB	Output is correct
27	Correct	166 ms	22056 KB	Output is correct
28	Correct	180 ms	22096 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 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	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	216 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	7 ms	1188 KB	Output is correct
7	Correct	234 ms	22020 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	7 ms	1108 KB	Output is correct
13	Correct	178 ms	22024 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	3 ms	596 KB	Output is correct
17	Correct	66 ms	8196 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	40 ms	5764 KB	Output is correct
21	Correct	203 ms	22016 KB	Output is correct
22	Correct	160 ms	22012 KB	Output is correct
23	Correct	169 ms	22040 KB	Output is correct
24	Correct	211 ms	22092 KB	Output is correct
25	Correct	62 ms	8192 KB	Output is correct
26	Correct	62 ms	8200 KB	Output is correct
27	Correct	166 ms	22056 KB	Output is correct
28	Correct	180 ms	22096 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 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	-

답안 #771561

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 10.0 / 10.0

Subtask #3 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
0 / 19.0

Subtask #4
0 / 35.0

Subtask #5
0 / 21.0

Subtask #6
0 / 4.0