답안 #456145

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
456145	2021-08-06T07:13:55 Z	BT21tata	슈퍼트리 잇기 (IOI20_supertrees)	C++17	21 / 100	450 ms	22024 KB

supertrees

#include "supertrees.h"
#include<bits/stdc++.h>

using namespace std;

bool used[1005];

int construct(vector<vector<int>> p)
{
	int n = p.size(), mx=0;
	bool f=1;
	vector<vector<int>> ans;
	ans.resize(n);
	for (int i = 0; i < n; i++)
	{
		ans[i].resize(n);
		for(int j=0; j<n; j++)
			mx=max(mx, p[i][j]);
	}
	if(mx==2)
		for(int i=0; i<n; i++)
			p[i][i]=2;
	vector<int>v;
	for(int i=0; i<n; i++)
	{
		if(!used[i])
		{
			v.clear();
			for(int j=0; j<n; j++)
				if(p[i][j])
				{
					if(p[i]==p[j]) v.push_back(j);
					else f=0;
				}
			for(int j=0; j<(int)v.size()-1; j++)
				ans[v[j]][v[j+1]]=ans[v[j+1]][v[j]]=1;
			if(mx==2) ans[v[0]][v[v.size()-1]]=ans[v[v.size()-1]][v[0]]=1;
		}
	}
	if(!f) return 0;
	build(ans);
	return 1;
}

Subtask #1

11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	16 ms	1168 KB	Output is correct
7	Correct	450 ms	21988 KB	Output is correct

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	16 ms	1168 KB	Output is correct
7	Correct	450 ms	21988 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	28 ms	1076 KB	Output is correct
13	Correct	320 ms	22016 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	5 ms	716 KB	Output is correct
17	Correct	119 ms	12120 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	109 ms	5744 KB	Output is correct
21	Correct	247 ms	21980 KB	Output is correct
22	Correct	237 ms	21936 KB	Output is correct
23	Correct	383 ms	22020 KB	Output is correct
24	Correct	238 ms	21932 KB	Output is correct
25	Correct	131 ms	12024 KB	Output is correct
26	Correct	100 ms	12028 KB	Output is correct
27	Correct	343 ms	22024 KB	Output is correct
28	Correct	249 ms	21988 KB	Output is correct

Subtask #3

0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Incorrect	1 ms	204 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	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	71 ms	5752 KB	Output is correct
5	Correct	256 ms	22008 KB	Output is correct
6	Correct	247 ms	22008 KB	Output is correct
7	Correct	364 ms	22020 KB	Output is correct
8	Incorrect	0 ms	204 KB	b[4][4] is not 0
9	Halted	0 ms	0 KB	-

Subtask #5

0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	16 ms	1168 KB	Output is correct
7	Correct	450 ms	21988 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	28 ms	1076 KB	Output is correct
13	Correct	320 ms	22016 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	5 ms	716 KB	Output is correct
17	Correct	119 ms	12120 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	109 ms	5744 KB	Output is correct
21	Correct	247 ms	21980 KB	Output is correct
22	Correct	237 ms	21936 KB	Output is correct
23	Correct	383 ms	22020 KB	Output is correct
24	Correct	238 ms	21932 KB	Output is correct
25	Correct	131 ms	12024 KB	Output is correct
26	Correct	100 ms	12028 KB	Output is correct
27	Correct	343 ms	22024 KB	Output is correct
28	Correct	249 ms	21988 KB	Output is correct
29	Correct	0 ms	204 KB	Output is correct
30	Correct	0 ms	204 KB	Output is correct
31	Correct	1 ms	204 KB	Output is correct
32	Incorrect	1 ms	204 KB	Answer gives possible 1 while actual possible 0
33	Halted	0 ms	0 KB	-

Subtask #6

0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	16 ms	1168 KB	Output is correct
7	Correct	450 ms	21988 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	28 ms	1076 KB	Output is correct
13	Correct	320 ms	22016 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	5 ms	716 KB	Output is correct
17	Correct	119 ms	12120 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	109 ms	5744 KB	Output is correct
21	Correct	247 ms	21980 KB	Output is correct
22	Correct	237 ms	21936 KB	Output is correct
23	Correct	383 ms	22020 KB	Output is correct
24	Correct	238 ms	21932 KB	Output is correct
25	Correct	131 ms	12024 KB	Output is correct
26	Correct	100 ms	12028 KB	Output is correct
27	Correct	343 ms	22024 KB	Output is correct
28	Correct	249 ms	21988 KB	Output is correct
29	Correct	0 ms	204 KB	Output is correct
30	Correct	0 ms	204 KB	Output is correct
31	Correct	1 ms	204 KB	Output is correct
32	Incorrect	1 ms	204 KB	Answer gives possible 1 while actual possible 0
33	Halted	0 ms	0 KB	-