oj.uz

Submission #1078739

# Submission time Handle Problem Language Result Execution time Memory
1078739 2024-08-28T05:30:48 Z Muhammad_Aneeq Connecting Supertrees (IOI20_supertrees) C++17
40 / 100
 155 ms 23964 KB 
#include <vector>
#include <iostream>
using namespace std;
int const MAXN=1000;
bool ed[MAXN][MAXN]={};
bool vis[MAXN]={};
bool in[MAXN]={};
vector<int>ans,cur;
vector<int>all;
bool check(int u)
{
	for (auto i:cur)
	{
		if (ed[i][u]==0)
			return 0;
	}
	return 1;
}
void dfs(int u,int p=-1)
{
	all.push_back(u);
	cur.push_back(u);
	vis[u]=1;
	in[u]=1;
	for (int i=0;i<MAXN;i++)
	{
		if (u==i)
			continue;
		if (!vis[i]&&ed[u][i]&&check(i))
			dfs(i,u);
		if (i!=p&&ed[i][u]&&in[i])
			ans=cur;
	}
	in[u]=0;
	cur.pop_back();
}
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)
	{
		for (int i=0;i<n;i++)
			for (int j=i+1;j<n;j++)
				if (p[i][j]==2)
					ed[i][j]=ed[j][i]=1;
		bool seen[n]={};
		int head[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[i])
			{
				ans={},cur={},all={};
				dfs(i);
				for (auto j:all)
					vis[j]=0;
				for (auto j:ans)
					vis[j]=1;
				// cout<<i<<' '<<ans.size()<<endl;
				if (ans.size()>1)
				{
					for (int j=0;j<ans.size();j++)
					{
						head[ans[j]]=i;
						b[ans[j]][ans[(j+1)%ans.size()]]=b[ans[(j+1)%ans.size()]][ans[j]]=1;
					}
				}
			}
		}
		build(b);
		return 1;
	}
	return 0;
}

Compilation message

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

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

Subtask #2
10.0 / 10.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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1160 KB Output is correct
7 Correct 115 ms 23964 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1372 KB Output is correct
13 Correct 124 ms 23900 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 860 KB Output is correct
17 Correct 60 ms 13940 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 30 ms 6224 KB Output is correct
21 Correct 135 ms 23888 KB Output is correct
22 Correct 155 ms 23404 KB Output is correct
23 Correct 124 ms 23380 KB Output is correct
24 Correct 118 ms 23284 KB Output is correct
25 Correct 55 ms 13396 KB Output is correct
26 Correct 53 ms 13392 KB Output is correct
27 Correct 131 ms 23304 KB Output is correct
28 Correct 124 ms 23300 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory 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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 6 ms 1372 KB Output is correct
9 Correct 118 ms 23444 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 596 KB Output is correct
12 Correct 5 ms 1384 KB Output is correct
13 Correct 137 ms 23324 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 67 ms 13336 KB Output is correct
18 Correct 0 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 41 ms 6332 KB Output is correct
22 Correct 117 ms 23236 KB Output is correct
23 Correct 130 ms 23332 KB Output is correct
24 Correct 130 ms 23376 KB Output is correct
25 Correct 57 ms 13392 KB Output is correct
26 Correct 83 ms 13404 KB Output is correct
27 Correct 123 ms 23268 KB Output is correct
28 Correct 127 ms 23432 KB Output is correct
29 Correct 59 ms 13392 KB Output is correct

Subtask #4
0 / 35.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 28 ms 6228 KB Output is correct
5 Correct 120 ms 23388 KB Output is correct
6 Correct 123 ms 23376 KB Output is correct
7 Correct 125 ms 23276 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 31 ms 6304 KB Output is correct
10 Correct 119 ms 23376 KB Output is correct
11 Correct 126 ms 23376 KB Output is correct
12 Correct 123 ms 23380 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Incorrect 42 ms 6736 KB Too many ways to get from 0 to 338, should be 1 found no less than 2
17 Halted 0 ms 0 KB -

Subtask #5
0 / 21.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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1160 KB Output is correct
7 Correct 115 ms 23964 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1372 KB Output is correct
13 Correct 124 ms 23900 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 860 KB Output is correct
17 Correct 60 ms 13940 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 30 ms 6224 KB Output is correct
21 Correct 135 ms 23888 KB Output is correct
22 Correct 155 ms 23404 KB Output is correct
23 Correct 124 ms 23380 KB Output is correct
24 Correct 118 ms 23284 KB Output is correct
25 Correct 55 ms 13396 KB Output is correct
26 Correct 53 ms 13392 KB Output is correct
27 Correct 131 ms 23304 KB Output is correct
28 Correct 124 ms 23300 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 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 6 ms 1372 KB Output is correct
37 Correct 118 ms 23444 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 596 KB Output is correct
40 Correct 5 ms 1384 KB Output is correct
41 Correct 137 ms 23324 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 860 KB Output is correct
45 Correct 67 ms 13336 KB Output is correct
46 Correct 0 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 41 ms 6332 KB Output is correct
50 Correct 117 ms 23236 KB Output is correct
51 Correct 130 ms 23332 KB Output is correct
52 Correct 130 ms 23376 KB Output is correct
53 Correct 57 ms 13392 KB Output is correct
54 Correct 83 ms 13404 KB Output is correct
55 Correct 123 ms 23268 KB Output is correct
56 Correct 127 ms 23432 KB Output is correct
57 Correct 59 ms 13392 KB Output is correct
58 Incorrect 0 ms 344 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 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 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1160 KB Output is correct
7 Correct 115 ms 23964 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1372 KB Output is correct
13 Correct 124 ms 23900 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 860 KB Output is correct
17 Correct 60 ms 13940 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 30 ms 6224 KB Output is correct
21 Correct 135 ms 23888 KB Output is correct
22 Correct 155 ms 23404 KB Output is correct
23 Correct 124 ms 23380 KB Output is correct
24 Correct 118 ms 23284 KB Output is correct
25 Correct 55 ms 13396 KB Output is correct
26 Correct 53 ms 13392 KB Output is correct
27 Correct 131 ms 23304 KB Output is correct
28 Correct 124 ms 23300 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 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 6 ms 1372 KB Output is correct
37 Correct 118 ms 23444 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 596 KB Output is correct
40 Correct 5 ms 1384 KB Output is correct
41 Correct 137 ms 23324 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 860 KB Output is correct
45 Correct 67 ms 13336 KB Output is correct
46 Correct 0 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 41 ms 6332 KB Output is correct
50 Correct 117 ms 23236 KB Output is correct
51 Correct 130 ms 23332 KB Output is correct
52 Correct 130 ms 23376 KB Output is correct
53 Correct 57 ms 13392 KB Output is correct
54 Correct 83 ms 13404 KB Output is correct
55 Correct 123 ms 23268 KB Output is correct
56 Correct 127 ms 23432 KB Output is correct
57 Correct 59 ms 13392 KB Output is correct
58 Correct 1 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 28 ms 6228 KB Output is correct
62 Correct 120 ms 23388 KB Output is correct
63 Correct 123 ms 23376 KB Output is correct
64 Correct 125 ms 23276 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 31 ms 6304 KB Output is correct
67 Correct 119 ms 23376 KB Output is correct
68 Correct 126 ms 23376 KB Output is correct
69 Correct 123 ms 23380 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 1 ms 344 KB Output is correct
73 Incorrect 42 ms 6736 KB Too many ways to get from 0 to 338, should be 1 found no less than 2
74 Halted 0 ms 0 KB -