oj.uz

Submission #977718

# Submission time Handle Problem Language Result Execution time Memory
977718 2024-05-08T10:01:23 Z SmuggingSpun Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 195 ms 18276 KB 
#include "supertrees.h"
#include<bits/stdc++.h>
using namespace std;
int construct(vector<vector<int>>p){
	int n = p.size();
	bool is_sub1 = true, is_sub2 = true, is_sub3 = true;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			if(p[i][j] != 1){
				is_sub1 = false;
			}
			if(p[i][j] > 1){
				is_sub2 = false;
			}
			if(p[i][j] != 0 && p[i][j] != 2){
				is_sub3 = false;
			}
		}
	}
	if(is_sub1){
		p = vector<vector<int>>(n, vector<int>(n, 0));
		for(int i = 1; i < n; i++){
			p[i][i - 1] = p[i - 1][i] = 1;
		}
		build(p);
		return 1;
	}
	vector<int>par(n);
	iota(par.begin(), par.end(), 0);
	function<int(int)>find_set;
	find_set = [&] (int n){
		return n == par[n] ? n : par[n] = find_set(par[n]);	
	};
	function<void(int, int)>merge = [&] (int a, int b){
		par[find_set(a)] = find_set(b);
	};
	vector<bool>vis(n, false);
	vector<vector<int>>edge(n);
	if(is_sub2){
		for(int i = 0; i < n; i++){
			if(vis[i]){
				for(int j = 0; j < n; j++){
					if(i != j && int(find_set(i) == find_set(j)) != p[i][j]){
						return 0;
					}
				}
				continue;
			}
			for(int j = 0; j < n; j++){
				if(i != j && p[i][j] == 0 && find_set(i) == find_set(j)){
					return 0;
				}
				if(p[i][j] == 1){
					merge(i, j);
					vis[j] = true;
				}
			}
		}
		for(int i = 0; i < n; i++){
			edge[find_set(i)].emplace_back(i);
		}
		p = vector<vector<int>>(n, vector<int>(n, 0));
		for(int i = 0; i < n; i++){
			for(int j = 1; j < edge[i].size(); j++){
				p[edge[i][j]][edge[i][j - 1]] = p[edge[i][j - 1]][edge[i][j]] = 1;
			}
		}
		build(p);
		return 1;
	}
	if(is_sub3){
		for(int i = 0; i < n; i++){
			if(vis[i]){
				for(int j = 0; j < n; j++){
					if(i != j && (find_set(i) == find_set(j)) != (p[i][j] == 2)){
						return 0;
					}
				}
				continue;
			}
			for(int j = 0; j < n; j++){
				if(i != j && p[i][j] == 0 && find_set(i) == find_set(j)){
					return 0;
				}
				if(p[i][j] == 2){
					merge(i, j);
					vis[j] = true;
				}
			}
		}
		for(int i = 0; i < n; i++){
			edge[find_set(i)].emplace_back(i);
		}
		p = vector<vector<int>>(n, vector<int>(n, 0));
		for(int i = 0; i < n; i++){
			if(edge[i].size() == 2){
				return 0;
			}
			if(edge[i].size() > 2){
				edge[i].emplace_back(edge[i][0]);
				for(int j = 1; j < edge[i].size(); j++){
					p[edge[i][j]][edge[i][j - 1]] = p[edge[i][j - 1]][edge[i][j]] = 1;
				}
			}
		}
		build(p);
		return 1;
	}
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:64:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |    for(int j = 1; j < edge[i].size(); j++){
      |                   ~~^~~~~~~~~~~~~~~~
supertrees.cpp:101:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |     for(int j = 1; j < edge[i].size(); j++){
      |                    ~~^~~~~~~~~~~~~~~~
supertrees.cpp:28:18: warning: control reaches end of non-void function [-Wreturn-type]
   28 |  vector<int>par(n);
      |                  ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 508 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 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1116 KB Output is correct
7 Correct 177 ms 18088 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 508 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 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1116 KB Output is correct
7 Correct 177 ms 18088 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 516 KB Output is correct
12 Correct 10 ms 1284 KB Output is correct
13 Correct 174 ms 18108 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 504 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 69 ms 8200 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 44 ms 4676 KB Output is correct
21 Correct 165 ms 18260 KB Output is correct
22 Correct 195 ms 18204 KB Output is correct
23 Correct 192 ms 18032 KB Output is correct
24 Correct 156 ms 18276 KB Output is correct
25 Correct 85 ms 8196 KB Output is correct
26 Correct 64 ms 8272 KB Output is correct
27 Correct 182 ms 18192 KB Output is correct
28 Correct 151 ms 18200 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Runtime error 3 ms 604 KB Execution killed with signal 6
5 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 2 ms 604 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 508 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 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1116 KB Output is correct
7 Correct 177 ms 18088 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 516 KB Output is correct
12 Correct 10 ms 1284 KB Output is correct
13 Correct 174 ms 18108 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 504 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 69 ms 8200 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 44 ms 4676 KB Output is correct
21 Correct 165 ms 18260 KB Output is correct
22 Correct 195 ms 18204 KB Output is correct
23 Correct 192 ms 18032 KB Output is correct
24 Correct 156 ms 18276 KB Output is correct
25 Correct 85 ms 8196 KB Output is correct
26 Correct 64 ms 8272 KB Output is correct
27 Correct 182 ms 18192 KB Output is correct
28 Correct 151 ms 18200 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Runtime error 3 ms 604 KB Execution killed with signal 6
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 508 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 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1116 KB Output is correct
7 Correct 177 ms 18088 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 516 KB Output is correct
12 Correct 10 ms 1284 KB Output is correct
13 Correct 174 ms 18108 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 504 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 69 ms 8200 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 44 ms 4676 KB Output is correct
21 Correct 165 ms 18260 KB Output is correct
22 Correct 195 ms 18204 KB Output is correct
23 Correct 192 ms 18032 KB Output is correct
24 Correct 156 ms 18276 KB Output is correct
25 Correct 85 ms 8196 KB Output is correct
26 Correct 64 ms 8272 KB Output is correct
27 Correct 182 ms 18192 KB Output is correct
28 Correct 151 ms 18200 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Runtime error 3 ms 604 KB Execution killed with signal 6
33 Halted 0 ms 0 KB -