oj.uz

Submission #1078754

# Submission time Handle Problem Language Result Execution time Memory
1078754 2024-08-28T05:49:21 Z Muhammad_Aneeq Connecting Supertrees (IOI20_supertrees) C++17
75 / 100
 151 ms 24152 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++)
		{
			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()==1)
				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;
			}
		}
		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:152:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  152 |    for (int  i=0;i<x.size();i++)
      |                  ~^~~~~~~~~

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 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 1404 KB Output is correct
7 Correct 118 ms 23884 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 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 1404 KB Output is correct
7 Correct 118 ms 23884 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 1 ms 348 KB Output is correct
12 Correct 6 ms 1372 KB Output is correct
13 Correct 119 ms 24128 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 14164 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 30 ms 6224 KB Output is correct
21 Correct 118 ms 24152 KB Output is correct
22 Correct 114 ms 23980 KB Output is correct
23 Correct 124 ms 24056 KB Output is correct
24 Correct 151 ms 23892 KB Output is correct
25 Correct 55 ms 14160 KB Output is correct
26 Correct 51 ms 14172 KB Output is correct
27 Correct 125 ms 23932 KB Output is correct
28 Correct 123 ms 23980 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory 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 0 ms 348 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 123 ms 23920 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 1372 KB Output is correct
13 Correct 125 ms 24068 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 56 ms 14088 KB Output is correct
18 Correct 1 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 29 ms 6268 KB Output is correct
22 Correct 123 ms 24072 KB Output is correct
23 Correct 117 ms 24144 KB Output is correct
24 Correct 126 ms 24144 KB Output is correct
25 Correct 48 ms 14164 KB Output is correct
26 Correct 53 ms 14160 KB Output is correct
27 Correct 120 ms 24144 KB Output is correct
28 Correct 139 ms 24144 KB Output is correct
29 Correct 52 ms 13972 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory 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 31 ms 6240 KB Output is correct
5 Correct 145 ms 23892 KB Output is correct
6 Correct 123 ms 23892 KB Output is correct
7 Correct 131 ms 23888 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 44 ms 6236 KB Output is correct
10 Correct 119 ms 23892 KB Output is correct
11 Correct 119 ms 24144 KB Output is correct
12 Correct 125 ms 23892 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 35 ms 6488 KB Output is correct
17 Correct 119 ms 23940 KB Output is correct
18 Correct 115 ms 24144 KB Output is correct
19 Correct 117 ms 23948 KB Output is correct
20 Correct 126 ms 23892 KB Output is correct

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 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 1404 KB Output is correct
7 Correct 118 ms 23884 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 1 ms 348 KB Output is correct
12 Correct 6 ms 1372 KB Output is correct
13 Correct 119 ms 24128 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 14164 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 30 ms 6224 KB Output is correct
21 Correct 118 ms 24152 KB Output is correct
22 Correct 114 ms 23980 KB Output is correct
23 Correct 124 ms 24056 KB Output is correct
24 Correct 151 ms 23892 KB Output is correct
25 Correct 55 ms 14160 KB Output is correct
26 Correct 51 ms 14172 KB Output is correct
27 Correct 125 ms 23932 KB Output is correct
28 Correct 123 ms 23980 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 0 ms 348 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 123 ms 23920 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 5 ms 1372 KB Output is correct
41 Correct 125 ms 24068 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 3 ms 856 KB Output is correct
45 Correct 56 ms 14088 KB Output is correct
46 Correct 1 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 29 ms 6268 KB Output is correct
50 Correct 123 ms 24072 KB Output is correct
51 Correct 117 ms 24144 KB Output is correct
52 Correct 126 ms 24144 KB Output is correct
53 Correct 48 ms 14164 KB Output is correct
54 Correct 53 ms 14160 KB Output is correct
55 Correct 120 ms 24144 KB Output is correct
56 Correct 139 ms 24144 KB Output is correct
57 Correct 52 ms 13972 KB Output is correct
58 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
59 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 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 1404 KB Output is correct
7 Correct 118 ms 23884 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 1 ms 348 KB Output is correct
12 Correct 6 ms 1372 KB Output is correct
13 Correct 119 ms 24128 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 14164 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 30 ms 6224 KB Output is correct
21 Correct 118 ms 24152 KB Output is correct
22 Correct 114 ms 23980 KB Output is correct
23 Correct 124 ms 24056 KB Output is correct
24 Correct 151 ms 23892 KB Output is correct
25 Correct 55 ms 14160 KB Output is correct
26 Correct 51 ms 14172 KB Output is correct
27 Correct 125 ms 23932 KB Output is correct
28 Correct 123 ms 23980 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 0 ms 348 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 123 ms 23920 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 5 ms 1372 KB Output is correct
41 Correct 125 ms 24068 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 3 ms 856 KB Output is correct
45 Correct 56 ms 14088 KB Output is correct
46 Correct 1 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 29 ms 6268 KB Output is correct
50 Correct 123 ms 24072 KB Output is correct
51 Correct 117 ms 24144 KB Output is correct
52 Correct 126 ms 24144 KB Output is correct
53 Correct 48 ms 14164 KB Output is correct
54 Correct 53 ms 14160 KB Output is correct
55 Correct 120 ms 24144 KB Output is correct
56 Correct 139 ms 24144 KB Output is correct
57 Correct 52 ms 13972 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Correct 0 ms 344 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 31 ms 6240 KB Output is correct
62 Correct 145 ms 23892 KB Output is correct
63 Correct 123 ms 23892 KB Output is correct
64 Correct 131 ms 23888 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 44 ms 6236 KB Output is correct
67 Correct 119 ms 23892 KB Output is correct
68 Correct 119 ms 24144 KB Output is correct
69 Correct 125 ms 23892 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 35 ms 6488 KB Output is correct
74 Correct 119 ms 23940 KB Output is correct
75 Correct 115 ms 24144 KB Output is correct
76 Correct 117 ms 23948 KB Output is correct
77 Correct 126 ms 23892 KB Output is correct
78 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
79 Halted 0 ms 0 KB -