답안 #993439

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
993439	2024-06-05T16:06:10 Z	Newtonabc	슈퍼트리 잇기 (IOI20_supertrees)	C++14	21 / 100	140 ms	22100 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=0;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==1) return 0;
	build(answer);
	return 1;
}

Subtask #1
11.0 / 11.0

#	결과	실행 시간	메모리	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	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	5 ms	1116 KB	Output is correct
7	Correct	116 ms	22044 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	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	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	5 ms	1116 KB	Output is correct
7	Correct	116 ms	22044 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	5 ms	1116 KB	Output is correct
13	Correct	115 ms	22048 KB	Output is correct
14	Correct	0 ms	344 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	12068 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	39 ms	5676 KB	Output is correct
21	Correct	117 ms	22096 KB	Output is correct
22	Correct	128 ms	22100 KB	Output is correct
23	Correct	123 ms	22096 KB	Output is correct
24	Correct	124 ms	22096 KB	Output is correct
25	Correct	52 ms	12116 KB	Output is correct
26	Correct	50 ms	12112 KB	Output is correct
27	Correct	121 ms	22096 KB	Output is correct
28	Correct	117 ms	22020 KB	Output is correct

Subtask #3
0 / 19.0

#	결과	실행 시간	메모리	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	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	5 ms	1340 KB	Output is correct
9	Correct	140 ms	22096 KB	Output is correct
10	Incorrect	1 ms	348 KB	Too many ways to get from 0 to 3, should be 2 found no less than 3
11	Halted	0 ms	0 KB	-

Subtask #4
0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	29 ms	5788 KB	Output is correct
5	Correct	122 ms	22096 KB	Output is correct
6	Correct	116 ms	22100 KB	Output is correct
7	Correct	127 ms	22048 KB	Output is correct
8	Incorrect	0 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

#	결과	실행 시간	메모리	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	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	5 ms	1116 KB	Output is correct
7	Correct	116 ms	22044 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	5 ms	1116 KB	Output is correct
13	Correct	115 ms	22048 KB	Output is correct
14	Correct	0 ms	344 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	12068 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	39 ms	5676 KB	Output is correct
21	Correct	117 ms	22096 KB	Output is correct
22	Correct	128 ms	22100 KB	Output is correct
23	Correct	123 ms	22096 KB	Output is correct
24	Correct	124 ms	22096 KB	Output is correct
25	Correct	52 ms	12116 KB	Output is correct
26	Correct	50 ms	12112 KB	Output is correct
27	Correct	121 ms	22096 KB	Output is correct
28	Correct	117 ms	22020 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	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	5 ms	1340 KB	Output is correct
37	Correct	140 ms	22096 KB	Output is correct
38	Incorrect	1 ms	348 KB	Too many ways to get from 0 to 3, should be 2 found no less than 3
39	Halted	0 ms	0 KB	-

Subtask #6
0 / 4.0

#	결과	실행 시간	메모리	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	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	5 ms	1116 KB	Output is correct
7	Correct	116 ms	22044 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	5 ms	1116 KB	Output is correct
13	Correct	115 ms	22048 KB	Output is correct
14	Correct	0 ms	344 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	12068 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	39 ms	5676 KB	Output is correct
21	Correct	117 ms	22096 KB	Output is correct
22	Correct	128 ms	22100 KB	Output is correct
23	Correct	123 ms	22096 KB	Output is correct
24	Correct	124 ms	22096 KB	Output is correct
25	Correct	52 ms	12116 KB	Output is correct
26	Correct	50 ms	12112 KB	Output is correct
27	Correct	121 ms	22096 KB	Output is correct
28	Correct	117 ms	22020 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	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	5 ms	1340 KB	Output is correct
37	Correct	140 ms	22096 KB	Output is correct
38	Incorrect	1 ms	348 KB	Too many ways to get from 0 to 3, should be 2 found no less than 3
39	Halted	0 ms	0 KB	-

답안 #993439

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