oj.uz

답안 #1078706

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1078706 2024-08-28T04:45:32 Z Muhammad_Aneeq 슈퍼트리 잇기 (IOI20_supertrees) C++17
40 / 100
 133 ms 24056 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()==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;
	}
	return 0;
}

Compilation message

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

Subtask #1
11.0 / 11.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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1384 KB Output is correct
7 Correct 121 ms 23892 KB Output is correct

Subtask #2
10.0 / 10.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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1384 KB Output is correct
7 Correct 121 ms 23892 KB Output is correct
8 Correct 1 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 5 ms 1240 KB Output is correct
13 Correct 112 ms 23900 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 14200 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 31 ms 6260 KB Output is correct
21 Correct 121 ms 23892 KB Output is correct
22 Correct 116 ms 24056 KB Output is correct
23 Correct 125 ms 23928 KB Output is correct
24 Correct 120 ms 23892 KB Output is correct
25 Correct 55 ms 14160 KB Output is correct
26 Correct 60 ms 14188 KB Output is correct
27 Correct 120 ms 23936 KB Output is correct
28 Correct 118 ms 23892 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 0 ms 348 KB Output is correct
4 Correct 0 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 1200 KB Output is correct
9 Correct 112 ms 23964 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 424 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 129 ms 23888 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 59 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 Correct 0 ms 348 KB Output is correct
21 Correct 31 ms 6320 KB Output is correct
22 Correct 119 ms 23892 KB Output is correct
23 Correct 112 ms 23892 KB Output is correct
24 Correct 119 ms 23892 KB Output is correct
25 Correct 51 ms 14160 KB Output is correct
26 Correct 54 ms 14160 KB Output is correct
27 Correct 118 ms 23888 KB Output is correct
28 Correct 133 ms 24044 KB Output is correct
29 Correct 56 ms 14164 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 424 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 29 ms 6400 KB Output is correct
5 Correct 116 ms 23960 KB Output is correct
6 Correct 112 ms 23892 KB Output is correct
7 Correct 124 ms 24044 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 28 ms 6264 KB Output is correct
10 Correct 127 ms 23904 KB Output is correct
11 Correct 118 ms 24056 KB Output is correct
12 Correct 121 ms 24052 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 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 6 ms 1384 KB Output is correct
7 Correct 121 ms 23892 KB Output is correct
8 Correct 1 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 5 ms 1240 KB Output is correct
13 Correct 112 ms 23900 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 14200 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 31 ms 6260 KB Output is correct
21 Correct 121 ms 23892 KB Output is correct
22 Correct 116 ms 24056 KB Output is correct
23 Correct 125 ms 23928 KB Output is correct
24 Correct 120 ms 23892 KB Output is correct
25 Correct 55 ms 14160 KB Output is correct
26 Correct 60 ms 14188 KB Output is correct
27 Correct 120 ms 23936 KB Output is correct
28 Correct 118 ms 23892 KB Output is correct
29 Correct 0 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 0 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 1200 KB Output is correct
37 Correct 112 ms 23964 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 424 KB Output is correct
40 Correct 5 ms 1372 KB Output is correct
41 Correct 129 ms 23888 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 59 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 Correct 0 ms 348 KB Output is correct
49 Correct 31 ms 6320 KB Output is correct
50 Correct 119 ms 23892 KB Output is correct
51 Correct 112 ms 23892 KB Output is correct
52 Correct 119 ms 23892 KB Output is correct
53 Correct 51 ms 14160 KB Output is correct
54 Correct 54 ms 14160 KB Output is correct
55 Correct 118 ms 23888 KB Output is correct
56 Correct 133 ms 24044 KB Output is correct
57 Correct 56 ms 14164 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 344 KB Output is correct
60 Correct 3 ms 600 KB Output is correct
61 Correct 57 ms 10108 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Incorrect 0 ms 388 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 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 6 ms 1384 KB Output is correct
7 Correct 121 ms 23892 KB Output is correct
8 Correct 1 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 5 ms 1240 KB Output is correct
13 Correct 112 ms 23900 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 14200 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 31 ms 6260 KB Output is correct
21 Correct 121 ms 23892 KB Output is correct
22 Correct 116 ms 24056 KB Output is correct
23 Correct 125 ms 23928 KB Output is correct
24 Correct 120 ms 23892 KB Output is correct
25 Correct 55 ms 14160 KB Output is correct
26 Correct 60 ms 14188 KB Output is correct
27 Correct 120 ms 23936 KB Output is correct
28 Correct 118 ms 23892 KB Output is correct
29 Correct 0 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 0 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 1200 KB Output is correct
37 Correct 112 ms 23964 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 424 KB Output is correct
40 Correct 5 ms 1372 KB Output is correct
41 Correct 129 ms 23888 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 59 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 Correct 0 ms 348 KB Output is correct
49 Correct 31 ms 6320 KB Output is correct
50 Correct 119 ms 23892 KB Output is correct
51 Correct 112 ms 23892 KB Output is correct
52 Correct 119 ms 23892 KB Output is correct
53 Correct 51 ms 14160 KB Output is correct
54 Correct 54 ms 14160 KB Output is correct
55 Correct 118 ms 23888 KB Output is correct
56 Correct 133 ms 24044 KB Output is correct
57 Correct 56 ms 14164 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 0 ms 424 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 29 ms 6400 KB Output is correct
62 Correct 116 ms 23960 KB Output is correct
63 Correct 112 ms 23892 KB Output is correct
64 Correct 124 ms 24044 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 28 ms 6264 KB Output is correct
67 Correct 127 ms 23904 KB Output is correct
68 Correct 118 ms 24056 KB Output is correct
69 Correct 121 ms 24052 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 -