답안 #1078741

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

supertrees

#include <vector>
#include <iostream>
using namespace std;
int const MAXN=1000;
bool ed[MAXN][MAXN]={};
bool vis[MAXN]={};
bool in[MAXN]={};
vector<int>ans,cur;
vector<int>all;
bool check(int u)
{
	for (auto i:cur)
	{
		if (ed[i][u]==0)
			return 0;
	}
	return 1;
}
void dfs(int u,int p=-1)
{
	all.push_back(u);
	cur.push_back(u);
	vis[u]=1;
	in[u]=1;
	for (int i=0;i<MAXN;i++)
	{
		if (u==i)
			continue;
		if (!vis[i]&&ed[u][i]&&check(i))
			dfs(i,u);
		if (i!=p&&ed[i][u]&&in[i])
			ans=cur;
	}
	in[u]=0;
	cur.pop_back();
}
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;
	}
	if (subt4)
	{
		for (int i=0;i<n;i++)
			for (int j=i+1;j<n;j++)
				if (p[i][j]==2)
					ed[i][j]=ed[j][i]=1;
		bool seen[n]={};
		int head[n]={};
		vector<vector<int>>b(n,vector<int>(n));
		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])
						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=i+1;j<n;j++)
			{
				if (p[i][j]==2)
					b[head[i]][head[j]]=b[head[j]][head[i]]=1;
			}
		}
		build(b);
		return 1;
	}
	return 0;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:123:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  123 |     for (int j=0;j<z.size();j++)
      |                  ~^~~~~~~~~

Subtask #1

11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	348 KB	Output is correct
6	Correct	6 ms	1116 KB	Output is correct
7	Correct	132 ms	22036 KB	Output is correct

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	348 KB	Output is correct
6	Correct	6 ms	1116 KB	Output is correct
7	Correct	132 ms	22036 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	344 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	121 ms	22032 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	3 ms	856 KB	Output is correct
17	Correct	58 ms	12052 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	31 ms	5792 KB	Output is correct
21	Correct	127 ms	22096 KB	Output is correct
22	Correct	121 ms	22100 KB	Output is correct
23	Correct	125 ms	22100 KB	Output is correct
24	Correct	119 ms	22100 KB	Output is correct
25	Correct	56 ms	12116 KB	Output is correct
26	Correct	51 ms	12116 KB	Output is correct
27	Correct	140 ms	21944 KB	Output is correct
28	Correct	145 ms	22096 KB	Output is correct

Subtask #3

19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	7 ms	1316 KB	Output is correct
9	Correct	126 ms	22052 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	6 ms	1116 KB	Output is correct
13	Correct	131 ms	22136 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	6 ms	860 KB	Output is correct
17	Correct	59 ms	12060 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	34 ms	5716 KB	Output is correct
22	Correct	124 ms	22096 KB	Output is correct
23	Correct	129 ms	22100 KB	Output is correct
24	Correct	136 ms	22028 KB	Output is correct
25	Correct	51 ms	12068 KB	Output is correct
26	Correct	50 ms	12112 KB	Output is correct
27	Correct	118 ms	22016 KB	Output is correct
28	Correct	121 ms	22100 KB	Output is correct
29	Correct	52 ms	12112 KB	Output is correct

Subtask #4

0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	31 ms	5756 KB	Output is correct
5	Correct	124 ms	22040 KB	Output is correct
6	Correct	132 ms	22100 KB	Output is correct
7	Correct	131 ms	22096 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	41 ms	5712 KB	Output is correct
10	Correct	120 ms	22096 KB	Output is correct
11	Correct	116 ms	22096 KB	Output is correct
12	Correct	120 ms	22032 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Incorrect	1 ms	348 KB	Too many ways to get from 0 to 3, should be 2 found no less than 3
15	Halted	0 ms	0 KB	-

Subtask #5

