oj.uz

Submission #977464

# Submission time Handle Problem Language Result Execution time Memory
977464 2024-05-08T03:00:36 Z Amaarsaa Connecting Supertrees (IOI20_supertrees) C++14
40 / 100
 184 ms 22212 KB 
#include<bits/stdc++.h>
#include "supertrees.h"
using namespace std;
vector < int > adj[1002];
int ataman[10002], used[1002], at[1002];
int Get(int x) {
	if ( x == ataman[x]) return x;
	return ataman[x] = Get(ataman[x]);
}
void Unite(int x, int y) {
	x = Get(x);
	y = Get(y);
	if (x == y) return ;
	if ( x < y) swap(x, y);
	ataman[x]= y;
}
int construct(vector<vector<int>> a) {
	int n = a.size(), i, j;
	vector < vector < int > > ans(n, vector<int>(n, 0));
	for (i = 0; i < n; i ++) ataman[i]= i;
	int s = 1;
	for ( i = 0; i < n; i++) {
		for ( j = 0; j < n; j ++) {
			if ( a[i][j] == 1 && i != j) Unite(i, j);
		}
	}
	for (i = 0; i < n; i ++) {
		for (j = 0; j < n; j ++) {
			if ( i == j) continue;
			if ( (a[i][j] == 0 || a[i][j] == 3) && Get(i) == Get(j)) s= 0;
			if ( a[i][j] == 1 && Get(i) != Get(j)) s = 0; 
		}
	}
	
	for (i = 0; i < n; i ++) {
		vector < int > v;
		v.push_back(i);
		for (j = i + 1; j < n; j ++) {
			if ( Get(j) == Get(i) && !used[j]) v.push_back(j);
		}
		used[i] = 1;
		for (j = 1; j < v.size(); j ++) {
			used[v[j]] = 1;
			ans[v[j]][v[j - 1]] = ans[v[j - 1]][v[j]] = 1;
		}
		
	}
	for (i = 0; i < n; i ++) at[i] = Get(i);
	for (i = 0; i < n; i ++) ataman[i] = i;
	for (i = 0; i < n; i ++) {
		for (j = 0; j < n; j ++) {
			if ( a[i][j] == 2 && i != j) Unite(i, j);
		}
	}
	for (i = 0; i < n; i ++) used[i] = 0;
	for (i = 0; i < n; i ++) {
		for (j = 0; j < n; j ++) {
			if ( i == j) continue;
			if ( (a[i][j] == 0 || a[i][j] == 3) && Get(i) == Get(j)) s= 0;
			if ( a[i][j] == 2 && Get(i) != Get(j)) s = 0; 
		}
	}
	
	for (i = 0; i < n; i ++) {
		vector < int > v;
		v.push_back(at[i]);
		for (j = i + 1; j < n; j ++) {
			if ( Get(j) == Get(i) && !used[at[j]]) v.push_back(at[j]);
		}
		if(v.size() == 1) continue;
		if ( v.size() == 2){
			s = 0;
			break;
		}
		used[at[i]] = 1;
		for (j = 1; j < v.size(); j ++) {
			used[v[j]] = 1;
			ans[v[j]][v[j - 1]] = ans[v[j - 1]][v[j]] = 1;
		}
		ans[v[0]][v[v.size() -1]] = ans[v[v.size() -1]][v[0]] = 1;
		
	}
	if ( s == 0) return 0;
	build(ans);
	return s;
}
/*
vector < vector < int > > b;
inp() {
	int n, i, j, x;
	cin >>n;
	b.resize(n);
	for (i = 0; i < n; i ++) {
		for (j = 0; j < n; j ++) {
			cin >> x;
			b[i].push_back(x);
		}
	}
}
int main() {
	inp();
	cout << construct(b) << endl;
}
*/

Compilation message

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

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

Subtask #2
10.0 / 10.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 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 7 ms 1372 KB Output is correct
7 Correct 166 ms 22040 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 164 ms 22096 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 4 ms 880 KB Output is correct
17 Correct 92 ms 12272 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 500 KB Output is correct
20 Correct 42 ms 5796 KB Output is correct
21 Correct 165 ms 22096 KB Output is correct
22 Correct 163 ms 22100 KB Output is correct
23 Correct 168 ms 22048 KB Output is correct
24 Correct 167 ms 22048 KB Output is correct
25 Correct 75 ms 12116 KB Output is correct
26 Correct 79 ms 12116 KB Output is correct
27 Correct 175 ms 22160 KB Output is correct
28 Correct 165 ms 22028 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 432 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 7 ms 1112 KB Output is correct
9 Correct 169 ms 22096 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 7 ms 1216 KB Output is correct
13 Correct 181 ms 22212 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 94 ms 12356 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 42 ms 5872 KB Output is correct
22 Correct 172 ms 22096 KB Output is correct
23 Correct 165 ms 22052 KB Output is correct
24 Correct 168 ms 22064 KB Output is correct
25 Correct 74 ms 12304 KB Output is correct
26 Correct 76 ms 12116 KB Output is correct
27 Correct 164 ms 22036 KB Output is correct
28 Correct 172 ms 22068 KB Output is correct
29 Correct 74 ms 12080 KB Output is correct

