oj.uz

Submission #829610

# Submission time Handle Problem Language Result Execution time Memory
829610 2023-08-18T13:20:56 Z faruk Connecting Supertrees (IOI20_supertrees) C++17
21 / 100
 180 ms 23016 KB 
#include "supertrees.h"
#include <iostream>
#include <vector>
#include <algorithm>
#define mp make_pair
#define all(a) a.begin(), a.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

int n;
bool check_components(vector<vector<int> > p) {
	vector<int> comp(n, -1);
	for (int i = 0; i < n; i++) {
		if (p[i][i] != 1)
			return false;
		if (comp[i] == -1) {
			for (int j = 0; j < n; j++) {
				if (p[i][j] != 0 and comp[j] != -1)
					return false;
				if (p[i][j] != 0)
					comp[j] = i;
			}
		}
		else {
			for (int j = 0; j < n; j++)
				if (p[i][j] != 0 and comp[j] != comp[i])
					return false;
		}
	}
	return true;
}

int construct(std::vector<std::vector<int>> p) {
	n = p.size();
	if (check_components(p) == false)
		return 0;
	vector<bool> visited(n);
	vector<vector<int> > out(n, vector<int>(n, 0));
	for (int i = 0; i < n; i++) {
		if (visited[i])
			continue;
		vector<int> mine;
		for (int j = 0; j < n; j++)
			if (p[i][j] != 0)
				mine.push_back(j), visited[j] = true;
		if (mine.size() == 1)
			continue;

		vector<int> all2, everyone_else;
		for (int a : mine) {
			bool has1 = false;
			for (int j : mine)
				if (p[a][j] == 1 and j != a)
					has1 = true;
			if (has1)
				everyone_else.push_back(a);
			else
				all2.push_back(a);
		}
		for (int a : everyone_else) {
			for (int b : all2)
				if (p[a][b] != 2)
					return 0;
			for (int b : everyone_else)
				if (p[a][b] != 1)
					return 0;
		}

		if (everyone_else.size() == 0) { // cycle
			/*if (all2.size() <= 2)
				return 0;*/
			for (int i = 0; i < all2.size(); i++)
			{
				int f = all2[i], s = i < (all2.size() - 1) ? all2[i + 1] : all2[0];
				out[f][s] = 1, out[s][f] = 1;
			}
		}
		else if (all2.size() == 0) {// line
			for (int i = 0; i < everyone_else.size() - 1; i++)
			{
				int f = everyone_else[i], s = everyone_else[i + 1];
				out[f][s] = 1, out[s][f] = 1;
			}
		}
		else {
			// made cycle chain
			for (int i = 0; i < all2.size() - 1; i++)
			{
				int f = all2[i], s = all2[i + 1];
				out[f][s] = 1, out[s][f] = 1;
			}
			/*if (all2.size() == 1)
				return 0;*/

			// made one chain
			for (int i = 0; i < everyone_else.size() - 1; i++)
			{
				int f = everyone_else[i], s = everyone_else[i + 1];
				out[f][s] = 1, out[s][f] = 1;
			}

			int A = everyone_else[0], B = all2[0], C = all2.back();
			out[A][B] = 1;
			out[B][A] = 1;
			out[A][C] = 1;
			out[C][A] = 1;
		}
	}
	build(out);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:75:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |    for (int i = 0; i < all2.size(); i++)
      |                    ~~^~~~~~~~~~~~~
supertrees.cpp:77:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |     int f = all2[i], s = i < (all2.size() - 1) ? all2[i + 1] : all2[0];
      |                          ~~^~~~~~~~~~~~~~~~~~~
supertrees.cpp:82:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |    for (int i = 0; i < everyone_else.size() - 1; i++)
      |                    ~~^~~~~~~~~~~~~~~~~~~~~~~~~~
supertrees.cpp:90:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |    for (int i = 0; i < all2.size() - 1; i++)
      |                    ~~^~~~~~~~~~~~~~~~~
supertrees.cpp:99:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |    for (int i = 0; i < everyone_else.size() - 1; i++)
      |                    ~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 7 ms 1248 KB Output is correct
7 Correct 163 ms 23016 KB Output is correct
8 Correct 0 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 0 ms 300 KB Output is correct
12 Correct 7 ms 1208 KB Output is correct
13 Correct 157 ms 22924 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 828 KB Output is correct
17 Correct 85 ms 13016 KB Output is correct
18 Correct 0 ms 304 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 39 ms 6252 KB Output is correct
21 Correct 158 ms 22908 KB Output is correct
22 Correct 163 ms 22868 KB Output is correct
23 Correct 161 ms 22944 KB Output is correct
24 Correct 162 ms 22916 KB Output is correct
25 Correct 68 ms 13004 KB Output is correct
26 Correct 68 ms 13032 KB Output is correct
27 Correct 169 ms 22960 KB Output is correct
28 Correct 155 ms 22884 KB Output is correct

Subtask #3
0 / 19.0

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

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 39 ms 6228 KB Output is correct
5 Correct 178 ms 22884 KB Output is correct
6 Correct 180 ms 22872 KB Output is correct
7 Correct 164 ms 22844 KB Output is correct
8 Correct 0 ms 300 KB Output is correct
9 Correct 39 ms 6168 KB Output is correct
10 Correct 154 ms 22844 KB Output is correct
11 Correct 166 ms 22864 KB Output is correct
12 Correct 175 ms 22924 KB Output is correct
13 Correct 1 ms 304 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Incorrect 17 ms 3736 KB Answer gives possible 0 while actual possible 1
17 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 7 ms 1248 KB Output is correct
7 Correct 163 ms 23016 KB Output is correct
8 Correct 0 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 0 ms 300 KB Output is correct
12 Correct 7 ms 1208 KB Output is correct
13 Correct 157 ms 22924 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 828 KB Output is correct
17 Correct 85 ms 13016 KB Output is correct
18 Correct 0 ms 304 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 39 ms 6252 KB Output is correct
21 Correct 158 ms 22908 KB Output is correct
22 Correct 163 ms 22868 KB Output is correct
23 Correct 161 ms 22944 KB Output is correct
24 Correct 162 ms 22916 KB Output is correct
25 Correct 68 ms 13004 KB Output is correct
26 Correct 68 ms 13032 KB Output is correct
27 Correct 169 ms 22960 KB Output is correct
28 Correct 155 ms 22884 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 304 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Incorrect 1 ms 212 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 7 ms 1248 KB Output is correct
7 Correct 163 ms 23016 KB Output is correct
8 Correct 0 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 0 ms 300 KB Output is correct
12 Correct 7 ms 1208 KB Output is correct
13 Correct 157 ms 22924 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 828 KB Output is correct
17 Correct 85 ms 13016 KB Output is correct
18 Correct 0 ms 304 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 39 ms 6252 KB Output is correct
21 Correct 158 ms 22908 KB Output is correct
22 Correct 163 ms 22868 KB Output is correct
23 Correct 161 ms 22944 KB Output is correct
24 Correct 162 ms 22916 KB Output is correct
25 Correct 68 ms 13004 KB Output is correct
26 Correct 68 ms 13032 KB Output is correct
27 Correct 169 ms 22960 KB Output is correct
28 Correct 155 ms 22884 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 304 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Incorrect 1 ms 212 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -