oj.uz

Submission #771100

# Submission time Handle Problem Language Result Execution time Memory
771100 2023-07-02T12:45:35 Z OrazB Connecting Supertrees (IOI20_supertrees) C++14
56 / 100
 191 ms 30384 KB 
#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
#define N 100005
#define wr cout << "Continue debugging\n";
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second
 
vector<int> vec[N];
 
int construct(vector<vector<int>> p){
	int n = p.size();
	vector<vector<int>> b(n, vector<int>(n, 0));
	vector<int> vis(n, 0), ok(n, 0);
	int cnt = 0;
	for (int i = 0; i < n; i++){
		if (vis[i]){ 
			if (p[i] != vec[vis[i]]) return 0;
			continue;
		}
		cnt++;
		for (int j = 0; j < n; j++){
			if (p[i][j] and i != j){
				if (p[i][j] == 1){
					b[i][j] = b[j][i] = 1;
					vis[j] = cnt;
				}
			}
			vec[cnt].pb(p[i][j]);
		}
	}
	for (int i = 0; i < n; i++){
		if (vis[i] or ok[i]) continue;
		deque<int> v;
		for (int j = 0; j < n; j++){
			if (p[i][j] == 2 and !vis[j]){
				ok[j] = 1;
				v.pb(j);
			}
		}
		if (!v.size()) continue;
		if (v.size() == 1) return 0;
		v.push_front(i);
		for (int j = 0; j < v.size(); j++){
			for (int k = j+1; k < v.size(); k++) if (p[v[j]][v[k]] != 2) return 0;
		}
		b[v[0]][v.back()] = b[v.back()][v[0]] = 1;
		for (int j = 1; j < v.size(); j++){
			b[v[j-1]][v[j]] = b[v[j]][v[j-1]] = 1;
		}
	}
	// for (int i = 0; i < n; i++){
	// 	for (int j = 0; j < n; j++) cout << b[i][j] << ' ';
	// 	cout << '\n';
	// }
	build(b);
	return 1;
}
// int main ()
// {
// 	int n;
// 	cin >> n;
// 	vector<vector<int>> p(n, vector<int>(n));
// 	for (int i = 0; i < n; i++){
// 		for (int j = 0; j < n; j++) cin >> p[i][j];
// 	}
// 	int x = construct(p);
// }

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:48:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |   for (int j = 0; j < v.size(); j++){
      |                   ~~^~~~~~~~~~
supertrees.cpp:49:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |    for (int k = j+1; k < v.size(); k++) if (p[v[j]][v[k]] != 2) return 0;
      |                      ~~^~~~~~~~~~
supertrees.cpp:52:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |   for (int j = 1; j < v.size(); j++){
      |                   ~~^~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 8 ms 3540 KB Output is correct
7 Correct 164 ms 24384 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 8 ms 3540 KB Output is correct
7 Correct 164 ms 24384 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 8 ms 3668 KB Output is correct
13 Correct 168 ms 28344 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 5 ms 3028 KB Output is correct
17 Correct 82 ms 14392 KB Output is correct
18 Correct 1 ms 2644 KB Output is correct
19 Correct 1 ms 2644 KB Output is correct
20 Correct 42 ms 8240 KB Output is correct
21 Correct 167 ms 24384 KB Output is correct
22 Correct 165 ms 25904 KB Output is correct
23 Correct 191 ms 24396 KB Output is correct
24 Correct 169 ms 28220 KB Output is correct
25 Correct 79 ms 14520 KB Output is correct
26 Correct 76 ms 15548 KB Output is correct
27 Correct 171 ms 24368 KB Output is correct
28 Correct 167 ms 28364 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 2 ms 2648 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 8 ms 3796 KB Output is correct
9 Correct 168 ms 30384 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 8 ms 3796 KB Output is correct
13 Correct 167 ms 30244 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 1 ms 2648 KB Output is correct
16 Correct 6 ms 3412 KB Output is correct
17 Correct 85 ms 20384 KB Output is correct
18 Correct 1 ms 2644 KB Output is correct
19 Correct 1 ms 2644 KB Output is correct
20 Correct 1 ms 2644 KB Output is correct
21 Correct 47 ms 9584 KB Output is correct
22 Correct 168 ms 30332 KB Output is correct
23 Correct 168 ms 30164 KB Output is correct
24 Correct 171 ms 30360 KB Output is correct
25 Correct 80 ms 20392 KB Output is correct
26 Incorrect 168 ms 30380 KB Answer gives possible 1 while actual possible 0
27 Halted 0 ms 0 KB -

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 42 ms 8232 KB Output is correct
5 Correct 163 ms 24396 KB Output is correct
6 Correct 165 ms 26140 KB Output is correct
7 Correct 169 ms 24368 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 43 ms 9016 KB Output is correct
10 Correct 171 ms 28492 KB Output is correct
11 Correct 167 ms 28524 KB Output is correct
12 Correct 172 ms 28364 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 42 ms 8960 KB Output is correct
17 Correct 168 ms 28356 KB Output is correct
18 Correct 165 ms 26560 KB Output is correct
19 Correct 166 ms 26816 KB Output is correct
20 Correct 169 ms 28356 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 8 ms 3540 KB Output is correct
7 Correct 164 ms 24384 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 8 ms 3668 KB Output is correct
13 Correct 168 ms 28344 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 5 ms 3028 KB Output is correct
17 Correct 82 ms 14392 KB Output is correct
18 Correct 1 ms 2644 KB Output is correct
19 Correct 1 ms 2644 KB Output is correct
20 Correct 42 ms 8240 KB Output is correct
21 Correct 167 ms 24384 KB Output is correct
22 Correct 165 ms 25904 KB Output is correct
23 Correct 191 ms 24396 KB Output is correct
24 Correct 169 ms 28220 KB Output is correct
25 Correct 79 ms 14520 KB Output is correct
26 Correct 76 ms 15548 KB Output is correct
27 Correct 171 ms 24368 KB Output is correct
28 Correct 167 ms 28364 KB Output is correct
29 Correct 1 ms 2644 KB Output is correct
30 Correct 1 ms 2644 KB Output is correct
31 Correct 1 ms 2644 KB Output is correct
32 Correct 1 ms 2644 KB Output is correct
33 Correct 2 ms 2648 KB Output is correct
34 Correct 1 ms 2644 KB Output is correct
35 Correct 1 ms 2652 KB Output is correct
36 Correct 8 ms 3796 KB Output is correct
37 Correct 168 ms 30384 KB Output is correct
38 Correct 1 ms 2644 KB Output is correct
39 Correct 1 ms 2644 KB Output is correct
40 Correct 8 ms 3796 KB Output is correct
41 Correct 167 ms 30244 KB Output is correct
42 Correct 1 ms 2644 KB Output is correct
43 Correct 1 ms 2648 KB Output is correct
44 Correct 6 ms 3412 KB Output is correct
45 Correct 85 ms 20384 KB Output is correct
46 Correct 1 ms 2644 KB Output is correct
47 Correct 1 ms 2644 KB Output is correct
48 Correct 1 ms 2644 KB Output is correct
49 Correct 47 ms 9584 KB Output is correct
50 Correct 168 ms 30332 KB Output is correct
51 Correct 168 ms 30164 KB Output is correct
52 Correct 171 ms 30360 KB Output is correct
53 Correct 80 ms 20392 KB Output is correct
54 Incorrect 168 ms 30380 KB Answer gives possible 1 while actual possible 0
55 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 8 ms 3540 KB Output is correct
7 Correct 164 ms 24384 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 8 ms 3668 KB Output is correct
13 Correct 168 ms 28344 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 5 ms 3028 KB Output is correct
17 Correct 82 ms 14392 KB Output is correct
18 Correct 1 ms 2644 KB Output is correct
19 Correct 1 ms 2644 KB Output is correct
20 Correct 42 ms 8240 KB Output is correct
21 Correct 167 ms 24384 KB Output is correct
22 Correct 165 ms 25904 KB Output is correct
23 Correct 191 ms 24396 KB Output is correct
24 Correct 169 ms 28220 KB Output is correct
25 Correct 79 ms 14520 KB Output is correct
26 Correct 76 ms 15548 KB Output is correct
27 Correct 171 ms 24368 KB Output is correct
28 Correct 167 ms 28364 KB Output is correct
29 Correct 1 ms 2644 KB Output is correct
30 Correct 1 ms 2644 KB Output is correct
31 Correct 1 ms 2644 KB Output is correct
32 Correct 1 ms 2644 KB Output is correct
33 Correct 2 ms 2648 KB Output is correct
34 Correct 1 ms 2644 KB Output is correct
35 Correct 1 ms 2652 KB Output is correct
36 Correct 8 ms 3796 KB Output is correct
37 Correct 168 ms 30384 KB Output is correct
38 Correct 1 ms 2644 KB Output is correct
39 Correct 1 ms 2644 KB Output is correct
40 Correct 8 ms 3796 KB Output is correct
41 Correct 167 ms 30244 KB Output is correct
42 Correct 1 ms 2644 KB Output is correct
43 Correct 1 ms 2648 KB Output is correct
44 Correct 6 ms 3412 KB Output is correct
45 Correct 85 ms 20384 KB Output is correct
46 Correct 1 ms 2644 KB Output is correct
47 Correct 1 ms 2644 KB Output is correct
48 Correct 1 ms 2644 KB Output is correct
49 Correct 47 ms 9584 KB Output is correct
50 Correct 168 ms 30332 KB Output is correct
51 Correct 168 ms 30164 KB Output is correct
52 Correct 171 ms 30360 KB Output is correct
53 Correct 80 ms 20392 KB Output is correct
54 Incorrect 168 ms 30380 KB Answer gives possible 1 while actual possible 0
55 Halted 0 ms 0 KB -