oj.uz

답안 #1078756

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1078756 2024-08-28T05:53:30 Z Muhammad_Aneeq 슈퍼트리 잇기 (IOI20_supertrees) C++17
40 / 100
 137 ms 22144 KB 
#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;
	}
	if (subt4)
	{
		bool seen[n]={};
		int head[n]={};
		bool vis[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=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()<3)
				continue;
			for (int  i=0;i<x.size();i++)
			{
				int u=x[i],v=x[(i+1)%x.size()];
				b[u][v]=b[v][u]=1;
			}
		}
		for (int i=0;i<n;i++)
		{
			for (int j=0;j<n;j++)
			{
				int u=head[i],v=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;
	}
	return 0;
}

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:162:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  162 |    for (int  i=0;i<x.size();i++)
      |                  ~^~~~~~~~~

Subtask #1
11.0 / 11.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 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 124 ms 22144 KB Output is correct

Subtask #2
10.0 / 10.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 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 124 ms 22144 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 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 9 ms 1116 KB Output is correct
13 Correct 116 ms 22044 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 58 ms 12048 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 30 ms 5724 KB Output is correct
21 Correct 120 ms 22100 KB Output is correct
22 Correct 121 ms 22096 KB Output is correct
23 Correct 126 ms 22096 KB Output is correct
24 Correct 114 ms 22100 KB Output is correct
25 Correct 51 ms 12040 KB Output is correct
26 Correct 57 ms 12116 KB Output is correct
27 Correct 119 ms 22096 KB Output is correct
28 Correct 119 ms 22020 KB Output is correct

Subtask #3
19.0 / 19.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 344 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 1116 KB Output is correct
9 Correct 118 ms 22136 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1368 KB Output is correct
13 Correct 110 ms 22044 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 848 KB Output is correct
17 Correct 63 ms 12052 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 420 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 30 ms 5724 KB Output is correct
22 Correct 115 ms 22104 KB Output is correct
23 Correct 124 ms 22096 KB Output is correct
24 Correct 120 ms 22096 KB Output is correct
25 Correct 53 ms 12112 KB Output is correct
26 Correct 52 ms 12116 KB Output is correct
27 Correct 118 ms 22100 KB Output is correct
28 Correct 121 ms 22100 KB Output is correct
29 Correct 51 ms 12112 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 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 37 ms 5680 KB Output is correct
5 Correct 137 ms 22100 KB Output is correct
6 Correct 112 ms 22040 KB Output is correct
7 Correct 130 ms 22100 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 29 ms 5808 KB Output is correct
10 Correct 121 ms 22036 KB Output is correct
11 Correct 111 ms 22100 KB Output is correct
12 Correct 124 ms 22028 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 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 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 124 ms 22144 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 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 9 ms 1116 KB Output is correct
13 Correct 116 ms 22044 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 58 ms 12048 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 30 ms 5724 KB Output is correct
21 Correct 120 ms 22100 KB Output is correct
22 Correct 121 ms 22096 KB Output is correct
23 Correct 126 ms 22096 KB Output is correct
24 Correct 114 ms 22100 KB Output is correct
25 Correct 51 ms 12040 KB Output is correct
26 Correct 57 ms 12116 KB Output is correct
27 Correct 119 ms 22096 KB Output is correct
28 Correct 119 ms 22020 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 344 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 1116 KB Output is correct
37 Correct 118 ms 22136 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 5 ms 1368 KB Output is correct
41 Correct 110 ms 22044 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 848 KB Output is correct
45 Correct 63 ms 12052 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 0 ms 420 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 30 ms 5724 KB Output is correct
50 Correct 115 ms 22104 KB Output is correct
51 Correct 124 ms 22096 KB Output is correct
52 Correct 120 ms 22096 KB Output is correct
53 Correct 53 ms 12112 KB Output is correct
54 Correct 52 ms 12116 KB Output is correct
55 Correct 118 ms 22100 KB Output is correct
56 Correct 121 ms 22100 KB Output is correct
57 Correct 51 ms 12112 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 860 KB Output is correct
61 Correct 63 ms 13996 KB Output is correct
62 Correct 1 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 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 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 124 ms 22144 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 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 9 ms 1116 KB Output is correct
13 Correct 116 ms 22044 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 58 ms 12048 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 30 ms 5724 KB Output is correct
21 Correct 120 ms 22100 KB Output is correct
22 Correct 121 ms 22096 KB Output is correct
23 Correct 126 ms 22096 KB Output is correct
24 Correct 114 ms 22100 KB Output is correct
25 Correct 51 ms 12040 KB Output is correct
26 Correct 57 ms 12116 KB Output is correct
27 Correct 119 ms 22096 KB Output is correct
28 Correct 119 ms 22020 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 344 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 1116 KB Output is correct
37 Correct 118 ms 22136 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 5 ms 1368 KB Output is correct
41 Correct 110 ms 22044 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 848 KB Output is correct
45 Correct 63 ms 12052 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 0 ms 420 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 30 ms 5724 KB Output is correct
50 Correct 115 ms 22104 KB Output is correct
51 Correct 124 ms 22096 KB Output is correct
52 Correct 120 ms 22096 KB Output is correct
53 Correct 53 ms 12112 KB Output is correct
54 Correct 52 ms 12116 KB Output is correct
55 Correct 118 ms 22100 KB Output is correct
56 Correct 121 ms 22100 KB Output is correct
57 Correct 51 ms 12112 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 37 ms 5680 KB Output is correct
62 Correct 137 ms 22100 KB Output is correct
63 Correct 112 ms 22040 KB Output is correct
64 Correct 130 ms 22100 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 29 ms 5808 KB Output is correct
67 Correct 121 ms 22036 KB Output is correct
68 Correct 111 ms 22100 KB Output is correct
69 Correct 124 ms 22028 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 -