oj.uz

Submission #1043739

# Submission time Handle Problem Language Result Execution time Memory
1043739 2024-08-04T15:38:21 Z DeathIsAwe Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 125 ms 22296 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

int construct(vector<vector<int>> p) {
	int n = p.size(), prev;
	vector<vector<int>> ans(n), forest;
	vector<int> tree;
	bool visited[n];
	for (int i=0;i<n;i++) {
		visited[i] = false;
		for (int j=0;j<n;j++) {
			ans[i].push_back(0);
		}
	}



	for (int i=0;i<n;i++) {
		if (visited[i]) {
			continue;
		}
		visited[i] = true;
		tree.clear(); tree.push_back(i);
		for (int j=0;j<n;j++) {
			if (j == i) {
				continue;
			}
			if (p[i][j] == 1) {
				if (visited[j]) {
					return 0;
				}
				visited[j] = true;
				tree.push_back(j);
			} else if (p[i][j] == 3) {
				return 0;
			}
		}
		prev = i;
		for (int j: tree) {
			ans[prev][j] = 1;
			ans[j][prev] = 1;
			prev = j;
		}
		ans[i][i] = 0;
		for (int j: tree) {
			for (int k: tree) {
				if (p[j][k] != 1) {
					return 0;
				}
			}
		}
		forest.push_back(tree);
	}
	


	//for (vector<int> i: forest) {
	//	for (int j: i) {
	//		cout << j << ' ';
	//	}
	//	cout << '\n';
	//}
	for (int i=0;i<n;i++) {
		visited[i] = false;
	}
	vector<int> group;
	vector<int> grouptags(forest.size(), -1);
	for (int i=0;i<forest.size();i++) {
		if (visited[forest[i][0]]) {
			continue;
		}
		visited[forest[i][0]] = true;
		group = {i};
		grouptags[i] = i;
		for (int j=i+1;j<forest.size();j++) {
			if (p[forest[i][0]][forest[j][0]] == 2) {
				visited[forest[j][0]] = true;
				group.push_back(j);
				grouptags[j] = 0;
			}
		}
		if (group.size() == 2) {
			return 0;
		}
		for (int j: group) {
			for (int k=0;k<forest.size();k++) {
				if (j == k) {
					continue;
				}
				if (grouptags[k] != i) {
					for (int l: forest[k]) {
						for (int m: forest[j]) {
							if (p[m][l] != 0) {
								return 0;
							}
						}
					}
				} else {
					for (int l: forest[k]) {
						for (int m: forest[j]) {
							if (p[m][l] != 2) {
								return 0;
							}
						}
					}
				}
			}
		}
		prev = forest[i][0];
		for (int j: group) {
			ans[prev][forest[j][0]] = 1;
			ans[forest[j][0]][prev] = 1;
			prev = forest[j][0];
		}
		ans[forest[i][0]][forest[i][0]] = 0;
		if (prev ==forest[i][0]) {
			continue;
		}
		ans[prev][forest[i][0]] = 1;
		ans[forest[i][0]][prev] = 1;
	}


	
	build(ans);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:69:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |  for (int i=0;i<forest.size();i++) {
      |               ~^~~~~~~~~~~~~~
supertrees.cpp:76:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |   for (int j=i+1;j<forest.size();j++) {
      |                  ~^~~~~~~~~~~~~~
supertrees.cpp:87:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   87 |    for (int k=0;k<forest.size();k++) {
      |                 ~^~~~~~~~~~~~~~

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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 1368 KB Output is correct
7 Correct 96 ms 22100 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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 1368 KB Output is correct
7 Correct 96 ms 22100 KB Output is correct
8 Correct 0 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 0 ms 348 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 104 ms 22160 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 47 ms 12316 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 24 ms 5768 KB Output is correct
21 Correct 97 ms 22036 KB Output is correct
22 Correct 100 ms 22096 KB Output is correct
23 Correct 125 ms 22096 KB Output is correct
24 Correct 106 ms 22100 KB Output is correct
25 Correct 43 ms 12116 KB Output is correct
26 Correct 42 ms 12292 KB Output is correct
27 Correct 103 ms 22096 KB Output is correct
28 Correct 98 ms 22096 KB Output is correct

Subtask #3
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 4 ms 1372 KB Output is correct
9 Correct 111 ms 22296 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 4 ms 1368 KB Output is correct
13 Correct 100 ms 22280 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 46 ms 12296 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Incorrect 13 ms 3420 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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 24 ms 5724 KB Output is correct
5 Correct 101 ms 22096 KB Output is correct
6 Correct 100 ms 22296 KB Output is correct
7 Correct 103 ms 22280 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Incorrect 11 ms 3440 KB Answer gives possible 0 while actual possible 1
10 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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 1368 KB Output is correct
7 Correct 96 ms 22100 KB Output is correct
8 Correct 0 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 0 ms 348 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 104 ms 22160 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 47 ms 12316 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 24 ms 5768 KB Output is correct
21 Correct 97 ms 22036 KB Output is correct
22 Correct 100 ms 22096 KB Output is correct
23 Correct 125 ms 22096 KB Output is correct
24 Correct 106 ms 22100 KB Output is correct
25 Correct 43 ms 12116 KB Output is correct
26 Correct 42 ms 12292 KB Output is correct
27 Correct 103 ms 22096 KB Output is correct
28 Correct 98 ms 22096 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 4 ms 1372 KB Output is correct
37 Correct 111 ms 22296 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 4 ms 1368 KB Output is correct
41 Correct 100 ms 22280 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 2 ms 860 KB Output is correct
45 Correct 46 ms 12296 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Incorrect 13 ms 3420 KB Answer gives possible 0 while actual possible 1
50 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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 1368 KB Output is correct
7 Correct 96 ms 22100 KB Output is correct
8 Correct 0 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 0 ms 348 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 104 ms 22160 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 47 ms 12316 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 24 ms 5768 KB Output is correct
21 Correct 97 ms 22036 KB Output is correct
22 Correct 100 ms 22096 KB Output is correct
23 Correct 125 ms 22096 KB Output is correct
24 Correct 106 ms 22100 KB Output is correct
25 Correct 43 ms 12116 KB Output is correct
26 Correct 42 ms 12292 KB Output is correct
27 Correct 103 ms 22096 KB Output is correct
28 Correct 98 ms 22096 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 4 ms 1372 KB Output is correct
37 Correct 111 ms 22296 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 4 ms 1368 KB Output is correct
41 Correct 100 ms 22280 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 2 ms 860 KB Output is correct
45 Correct 46 ms 12296 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Incorrect 13 ms 3420 KB Answer gives possible 0 while actual possible 1
50 Halted 0 ms 0 KB -