0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	348 KB	Output is correct
6	Correct	6 ms	1116 KB	Output is correct
7	Correct	132 ms	22036 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	344 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	121 ms	22032 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	3 ms	856 KB	Output is correct
17	Correct	58 ms	12052 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	31 ms	5792 KB	Output is correct
21	Correct	127 ms	22096 KB	Output is correct
22	Correct	121 ms	22100 KB	Output is correct
23	Correct	125 ms	22100 KB	Output is correct
24	Correct	119 ms	22100 KB	Output is correct
25	Correct	56 ms	12116 KB	Output is correct
26	Correct	51 ms	12116 KB	Output is correct
27	Correct	140 ms	21944 KB	Output is correct
28	Correct	145 ms	22096 KB	Output is correct
29	Correct	1 ms	344 KB	Output is correct
30	Correct	0 ms	344 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	7 ms	1316 KB	Output is correct
37	Correct	126 ms	22052 KB	Output is correct
38	Correct	1 ms	344 KB	Output is correct
39	Correct	1 ms	348 KB	Output is correct
40	Correct	6 ms	1116 KB	Output is correct
41	Correct	131 ms	22136 KB	Output is correct
42	Correct	0 ms	344 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	6 ms	860 KB	Output is correct
45	Correct	59 ms	12060 KB	Output is correct
46	Correct	0 ms	344 KB	Output is correct
47	Correct	0 ms	348 KB	Output is correct
48	Correct	1 ms	348 KB	Output is correct
49	Correct	34 ms	5716 KB	Output is correct
50	Correct	124 ms	22096 KB	Output is correct
51	Correct	129 ms	22100 KB	Output is correct
52	Correct	136 ms	22028 KB	Output is correct
53	Correct	51 ms	12068 KB	Output is correct
54	Correct	50 ms	12112 KB	Output is correct
55	Correct	118 ms	22016 KB	Output is correct
56	Correct	121 ms	22100 KB	Output is correct
57	Correct	52 ms	12112 KB	Output is correct
58	Incorrect	1 ms	344 KB	Answer gives possible 1 while actual possible 0
59	Halted	0 ms	0 KB	-

Subtask #6

0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	348 KB	Output is correct
6	Correct	6 ms	1116 KB	Output is correct
7	Correct	132 ms	22036 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	344 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	121 ms	22032 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	3 ms	856 KB	Output is correct
17	Correct	58 ms	12052 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	31 ms	5792 KB	Output is correct
21	Correct	127 ms	22096 KB	Output is correct
22	Correct	121 ms	22100 KB	Output is correct
23	Correct	125 ms	22100 KB	Output is correct
24	Correct	119 ms	22100 KB	Output is correct
25	Correct	56 ms	12116 KB	Output is correct
26	Correct	51 ms	12116 KB	Output is correct
27	Correct	140 ms	21944 KB	Output is correct
28	Correct	145 ms	22096 KB	Output is correct
29	Correct	1 ms	344 KB	Output is correct
30	Correct	0 ms	344 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	7 ms	1316 KB	Output is correct
37	Correct	126 ms	22052 KB	Output is correct
38	Correct	1 ms	344 KB	Output is correct
39	Correct	1 ms	348 KB	Output is correct
40	Correct	6 ms	1116 KB	Output is correct
41	Correct	131 ms	22136 KB	Output is correct
42	Correct	0 ms	344 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	6 ms	860 KB	Output is correct
45	Correct	59 ms	12060 KB	Output is correct
46	Correct	0 ms	344 KB	Output is correct
47	Correct	0 ms	348 KB	Output is correct
48	Correct	1 ms	348 KB	Output is correct
49	Correct	34 ms	5716 KB	Output is correct
50	Correct	124 ms	22096 KB	Output is correct
51	Correct	129 ms	22100 KB	Output is correct
52	Correct	136 ms	22028 KB	Output is correct
53	Correct	51 ms	12068 KB	Output is correct
54	Correct	50 ms	12112 KB	Output is correct
55	Correct	118 ms	22016 KB	Output is correct
56	Correct	121 ms	22100 KB	Output is correct
57	Correct	52 ms	12112 KB	Output is correct
58	Correct	0 ms	344 KB	Output is correct
59	Correct	0 ms	348 KB	Output is correct
60	Correct	0 ms	348 KB	Output is correct
61	Correct	31 ms	5756 KB	Output is correct
62	Correct	124 ms	22040 KB	Output is correct
63	Correct	132 ms	22100 KB	Output is correct
64	Correct	131 ms	22096 KB	Output is correct
65	Correct	0 ms	348 KB	Output is correct
66	Correct	41 ms	5712 KB	Output is correct
67	Correct	120 ms	22096 KB	Output is correct
68	Correct	116 ms	22096 KB	Output is correct
69	Correct	120 ms	22032 KB	Output is correct
70	Correct	0 ms	344 KB	Output is correct
71	Incorrect	1 ms	348 KB	Too many ways to get from 0 to 3, should be 2 found no less than 3
72	Halted	0 ms	0 KB	-