oj.uz

Submission #1049967

# Submission time Handle Problem Language Result Execution time Memory
1049967 2024-08-09T06:26:42 Z TahirAliyev Connecting Supertrees (IOI20_supertrees) C++17
100 / 100
 122 ms 24404 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

int n;
const int MAX = 1005;

struct DSU{
	int par[MAX];
	vector<int> c[MAX];
	void init(){
		memset(par, -1, sizeof(par));
		for(int i = 0; i < n; i++) c[i] = {i};
	}
	int get(int u){
		if(par[u] < 0) return u;
		return par[u] = get(par[u]);
	}
	bool unite(int u, int v){
		u = get(u), v = get(v);
		if(u == v) return 0;
		if(-par[u] < -par[v]) swap(u, v);
		par[u] += par[v];
		par[v] = u;
		for(int a : c[v]) c[u].push_back(a);
		return 1;
	}
};

DSU dsu;
vector<vector<int>> ans;
vector<int> g[MAX];
int bad[MAX];

vector<int> cnt;
int vis[MAX];
void dfs(int node){
	cnt[node]++;
	vis[node] = 1;
	for(int to : g[node]){
		if(vis[to]) continue;
		dfs(to);
	}
	vis[node] = 0;
}

int construct(vector<vector<int>> p) {
	n = p.size();
	ans.resize(n);
	for(int i = 0; i < n; i++){
		ans[i].resize(n);
	}
	dsu.init();
	for(int i = 0; i < n; i++){
		for(int j = i + 1; j < n; j++){
			if(p[i][j] == 1){
				bad[i] = 1;
				ans[i][j] = 1;
				ans[j][i] = 1;
				g[i].push_back(j);
				g[j].push_back(i);
				break;
			}
		}
	}
	for(int i = 0; i < n; i++){
		if(bad[i]) continue;
		for(int j = i + 1; j < n; j++){
			if(bad[j]) continue;
			if(p[i][j] == 2) dsu.unite(i, j);
		}
	}
	for(int i = 0; i < n; i++){
		if(bad[i]) continue;
		if(dsu.par[i] >= 0) continue;
		vector<int> v = dsu.c[i];
		for(int j = 0; j + 1 < v.size(); j++){
			ans[v[j]][v[j + 1]] = 1;
			ans[v[j + 1]][v[j]] = 1;
			g[v[j]].push_back(v[j + 1]);
			g[v[j + 1]].push_back(v[j]);
		}
		if(v.size() > 2){
			ans[v[0]][v.back()] = 1;
			ans[v.back()][v[0]] = 1;
			g[v[0]].push_back(v.back());
			g[v.back()].push_back(v[0]);
		}
	}
	// for(int i = 0; i < n; i++){
	// 	for(int j = 0; j < n; j++){
	// 		cout << ans[i][j] << ' ';
	// 	}
	// 	cout << '\n';
	// }
	cnt.resize(n, 0);
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			vis[j] = 0;
			cnt[j] = 0;
		} 
		dfs(i);
		if(p[i] != cnt){
			return 0;
		}
	}
	build(ans);
	return 1;
}

Compilation message

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

Subtask #1
11.0 / 11.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 5 ms 1372 KB Output is correct
7 Correct 107 ms 24176 KB Output is correct

Subtask #2
10.0 / 10.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 5 ms 1372 KB Output is correct
7 Correct 107 ms 24176 KB Output is correct
8 Correct 1 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 4 ms 1368 KB Output is correct
13 Correct 95 ms 24036 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 884 KB Output is correct
17 Correct 50 ms 14152 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 6336 KB Output is correct
21 Correct 97 ms 24152 KB Output is correct
22 Correct 95 ms 24148 KB Output is correct
23 Correct 113 ms 24404 KB Output is correct
24 Correct 98 ms 24004 KB Output is correct
25 Correct 42 ms 14148 KB Output is correct
26 Correct 43 ms 14164 KB Output is correct
27 Correct 107 ms 24144 KB Output is correct
28 Correct 95 ms 24052 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 1172 KB Output is correct
9 Correct 111 ms 22104 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 122 ms 22356 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 48 ms 12368 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 23 ms 5844 KB Output is correct
22 Correct 99 ms 22100 KB Output is correct
23 Correct 94 ms 22096 KB Output is correct
24 Correct 108 ms 22096 KB Output is correct
25 Correct 40 ms 12112 KB Output is correct
26 Correct 42 ms 12372 KB Output is correct
27 Correct 97 ms 22084 KB Output is correct
28 Correct 109 ms 22100 KB Output is correct
29 Correct 41 ms 12124 KB Output is correct

Subtask #4
35.0 / 35.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 24 ms 6440 KB Output is correct
5 Correct 97 ms 24256 KB Output is correct
6 Correct 102 ms 24148 KB Output is correct
7 Correct 103 ms 24236 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 25 ms 6292 KB Output is correct
10 Correct 98 ms 24148 KB Output is correct
11 Correct 94 ms 23944 KB Output is correct
12 Correct 113 ms 24108 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 25 ms 6296 KB Output is correct
17 Correct 97 ms 24260 KB Output is correct
18 Correct 97 ms 24260 KB Output is correct
19 Correct 96 ms 24148 KB Output is correct
20 Correct 108 ms 24148 KB Output is correct

