oj.uz

Submission #1078700

# Submission time Handle Problem Language Result Execution time Memory
1078700 2024-08-28T04:40:58 Z Muhammad_Aneeq Connecting Supertrees (IOI20_supertrees) C++17
21 / 100
 132 ms 23908 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]]=1;
					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++)
      |                  ~^~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 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 1372 KB Output is correct
7 Correct 118 ms 23776 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 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 1372 KB Output is correct
7 Correct 118 ms 23776 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 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 118 ms 23908 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 860 KB Output is correct
17 Correct 59 ms 13824 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 32 ms 6228 KB Output is correct
21 Correct 121 ms 23820 KB Output is correct
22 Correct 132 ms 23892 KB Output is correct
23 Correct 124 ms 23764 KB Output is correct
24 Correct 121 ms 23376 KB Output is correct
25 Correct 59 ms 13456 KB Output is correct
26 Correct 53 ms 13500 KB Output is correct
27 Correct 123 ms 23376 KB Output is correct
28 Correct 117 ms 23376 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory 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 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 420 KB Output is correct
8 Correct 6 ms 1372 KB Output is correct
9 Correct 119 ms 23420 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 7 ms 1372 KB Output is correct
13 Correct 116 ms 23284 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 57 ms 13396 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Incorrect 1 ms 348 KB Answer gives possible 0 while actual possible 1
21 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 28 ms 6168 KB Output is correct
5 Correct 122 ms 23376 KB Output is correct
6 Correct 123 ms 23380 KB Output is correct
7 Correct 119 ms 23288 KB Output is correct
8 Incorrect 1 ms 344 KB Answer gives possible 0 while actual possible 1
9 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 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 1372 KB Output is correct
7 Correct 118 ms 23776 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 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 118 ms 23908 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 860 KB Output is correct
17 Correct 59 ms 13824 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 32 ms 6228 KB Output is correct
21 Correct 121 ms 23820 KB Output is correct
22 Correct 132 ms 23892 KB Output is correct
23 Correct 124 ms 23764 KB Output is correct
24 Correct 121 ms 23376 KB Output is correct
25 Correct 59 ms 13456 KB Output is correct
26 Correct 53 ms 13500 KB Output is correct
27 Correct 123 ms 23376 KB Output is correct
28 Correct 117 ms 23376 KB Output is correct
29 Correct 0 ms 344 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 420 KB Output is correct
36 Correct 6 ms 1372 KB Output is correct
37 Correct 119 ms 23420 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 7 ms 1372 KB Output is correct
41 Correct 116 ms 23284 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 57 ms 13396 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Incorrect 1 ms 348 KB Answer gives possible 0 while actual possible 1
49 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 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 1372 KB Output is correct
7 Correct 118 ms 23776 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 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 118 ms 23908 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 860 KB Output is correct
17 Correct 59 ms 13824 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 32 ms 6228 KB Output is correct
21 Correct 121 ms 23820 KB Output is correct
22 Correct 132 ms 23892 KB Output is correct
23 Correct 124 ms 23764 KB Output is correct
24 Correct 121 ms 23376 KB Output is correct
25 Correct 59 ms 13456 KB Output is correct
26 Correct 53 ms 13500 KB Output is correct
27 Correct 123 ms 23376 KB Output is correct
28 Correct 117 ms 23376 KB Output is correct
29 Correct 0 ms 344 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 420 KB Output is correct
36 Correct 6 ms 1372 KB Output is correct
37 Correct 119 ms 23420 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 7 ms 1372 KB Output is correct
41 Correct 116 ms 23284 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 57 ms 13396 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Incorrect 1 ms 348 KB Answer gives possible 0 while actual possible 1
49 Halted 0 ms 0 KB -