oj.uz

Submission #792710

# Submission time Handle Problem Language Result Execution time Memory
792710 2023-07-25T08:12:25 Z mousebeaver Connecting Supertrees (IOI20_supertrees) C++14
11 / 100
 172 ms 23968 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

int construct(vector<vector<int>> p) 
{
	int n = p.size();
	vector<bool> used(n, false);
	vector<vector<int>> adjmatrix(n, vector<int> (n, 0));

	for(int i = 0; i < n; i++)
	{
		if(used[i]) continue;
		used[i] = true;

		//Collect the component:
		vector<int> component(0);
		for(int j = 0; j < n; j++)
		{
			if(p[i][j])
			{
				component.push_back(j);
				used[j] = true;
			}
			if(p[i][j] == 3)
			{
				return 0;
			}
		}

		//Build the forest:
		vector<bool> tree(component.size(), false);
		vector<vector<int>> forest(0);
		for(int j = 0; j < (int) component.size(); j++)
		{
			if(tree[j]) continue;
			vector<int> t(0);
			for(int k = 0; k < (int) component.size(); k++)
			{
				if(p[j][k] == 1)
				{
					t.push_back(k);
					tree[k] = true;
				}
			}
			forest.push_back(t);

			//Build the tree:
			for(int k = 0; k < (int) t.size()-1; k++)
			{
				adjmatrix[t[k]][t[k+1]] = 1;
				adjmatrix[t[k+1]][t[k]] = 1;
			}
		}

		//Test the partitioning:
		for(int j = 0; j < (int) forest.size(); j++)
		{
			for(int a : forest[j])
			{
				for(int k = 0; k < (int) forest.size(); k++)
				{
					for(int b : forest[k])
					{
						if((k == j && p[a][b] != 1) ||
							(k != j && p[a][b] != 2))
							{
								return 0;
							}
					}
				}
			}
		}

		//Connect the trees:
		if(forest.size() == 2)
		{
			return 0;
		}
		if(forest.size() > 2)
		{
			for(int j = 0; j < (int) forest.size()-1; j++)
			{
				adjmatrix[forest[j][0]][forest[j+1][0]] = 1;
				adjmatrix[forest[j+1][0]][forest[j][0]] = 1;
			}
			adjmatrix[forest[0][0]][forest[forest.size()-1][0]] = 1;
			adjmatrix[forest[forest.size()-1][0]][forest[0][0]] = 1;
		}
	}

	build(adjmatrix);
	return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 7 ms 1176 KB Output is correct
7 Correct 163 ms 23260 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 7 ms 1176 KB Output is correct
7 Correct 163 ms 23260 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1252 KB Output is correct
13 Correct 167 ms 23512 KB Output is correct
14 Correct 1 ms 300 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 4 ms 852 KB Output is correct
17 Correct 66 ms 14080 KB Output is correct
18 Incorrect 0 ms 212 KB Answer gives possible 1 while actual possible 0
19 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 8 ms 1236 KB Output is correct
9 Correct 161 ms 23968 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1204 KB Output is correct
13 Correct 172 ms 23960 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 76 ms 14068 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 300 KB Output is correct
21 Incorrect 15 ms 3704 KB Answer gives possible 0 while actual possible 1
22 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 212 KB Answer gives possible 0 while actual possible 1
4 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 7 ms 1176 KB Output is correct
7 Correct 163 ms 23260 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1252 KB Output is correct
13 Correct 167 ms 23512 KB Output is correct
14 Correct 1 ms 300 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 4 ms 852 KB Output is correct
17 Correct 66 ms 14080 KB Output is correct
18 Incorrect 0 ms 212 KB Answer gives possible 1 while actual possible 0
19 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 7 ms 1176 KB Output is correct
7 Correct 163 ms 23260 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1252 KB Output is correct
13 Correct 167 ms 23512 KB Output is correct
14 Correct 1 ms 300 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 4 ms 852 KB Output is correct
17 Correct 66 ms 14080 KB Output is correct
18 Incorrect 0 ms 212 KB Answer gives possible 1 while actual possible 0
19 Halted 0 ms 0 KB -