Subtask #5
21.0 / 21.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 5 ms 1372 KB Output is correct
7 Correct 107 ms 24176 KB Output is correct
8 Correct 1 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 4 ms 1368 KB Output is correct
13 Correct 95 ms 24036 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 884 KB Output is correct
17 Correct 50 ms 14152 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 6336 KB Output is correct
21 Correct 97 ms 24152 KB Output is correct
22 Correct 95 ms 24148 KB Output is correct
23 Correct 113 ms 24404 KB Output is correct
24 Correct 98 ms 24004 KB Output is correct
25 Correct 42 ms 14148 KB Output is correct
26 Correct 43 ms 14164 KB Output is correct
27 Correct 107 ms 24144 KB Output is correct
28 Correct 95 ms 24052 KB Output is correct
29 Correct 0 ms 344 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 1172 KB Output is correct
37 Correct 111 ms 22104 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 5 ms 1372 KB Output is correct
41 Correct 122 ms 22356 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 2 ms 860 KB Output is correct
45 Correct 48 ms 12368 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 23 ms 5844 KB Output is correct
50 Correct 99 ms 22100 KB Output is correct
51 Correct 94 ms 22096 KB Output is correct
52 Correct 108 ms 22096 KB Output is correct
53 Correct 40 ms 12112 KB Output is correct
54 Correct 42 ms 12372 KB Output is correct
55 Correct 97 ms 22084 KB Output is correct
56 Correct 109 ms 22100 KB Output is correct
57 Correct 41 ms 12124 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 2 ms 860 KB Output is correct
61 Correct 45 ms 14280 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 24 ms 6476 KB Output is correct
66 Correct 42 ms 14160 KB Output is correct
67 Correct 47 ms 14132 KB Output is correct
68 Correct 41 ms 14272 KB Output is correct
69 Correct 41 ms 14140 KB Output is correct

Subtask #6
4.0 / 4.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 5 ms 1372 KB Output is correct
7 Correct 107 ms 24176 KB Output is correct
8 Correct 1 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 4 ms 1368 KB Output is correct
13 Correct 95 ms 24036 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 884 KB Output is correct
17 Correct 50 ms 14152 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 6336 KB Output is correct
21 Correct 97 ms 24152 KB Output is correct
22 Correct 95 ms 24148 KB Output is correct
23 Correct 113 ms 24404 KB Output is correct
24 Correct 98 ms 24004 KB Output is correct
25 Correct 42 ms 14148 KB Output is correct
26 Correct 43 ms 14164 KB Output is correct
27 Correct 107 ms 24144 KB Output is correct
28 Correct 95 ms 24052 KB Output is correct
29 Correct 0 ms 344 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 1172 KB Output is correct
37 Correct 111 ms 22104 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 5 ms 1372 KB Output is correct
41 Correct 122 ms 22356 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 2 ms 860 KB Output is correct
45 Correct 48 ms 12368 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 23 ms 5844 KB Output is correct
50 Correct 99 ms 22100 KB Output is correct
51 Correct 94 ms 22096 KB Output is correct
52 Correct 108 ms 22096 KB Output is correct
53 Correct 40 ms 12112 KB Output is correct
54 Correct 42 ms 12372 KB Output is correct
55 Correct 97 ms 22084 KB Output is correct
56 Correct 109 ms 22100 KB Output is correct
57 Correct 41 ms 12124 KB Output is correct
58 Correct 0 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 24 ms 6440 KB Output is correct
62 Correct 97 ms 24256 KB Output is correct
63 Correct 102 ms 24148 KB Output is correct
64 Correct 103 ms 24236 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 25 ms 6292 KB Output is correct
67 Correct 98 ms 24148 KB Output is correct
68 Correct 94 ms 23944 KB Output is correct
69 Correct 113 ms 24108 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 25 ms 6296 KB Output is correct
74 Correct 97 ms 24260 KB Output is correct
75 Correct 97 ms 24260 KB Output is correct
76 Correct 96 ms 24148 KB Output is correct
77 Correct 108 ms 24148 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 2 ms 860 KB Output is correct
81 Correct 45 ms 14280 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 24 ms 6476 KB Output is correct
86 Correct 42 ms 14160 KB Output is correct
87 Correct 47 ms 14132 KB Output is correct
88 Correct 41 ms 14272 KB Output is correct
89 Correct 41 ms 14140 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 0 ms 348 KB Output is correct
92 Correct 2 ms 860 KB Output is correct
93 Correct 42 ms 14144 KB Output is correct
94 Correct 0 ms 348 KB Output is correct
95 Correct 0 ms 348 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Correct 11 ms 3988 KB Output is correct
98 Correct 42 ms 14164 KB Output is correct
99 Correct 44 ms 14164 KB Output is correct
100 Correct 42 ms 14272 KB Output is correct
101 Correct 40 ms 14160 KB Output is correct
102 Correct 42 ms 14164 KB Output is correct
103 Correct 44 ms 14164 KB Output is correct
104 Correct 47 ms 14260 KB Output is correct
105 Correct 59 ms 14164 KB Output is correct