Submission #993436

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
993436	2024-06-05T16:00:43 Z	Newtonabc	Connecting Supertrees (IOI20_supertrees)	C++14	21 / 100	166 ms	24152 KB

supertrees

#include "supertrees.h"
#include<bits/stdc++.h>
using namespace std;
const int N=1e3+10;
int pa[N];
bool cy[N][N];
int root(int x){
	if(pa[x]==x) return x;
	else return pa[x]=root(pa[x]);
}
int construct(vector<vector<int> > p) {
	int n = p.size();
	vector<vector<int> > answer;
	for (int i = 0; i < n; i++) {
		vector<int> row(n,0);
		answer.push_back(row);
	}
	for(int i=0;i<n;i++) pa[i]=i;
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(p[i][j]==1 && root(i)!=root(j)){
				answer[i][j]=1;
				answer[j][i]=1;
				pa[root(i)]=root(j);
			}
			if(p[i][j]==3) return 0;
		}
	}
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(p[i][j]==0){
				if(root(i)==root(j)) return 0;
			}
		}
	}
	int cnt=0;
	for(int i=0;i<n;i++){
		for(int j=i+1;j<n;j++){
			int a,b;
			if(p[i][j]==2){
				a=root(i),b=root(j);
				if(a==b) return 0;
				if(answer[a][b]==0) cnt++;
				answer[a][b]=1;
				answer[b][a]=1;
			}
		}
	}
	if(cnt==2) return 0;
	build(answer);
	return 1;
}

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	0 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	6 ms	1372 KB	Output is correct
7	Correct	124 ms	24148 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	0 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	6 ms	1372 KB	Output is correct
7	Correct	124 ms	24148 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 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	6 ms	1380 KB	Output is correct
13	Correct	116 ms	23948 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	3 ms	860 KB	Output is correct
17	Correct	64 ms	14092 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	33 ms	6232 KB	Output is correct
21	Correct	124 ms	23940 KB	Output is correct
22	Correct	127 ms	24080 KB	Output is correct
23	Correct	141 ms	24148 KB	Output is correct
24	Correct	123 ms	24152 KB	Output is correct
25	Correct	58 ms	14168 KB	Output is correct
26	Correct	51 ms	14224 KB	Output is correct
27	Correct	124 ms	24144 KB	Output is correct
28	Correct	119 ms	24148 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	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Incorrect	1 ms	348 KB	Answer gives possible 1 while actual possible 0
5	Halted	0 ms	0 KB	-

Subtask #4

0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	31 ms	6288 KB	Output is correct
5	Correct	166 ms	23980 KB	Output is correct
6	Correct	120 ms	24144 KB	Output is correct
7	Correct	126 ms	24144 KB	Output is correct
8	Incorrect	1 ms	348 KB	Too many ways to get from 0 to 2, should be 2 found no less than 3
9	Halted	0 ms	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	0 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	6 ms	1372 KB	Output is correct
7	Correct	124 ms	24148 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 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	6 ms	1380 KB	Output is correct
13	Correct	116 ms	23948 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	3 ms	860 KB	Output is correct
17	Correct	64 ms	14092 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	33 ms	6232 KB	Output is correct
21	Correct	124 ms	23940 KB	Output is correct
22	Correct	127 ms	24080 KB	Output is correct
23	Correct	141 ms	24148 KB	Output is correct
24	Correct	123 ms	24152 KB	Output is correct
25	Correct	58 ms	14168 KB	Output is correct
26	Correct	51 ms	14224 KB	Output is correct
27	Correct	124 ms	24144 KB	Output is correct
28	Correct	119 ms	24148 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Incorrect	1 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	0 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	6 ms	1372 KB	Output is correct
7	Correct	124 ms	24148 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 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	6 ms	1380 KB	Output is correct
13	Correct	116 ms	23948 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	3 ms	860 KB	Output is correct
17	Correct	64 ms	14092 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	33 ms	6232 KB	Output is correct
21	Correct	124 ms	23940 KB	Output is correct
22	Correct	127 ms	24080 KB	Output is correct
23	Correct	141 ms	24148 KB	Output is correct
24	Correct	123 ms	24152 KB	Output is correct
25	Correct	58 ms	14168 KB	Output is correct
26	Correct	51 ms	14224 KB	Output is correct
27	Correct	124 ms	24144 KB	Output is correct
28	Correct	119 ms	24148 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Incorrect	1 ms	348 KB	Answer gives possible 1 while actual possible 0
33	Halted	0 ms	0 KB	-