답안 #1078703

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1078703 2024-08-28T04:42:38 Z Muhammad_Aneeq 슈퍼트리 잇기 (IOI20_supertrees) C++17
21 / 100
146 ms 24156 KB
#include <vector>
#include <queue>
using namespace std;
void build(vector<vector<int>> b);
int construct(vector<vector<int>> p)
{
	int n=p.size();
	bool subt1=1,subt2=1,subt3=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 (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()==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=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;
	}
	return 0;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:83:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |     for (int j=0;j<z.size();j++)
      |                  ~^~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 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 5 ms 1364 KB Output is correct
7 Correct 116 ms 23892 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 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 5 ms 1364 KB Output is correct
7 Correct 116 ms 23892 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 428 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 128 ms 24156 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 916 KB Output is correct
17 Correct 61 ms 14204 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 28 ms 6356 KB Output is correct
21 Correct 130 ms 23888 KB Output is correct
22 Correct 111 ms 24060 KB Output is correct
23 Correct 121 ms 23888 KB Output is correct
24 Correct 144 ms 23888 KB Output is correct
25 Correct 56 ms 14164 KB Output is correct
26 Correct 51 ms 14068 KB Output is correct
27 Correct 119 ms 23888 KB Output is correct
28 Correct 116 ms 23888 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 5 ms 1372 KB Output is correct
9 Correct 117 ms 24064 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1180 KB Output is correct
13 Correct 133 ms 24028 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 944 KB Output is correct
17 Correct 55 ms 14164 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Incorrect 0 ms 348 KB b[4][4] is not 0
21 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 30 ms 6364 KB Output is correct
5 Correct 116 ms 23940 KB Output is correct
6 Correct 114 ms 24056 KB Output is correct
7 Correct 146 ms 23896 KB Output is correct
8 Incorrect 0 ms 344 KB b[4][4] is not 0
9 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 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 5 ms 1364 KB Output is correct
7 Correct 116 ms 23892 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 428 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 128 ms 24156 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 916 KB Output is correct
17 Correct 61 ms 14204 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 28 ms 6356 KB Output is correct
21 Correct 130 ms 23888 KB Output is correct
22 Correct 111 ms 24060 KB Output is correct
23 Correct 121 ms 23888 KB Output is correct
24 Correct 144 ms 23888 KB Output is correct
25 Correct 56 ms 14164 KB Output is correct
26 Correct 51 ms 14068 KB Output is correct
27 Correct 119 ms 23888 KB Output is correct
28 Correct 116 ms 23888 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 5 ms 1372 KB Output is correct
37 Correct 117 ms 24064 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 5 ms 1180 KB Output is correct
41 Correct 133 ms 24028 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 3 ms 944 KB Output is correct
45 Correct 55 ms 14164 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Incorrect 0 ms 348 KB b[4][4] is not 0
49 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 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 5 ms 1364 KB Output is correct
7 Correct 116 ms 23892 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 428 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 128 ms 24156 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 916 KB Output is correct
17 Correct 61 ms 14204 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 28 ms 6356 KB Output is correct
21 Correct 130 ms 23888 KB Output is correct
22 Correct 111 ms 24060 KB Output is correct
23 Correct 121 ms 23888 KB Output is correct
24 Correct 144 ms 23888 KB Output is correct
25 Correct 56 ms 14164 KB Output is correct
26 Correct 51 ms 14068 KB Output is correct
27 Correct 119 ms 23888 KB Output is correct
28 Correct 116 ms 23888 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 5 ms 1372 KB Output is correct
37 Correct 117 ms 24064 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 5 ms 1180 KB Output is correct
41 Correct 133 ms 24028 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 3 ms 944 KB Output is correct
45 Correct 55 ms 14164 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Incorrect 0 ms 348 KB b[4][4] is not 0
49 Halted 0 ms 0 KB -