답안 #777044

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
777044	2023-07-08T14:29:41 Z	YassirSalama	슈퍼트리 잇기 (IOI20_supertrees)	C++14	21 / 100	177 ms	22028 KB

supertrees

#include "supertrees.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
const int MAXN=1100;
int par[MAXN];
void make_set(){
	for(int i=0;i<MAXN;i++) par[i]=i;
}
int find(int node){
	if(node==par[node]) return node;
	return par[node]=find(par[node]);
}
void merge(int a,int b){
	par[find(a)]=b;
}
int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>> answer(n,vector<int>(n,0));
	make_set();
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(answer[i][j]) continue;
			if(find(i)==find(j)) {
				if(p[i][j]==0) return 0;
				answer[i][j]=answer[j][i]=0;
			}
			else{
				if(p[i][j]==0) continue;
				merge(i,j);
				answer[i][j]=answer[j][i]=1;
			}
		}
	}
	build(answer);
	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	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	6 ms	1108 KB	Output is correct
7	Correct	147 ms	22024 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	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	6 ms	1108 KB	Output is correct
7	Correct	147 ms	22024 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 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	142 ms	22024 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	720 KB	Output is correct
17	Correct	63 ms	12036 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	37 ms	5712 KB	Output is correct
21	Correct	177 ms	21964 KB	Output is correct
22	Correct	148 ms	22024 KB	Output is correct
23	Correct	152 ms	22028 KB	Output is correct
24	Correct	153 ms	22012 KB	Output is correct
25	Correct	64 ms	12036 KB	Output is correct
26	Correct	70 ms	12052 KB	Output is correct
27	Correct	159 ms	21964 KB	Output is correct
28	Correct	149 ms	21964 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	1 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 1
3	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	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	6 ms	1108 KB	Output is correct
7	Correct	147 ms	22024 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 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	142 ms	22024 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	720 KB	Output is correct
17	Correct	63 ms	12036 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	37 ms	5712 KB	Output is correct
21	Correct	177 ms	21964 KB	Output is correct
22	Correct	148 ms	22024 KB	Output is correct
23	Correct	152 ms	22028 KB	Output is correct
24	Correct	153 ms	22012 KB	Output is correct
25	Correct	64 ms	12036 KB	Output is correct
26	Correct	70 ms	12052 KB	Output is correct
27	Correct	159 ms	21964 KB	Output is correct
28	Correct	149 ms	21964 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	1 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	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	6 ms	1108 KB	Output is correct
7	Correct	147 ms	22024 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 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	142 ms	22024 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	720 KB	Output is correct
17	Correct	63 ms	12036 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	37 ms	5712 KB	Output is correct
21	Correct	177 ms	21964 KB	Output is correct
22	Correct	148 ms	22024 KB	Output is correct
23	Correct	152 ms	22028 KB	Output is correct
24	Correct	153 ms	22012 KB	Output is correct
25	Correct	64 ms	12036 KB	Output is correct
26	Correct	70 ms	12052 KB	Output is correct
27	Correct	159 ms	21964 KB	Output is correct
28	Correct	149 ms	21964 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	1 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	-