Submission #977679

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
977679	2024-05-08T09:07:35 Z	SmuggingSpun	Connecting Supertrees (IOI20_supertrees)	C++14	21 / 100	176 ms	18260 KB

supertrees

#include "supertrees.h"
#include<bits/stdc++.h>
using namespace std;
int construct(vector<vector<int>>p){
	int n = p.size();
	bool is_sub1 = true, is_sub2 = true;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			if(p[i][j] != 1){
				is_sub1 = false;
				i = n;
				break;
			}
			if(p[i][j] > 1){
				is_sub2 = false;
				i = n;
				break;
			}
		}
	}
	if(is_sub1){
		p = vector<vector<int>>(n, vector<int>(n, 0));
		for(int i = 1; i < n; i++){
			p[i][i - 1] = p[i - 1][i] = 1;
		}
		build(p);
		return 1;
	}
	if(is_sub2){
		vector<int>par(n);
		iota(par.begin(), par.end(), 0);
		function<int(int)>find_set;
		find_set = [&] (int n){
			return n == par[n] ? n : par[n] = find_set(par[n]);	
		};
		function<void(int, int)>merge = [&] (int a, int b){
			par[find_set(a)] = find_set(b);
		};
		vector<bool>vis(n, false);
		vector<vector<int>>edge(n);
		for(int i = 0; i < n; i++){
			if(vis[i]){
				for(int j = 0; j < n; j++){
					if(i != j && int(find_set(i) == find_set(j)) != p[i][j]){
						return 0;
					}
				}
				continue;
			}
			for(int j = 0; j < n; j++){
				if(i != j && p[i][j] == 0 && find_set(i) == find_set(j)){
					return 0;
				}
				if(p[i][j] == 1){
					merge(i, j);
					vis[j] = true;
				}
			}
		}
		for(int i = 0; i < n; i++){
			edge[find_set(i)].emplace_back(i);
		}
		p = vector<vector<int>>(n, vector<int>(n, 0));
		for(int i = 0; i < n; i++){
			for(int j = 1; j < edge[i].size(); j++){
				p[edge[i][j]][edge[i][j - 1]] = p[edge[i][j - 1]][edge[i][j]] = 1;
			}
		}
		build(p);
		return 1;
	}
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:65:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |    for(int j = 1; j < edge[i].size(); j++){
      |                   ~~^~~~~~~~~~~~~~~~
supertrees.cpp:72:1: warning: control reaches end of non-void function [-Wreturn-type]
   72 | }
      | ^

Subtask #1
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	7 ms	1116 KB	Output is correct
7	Correct	158 ms	18196 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	7 ms	1116 KB	Output is correct
7	Correct	158 ms	18196 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	7 ms	1116 KB	Output is correct
13	Correct	154 ms	18204 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	4 ms	604 KB	Output is correct
17	Correct	67 ms	8200 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	48 ms	4744 KB	Output is correct
21	Correct	162 ms	18260 KB	Output is correct
22	Correct	159 ms	18200 KB	Output is correct
23	Correct	170 ms	18096 KB	Output is correct
24	Correct	164 ms	18072 KB	Output is correct
25	Correct	68 ms	8272 KB	Output is correct
26	Correct	58 ms	8196 KB	Output is correct
27	Correct	176 ms	18256 KB	Output is correct
28	Correct	160 ms	18160 KB	Output is correct

Subtask #3
0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	360 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Incorrect	0 ms	348 KB	Answer gives possible 1 while actual possible 0
5	Halted	0 ms	0 KB	-

Subtask #4
0 / 35.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Incorrect	348 KB	Too few ways to get from 0 to 1, should be 2 found 0
3	Halted	0 KB	-

Subtask #5
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	7 ms	1116 KB	Output is correct
7	Correct	158 ms	18196 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	7 ms	1116 KB	Output is correct
13	Correct	154 ms	18204 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	4 ms	604 KB	Output is correct
17	Correct	67 ms	8200 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	48 ms	4744 KB	Output is correct
21	Correct	162 ms	18260 KB	Output is correct
22	Correct	159 ms	18200 KB	Output is correct
23	Correct	170 ms	18096 KB	Output is correct
24	Correct	164 ms	18072 KB	Output is correct
25	Correct	68 ms	8272 KB	Output is correct
26	Correct	58 ms	8196 KB	Output is correct
27	Correct	176 ms	18256 KB	Output is correct
28	Correct	160 ms	18160 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	360 KB	Output is correct
31	Correct	1 ms	344 KB	Output is correct
32	Incorrect	0 ms	348 KB	Answer gives possible 1 while actual possible 0
33	Halted	0 ms	0 KB	-

Subtask #6
0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	7 ms	1116 KB	Output is correct
7	Correct	158 ms	18196 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	7 ms	1116 KB	Output is correct
13	Correct	154 ms	18204 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	4 ms	604 KB	Output is correct
17	Correct	67 ms	8200 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	48 ms	4744 KB	Output is correct
21	Correct	162 ms	18260 KB	Output is correct
22	Correct	159 ms	18200 KB	Output is correct
23	Correct	170 ms	18096 KB	Output is correct
24	Correct	164 ms	18072 KB	Output is correct
25	Correct	68 ms	8272 KB	Output is correct
26	Correct	58 ms	8196 KB	Output is correct
27	Correct	176 ms	18256 KB	Output is correct
28	Correct	160 ms	18160 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	360 KB	Output is correct
31	Correct	1 ms	344 KB	Output is correct
32	Incorrect	0 ms	348 KB	Answer gives possible 1 while actual possible 0
33	Halted	0 ms	0 KB	-

Submission #977679

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