Subtask #4
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 42 ms 5752 KB Output is correct
5 Correct 172 ms 22128 KB Output is correct
6 Correct 163 ms 22212 KB Output is correct
7 Correct 169 ms 22008 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 42 ms 5716 KB Output is correct
10 Correct 184 ms 22096 KB Output is correct
11 Correct 174 ms 22152 KB Output is correct
12 Correct 166 ms 22068 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Incorrect 1 ms 348 KB Too few ways to get from 0 to 1, should be 2 found 1
16 Halted 0 ms 0 KB -

Subtask #5
0 / 21.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 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 7 ms 1372 KB Output is correct
7 Correct 166 ms 22040 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 164 ms 22096 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 4 ms 880 KB Output is correct
17 Correct 92 ms 12272 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 500 KB Output is correct
20 Correct 42 ms 5796 KB Output is correct
21 Correct 165 ms 22096 KB Output is correct
22 Correct 163 ms 22100 KB Output is correct
23 Correct 168 ms 22048 KB Output is correct
24 Correct 167 ms 22048 KB Output is correct
25 Correct 75 ms 12116 KB Output is correct
26 Correct 79 ms 12116 KB Output is correct
27 Correct 175 ms 22160 KB Output is correct
28 Correct 165 ms 22028 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 432 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 7 ms 1112 KB Output is correct
37 Correct 169 ms 22096 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 7 ms 1216 KB Output is correct
41 Correct 181 ms 22212 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 4 ms 860 KB Output is correct
45 Correct 94 ms 12356 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 42 ms 5872 KB Output is correct
50 Correct 172 ms 22096 KB Output is correct
51 Correct 165 ms 22052 KB Output is correct
52 Correct 168 ms 22064 KB Output is correct
53 Correct 74 ms 12304 KB Output is correct
54 Correct 76 ms 12116 KB Output is correct
55 Correct 164 ms 22036 KB Output is correct
56 Correct 172 ms 22068 KB Output is correct
57 Correct 74 ms 12080 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 6 ms 880 KB Output is correct
61 Correct 96 ms 12116 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 Incorrect 42 ms 5792 KB b[7][7] is not 0
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.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 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 7 ms 1372 KB Output is correct
7 Correct 166 ms 22040 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 164 ms 22096 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 4 ms 880 KB Output is correct
17 Correct 92 ms 12272 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 500 KB Output is correct
20 Correct 42 ms 5796 KB Output is correct
21 Correct 165 ms 22096 KB Output is correct
22 Correct 163 ms 22100 KB Output is correct
23 Correct 168 ms 22048 KB Output is correct
24 Correct 167 ms 22048 KB Output is correct
25 Correct 75 ms 12116 KB Output is correct
26 Correct 79 ms 12116 KB Output is correct
27 Correct 175 ms 22160 KB Output is correct
28 Correct 165 ms 22028 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 432 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 7 ms 1112 KB Output is correct
37 Correct 169 ms 22096 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 7 ms 1216 KB Output is correct
41 Correct 181 ms 22212 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 4 ms 860 KB Output is correct
45 Correct 94 ms 12356 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 42 ms 5872 KB Output is correct
50 Correct 172 ms 22096 KB Output is correct
51 Correct 165 ms 22052 KB Output is correct
52 Correct 168 ms 22064 KB Output is correct
53 Correct 74 ms 12304 KB Output is correct
54 Correct 76 ms 12116 KB Output is correct
55 Correct 164 ms 22036 KB Output is correct
56 Correct 172 ms 22068 KB Output is correct
57 Correct 74 ms 12080 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 42 ms 5752 KB Output is correct
62 Correct 172 ms 22128 KB Output is correct
63 Correct 163 ms 22212 KB Output is correct
64 Correct 169 ms 22008 KB Output is correct
65 Correct 1 ms 344 KB Output is correct
66 Correct 42 ms 5716 KB Output is correct
67 Correct 184 ms 22096 KB Output is correct
68 Correct 174 ms 22152 KB Output is correct
69 Correct 166 ms 22068 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Incorrect 1 ms 348 KB Too few ways to get from 0 to 1, should be 2 found 1
73 Halted 0 ms 0 KB -