답안 #915391

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
915391	2024-01-23T19:30:38 Z	chirathnirodha	슈퍼트리 잇기 (IOI20_supertrees)	C++17	21 / 100	158 ms	24404 KB

supertrees

#include "supertrees.h"
#include <vector>
using namespace std;
#define F first
#define S sedond
#define PB push_back
#define MP make_pair
#define	P push
#define I insert
typedef long long ll;
typedef long l;
typedef unsigned long long ull;

int uni[1000];
int fin(int x){
	if(uni[x]==x)return x;
	else return fin(uni[x]);
}
void merg(int x,int y){
	x=fin(x);
	y=fin(y);
	if(x<y)uni[y]=x;
	else uni[x]=y;
}
int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>>answer(n,vector<int>(n,0));
	for(int i=0;i<n;i++)uni[i]=i;
	for(int i=0;i<n;i++)for(int j=0;j<n;j++)if(p[i][j]==3)return 0;
	vector<int> v1[n],v2[n];
	for(int i=0;i<n;i++){
		for(int j=i+1;j<n;j++){
			if(p[i][j]==1 && fin(i)!=fin(j)){
				answer[i][j]=answer[j][i]=1;
				merg(i,j);
			}
		}
	}
	for(int i=0;i<n;i++)for(int j=i+1;j<n;j++)if(p[i][j]!=1 && fin(i)==fin(j))return 0;
	for(int i=0;i<n;i++){
		int comsiz=1;
		for(int j=i+1;j<n;j++){
			if(p[i][j]==2 && fin(i)!=fin(j)){
				answer[i][j]=answer[j][i]=1;
				merg(i,j);
				comsiz++;
			}
		}
		if(comsiz==2)return 0;
	}
	for(int i=0;i<n;i++)for(int j=i+1;j<n;j++)if(p[i][j]!=1 && fin(i)==fin(j))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	1 ms	348 KB	Output is correct
4	Correct	1 ms	676 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	6 ms	1172 KB	Output is correct
7	Correct	148 ms	23984 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	1 ms	348 KB	Output is correct
4	Correct	1 ms	676 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	6 ms	1172 KB	Output is correct
7	Correct	148 ms	23984 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	7 ms	1212 KB	Output is correct
13	Correct	153 ms	24404 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	928 KB	Output is correct
17	Correct	67 ms	14256 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	0 ms	344 KB	Output is correct
20	Correct	38 ms	6236 KB	Output is correct
21	Correct	154 ms	24332 KB	Output is correct
22	Correct	152 ms	23952 KB	Output is correct
23	Correct	152 ms	23920 KB	Output is correct
24	Correct	148 ms	23936 KB	Output is correct
25	Correct	64 ms	14208 KB	Output is correct
26	Correct	61 ms	14160 KB	Output is correct
27	Correct	158 ms	23940 KB	Output is correct
28	Correct	151 ms	24148 KB	Output is correct

Subtask #3
0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 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	Incorrect	1 ms	348 KB	Answer gives possible 0 while actual possible 1
6	Halted	0 ms	0 KB	-

Subtask #4
0 / 35.0

#	결과	메모리	Grader output
1	Correct	344 KB	Output is correct
2	Incorrect	348 KB	Answer gives possible 0 while actual possible 1
3	Halted	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	1 ms	348 KB	Output is correct
4	Correct	1 ms	676 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	6 ms	1172 KB	Output is correct
7	Correct	148 ms	23984 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	7 ms	1212 KB	Output is correct
13	Correct	153 ms	24404 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	928 KB	Output is correct
17	Correct	67 ms	14256 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	0 ms	344 KB	Output is correct
20	Correct	38 ms	6236 KB	Output is correct
21	Correct	154 ms	24332 KB	Output is correct
22	Correct	152 ms	23952 KB	Output is correct
23	Correct	152 ms	23920 KB	Output is correct
24	Correct	148 ms	23936 KB	Output is correct
25	Correct	64 ms	14208 KB	Output is correct
26	Correct	61 ms	14160 KB	Output is correct
27	Correct	158 ms	23940 KB	Output is correct
28	Correct	151 ms	24148 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	1 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	Incorrect	1 ms	348 KB	Answer gives possible 0 while actual possible 1
34	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	1 ms	348 KB	Output is correct
4	Correct	1 ms	676 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	6 ms	1172 KB	Output is correct
7	Correct	148 ms	23984 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	7 ms	1212 KB	Output is correct
13	Correct	153 ms	24404 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	928 KB	Output is correct
17	Correct	67 ms	14256 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	0 ms	344 KB	Output is correct
20	Correct	38 ms	6236 KB	Output is correct
21	Correct	154 ms	24332 KB	Output is correct
22	Correct	152 ms	23952 KB	Output is correct
23	Correct	152 ms	23920 KB	Output is correct
24	Correct	148 ms	23936 KB	Output is correct
25	Correct	64 ms	14208 KB	Output is correct
26	Correct	61 ms	14160 KB	Output is correct
27	Correct	158 ms	23940 KB	Output is correct
28	Correct	151 ms	24148 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	1 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	Incorrect	1 ms	348 KB	Answer gives possible 0 while actual possible 1
34	Halted	0 ms	0 KB	-

답안 #915391

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