답안 #1078788

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1078788	2024-08-28T06:17:14 Z	Muhammad_Aneeq	슈퍼트리 잇기 (IOI20_supertrees)	C++17	40 / 100	151 ms	23916 KB

supertrees

#include <vector>
#include <iostream>
using namespace std;
int const MAXN=1000;
void build(vector<vector<int>> b);
int construct(vector<vector<int>> p)
{
	int n=p.size();
	bool subt1=1,subt2=1,subt3=1,subt4=1;
	for (int i=0;i<n;i++)
	{
		for (int j=i+1;j<n;j++)
		{
			if (p[i][j]!=1)
				subt1=0;
			if (p[i][j]>1)
				subt2=0;
			if (p[i][j]==1)
				subt3=0;
			if (p[i][j]>2)
				subt4=0;
		}
	}
	if (subt1)
	{
		vector<vector<int>>b(n,vector<int>(n));
		for (int i=1;i<n;i++)
			b[0][i]=b[i][0]=1;
		build(b);
		return 1;
	}
	if (subt2)
	{
		bool vis[n]={};
		int head[n]={};
		vector<vector<int>>b(n,vector<int>(n));
		for (int i=0;i<n;i++)
		{
			if (!vis[i])
			{
				vis[i]=1;
				head[i]=i;
				for (int j=0;j<n;j++)
				{
					if (vis[j])
						continue;
					if (p[i][j])
					{
						vis[j]=1;
						b[i][j]=b[j][i]=1;
						head[j]=i;
					}
				}
			}
		}
		for (int i=0;i<n;i++)
		{
			for (int j=0;j<n;j++)
			{
				if (p[i][j]&&head[i]!=head[j])
					return 0;
				if (p[i][j]==0&&head[i]==head[j])
					return 0;
			}
		}
		build(b);
		return 1;
	}
	if (subt3)
	{
		bool vis[n]={};
		int head[n]={};
		vector<vector<int>>b(n,vector<int>(n));
		for (int i=0;i<n;i++)
		{
			if (!vis[i])
			{
				vector<int>z;
				for (int j=0;j<n;j++)
				{
					if (p[i][j])
						z.push_back(j);
				}
				if (z.size()==1)
				{
					head[i]=i;
					continue;
				}
				if (z.size()==2)
					return 0;
				for (int j=0;j<z.size();j++)
				{
					vis[z[j]]=1;
					head[z[j]]=i;
					b[z[j]][z[(j+1)%z.size()]]=b[z[(j+1)%z.size()]][z[j]]=1;
				}
			}
		}
		for (int i=0;i<n;i++)
		{
			for (int j=i+1;j<n;j++)
			{
				if (p[i][j]&&head[i]!=head[j])
					return 0;
				if (p[i][j]==0&&head[i]==head[j])
					return 0;
			}
		}
		build(b);
		return 1;
	}
	bool seen[n]={};
	int head[n]={};
	bool vis[n]={};
	vector<vector<int>>b(n,vector<int>(n,0));
	for (int i=0;i<n;i++)
	{
		if (!seen[i])
		{
			seen[i]=1;
			head[i]=i;
			for (int j=0;j<n;j++)
			{
				if (seen[j])
				{
					if (p[i][j])
						return 0;
					continue;
				}
				if (p[i][j]==1)
				{
					seen[j]=1;
					b[i][j]=b[j][i]=1;
					head[j]=i;
				}
			}
		}
	}
	for (int i=0;i<n;i++)
	{
		for (int j=0;j<n;j++)
		{
			if (p[i][j]==1&&head[i]!=head[j])
				return 0;
			if (p[i][j]==0&&head[i]==head[j])
				return 0;
		}
	}
	for (int i=0;i<n;i++)
	{
		if (vis[head[i]])
			continue;
		vector<int>x;
		for (int j=0;j<n;j++)
		{
			if (p[i][j]&&!vis[head[j]])
			{
				x.push_back(head[j]);
				vis[head[j]]=1;
			}
		}
		if (x.size()<1)
			continue;
		int pa=head[i];
		for (int  j=0;j<x.size();j++)
		{
			int u=x[j],v=x[(j+1)%x.size()];
			head[u]=head[v]=pa;
			b[u][v]=b[v][u]=1;
		}
	}
	for (int i=0;i<n;i++)
	{
		for (int j=0;j<n;j++)
		{
			int u=head[head[i]],v=head[head[j]];
			if (u==v)
				continue;
			if (p[i][j]!=2&&b[u][v])
				return 0;
			if (p[i][j]==2&&!b[u][v])
				return 0;
		}
	}
	build(b);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:91:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |     for (int j=0;j<z.size();j++)
      |                  ~^~~~~~~~~
supertrees.cpp:165:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  165 |   for (int  j=0;j<x.size();j++)
      |                 ~^~~~~~~~~
supertrees.cpp:9:31: warning: variable 'subt4' set but not used [-Wunused-but-set-variable]
    9 |  bool subt1=1,subt2=1,subt3=1,subt4=1;
      |                               ^~~~~

Subtask #1
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	5 ms	1372 KB	Output is correct
7	Correct	127 ms	23260 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	5 ms	1372 KB	Output is correct
7	Correct	127 ms	23260 KB	Output is correct
8	Correct	0 ms	600 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	600 KB	Output is correct
11	Correct	0 ms	432 KB	Output is correct
12	Correct	5 ms	1212 KB	Output is correct
13	Correct	123 ms	23432 KB	Output is correct
14	Correct	0 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	62 ms	13364 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	29 ms	6200 KB	Output is correct
21	Correct	126 ms	23460 KB	Output is correct
22	Correct	144 ms	23376 KB	Output is correct
23	Correct	135 ms	23160 KB	Output is correct
24	Correct	128 ms	23376 KB	Output is correct
25	Correct	60 ms	13396 KB	Output is correct
26	Correct	53 ms	13332 KB	Output is correct
27	Correct	127 ms	23376 KB	Output is correct
28	Correct	151 ms	23376 KB	Output is correct

Subtask #3
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 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	Correct	0 ms	344 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	432 KB	Output is correct
8	Correct	6 ms	1368 KB	Output is correct
9	Correct	120 ms	23380 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	1184 KB	Output is correct
13	Correct	129 ms	23380 KB	Output is correct
14	Correct	0 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	58 ms	13396 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	29 ms	6264 KB	Output is correct
22	Correct	128 ms	23376 KB	Output is correct
23	Correct	139 ms	23356 KB	Output is correct
24	Correct	127 ms	23604 KB	Output is correct
25	Correct	49 ms	13820 KB	Output is correct
26	Correct	53 ms	13924 KB	Output is correct
27	Correct	115 ms	23888 KB	Output is correct
28	Correct	130 ms	23780 KB	Output is correct
29	Correct	50 ms	13908 KB	Output is correct

Subtask #4
0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	436 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	31 ms	6228 KB	Output is correct
5	Correct	119 ms	23892 KB	Output is correct
6	Correct	121 ms	23892 KB	Output is correct
7	Correct	124 ms	23900 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	30 ms	6248 KB	Output is correct
10	Correct	115 ms	23888 KB	Output is correct
11	Correct	114 ms	23888 KB	Output is correct
12	Correct	129 ms	23916 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Incorrect	0 ms	348 KB	Answer gives possible 0 while actual possible 1
15	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	5 ms	1372 KB	Output is correct
7	Correct	127 ms	23260 KB	Output is correct
8	Correct	0 ms	600 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	600 KB	Output is correct
11	Correct	0 ms	432 KB	Output is correct
12	Correct	5 ms	1212 KB	Output is correct
13	Correct	123 ms	23432 KB	Output is correct
14	Correct	0 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	62 ms	13364 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	29 ms	6200 KB	Output is correct
21	Correct	126 ms	23460 KB	Output is correct
22	Correct	144 ms	23376 KB	Output is correct
23	Correct	135 ms	23160 KB	Output is correct
24	Correct	128 ms	23376 KB	Output is correct
25	Correct	60 ms	13396 KB	Output is correct
26	Correct	53 ms	13332 KB	Output is correct
27	Correct	127 ms	23376 KB	Output is correct
28	Correct	151 ms	23376 KB	Output is correct
29	Correct	1 ms	344 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	Correct	0 ms	344 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	1 ms	432 KB	Output is correct
36	Correct	6 ms	1368 KB	Output is correct
37	Correct	120 ms	23380 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	0 ms	348 KB	Output is correct
40	Correct	5 ms	1184 KB	Output is correct
41	Correct	129 ms	23380 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	3 ms	860 KB	Output is correct
45	Correct	58 ms	13396 KB	Output is correct
46	Correct	1 ms	344 KB	Output is correct
47	Correct	0 ms	348 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	29 ms	6264 KB	Output is correct
50	Correct	128 ms	23376 KB	Output is correct
51	Correct	139 ms	23356 KB	Output is correct
52	Correct	127 ms	23604 KB	Output is correct
53	Correct	49 ms	13820 KB	Output is correct
54	Correct	53 ms	13924 KB	Output is correct
55	Correct	115 ms	23888 KB	Output is correct
56	Correct	130 ms	23780 KB	Output is correct
57	Correct	50 ms	13908 KB	Output is correct
58	Correct	0 ms	348 KB	Output is correct
59	Correct	0 ms	348 KB	Output is correct
60	Correct	3 ms	832 KB	Output is correct
61	Correct	59 ms	14048 KB	Output is correct
62	Correct	0 ms	348 KB	Output is correct
63	Incorrect	0 ms	348 KB	Answer gives possible 0 while actual possible 1
64	Halted	0 ms	0 KB	-

Subtask #6
0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	5 ms	1372 KB	Output is correct
7	Correct	127 ms	23260 KB	Output is correct
8	Correct	0 ms	600 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	600 KB	Output is correct
11	Correct	0 ms	432 KB	Output is correct
12	Correct	5 ms	1212 KB	Output is correct
13	Correct	123 ms	23432 KB	Output is correct
14	Correct	0 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	62 ms	13364 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	29 ms	6200 KB	Output is correct
21	Correct	126 ms	23460 KB	Output is correct
22	Correct	144 ms	23376 KB	Output is correct
23	Correct	135 ms	23160 KB	Output is correct
24	Correct	128 ms	23376 KB	Output is correct
25	Correct	60 ms	13396 KB	Output is correct
26	Correct	53 ms	13332 KB	Output is correct
27	Correct	127 ms	23376 KB	Output is correct
28	Correct	151 ms	23376 KB	Output is correct
29	Correct	1 ms	344 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	Correct	0 ms	344 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	1 ms	432 KB	Output is correct
36	Correct	6 ms	1368 KB	Output is correct
37	Correct	120 ms	23380 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	0 ms	348 KB	Output is correct
40	Correct	5 ms	1184 KB	Output is correct
41	Correct	129 ms	23380 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	3 ms	860 KB	Output is correct
45	Correct	58 ms	13396 KB	Output is correct
46	Correct	1 ms	344 KB	Output is correct
47	Correct	0 ms	348 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	29 ms	6264 KB	Output is correct
50	Correct	128 ms	23376 KB	Output is correct
51	Correct	139 ms	23356 KB	Output is correct
52	Correct	127 ms	23604 KB	Output is correct
53	Correct	49 ms	13820 KB	Output is correct
54	Correct	53 ms	13924 KB	Output is correct
55	Correct	115 ms	23888 KB	Output is correct
56	Correct	130 ms	23780 KB	Output is correct
57	Correct	50 ms	13908 KB	Output is correct
58	Correct	0 ms	348 KB	Output is correct
59	Correct	0 ms	436 KB	Output is correct
60	Correct	0 ms	348 KB	Output is correct
61	Correct	31 ms	6228 KB	Output is correct
62	Correct	119 ms	23892 KB	Output is correct
63	Correct	121 ms	23892 KB	Output is correct
64	Correct	124 ms	23900 KB	Output is correct
65	Correct	1 ms	344 KB	Output is correct
66	Correct	30 ms	6248 KB	Output is correct
67	Correct	115 ms	23888 KB	Output is correct
68	Correct	114 ms	23888 KB	Output is correct
69	Correct	129 ms	23916 KB	Output is correct
70	Correct	0 ms	348 KB	Output is correct
71	Incorrect	0 ms	348 KB	Answer gives possible 0 while actual possible 1
72	Halted	0 ms	0 KB	-

답안 #1078788

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 10.0 / 10.0

Subtask #3 19.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
19.0 / 19.0

Subtask #4
0 / 35.0

Subtask #5
0 / 21.0

Subtask #6
0 / 4.0