oj.uz

Submission #771076

# Submission time Handle Problem Language Result Execution time Memory
771076 2023-07-02T12:27:19 Z OrazB Connecting Supertrees (IOI20_supertrees) C++14
56 / 100
 166 ms 30316 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;
		vector<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;
		b[i][v[0]] = b[v[0]][i] = 1;
		b[i][v.back()] = b[v.back()][i] = 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::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |   for (int j = 1; j < v.size(); j++){
      |                   ~~^~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 1 ms 2644 KB Output is correct
5 Correct 1 ms 2648 KB Output is correct
6 Correct 8 ms 3528 KB Output is correct
7 Correct 158 ms 26152 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 1 ms 2644 KB Output is correct
5 Correct 1 ms 2648 KB Output is correct
6 Correct 8 ms 3528 KB Output is correct
7 Correct 158 ms 26152 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 2 ms 2648 KB Output is correct
12 Correct 8 ms 3800 KB Output is correct
13 Correct 166 ms 29756 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 4 ms 3148 KB Output is correct
17 Correct 68 ms 16160 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 1 ms 2644 KB Output is correct
20 Correct 40 ms 8716 KB Output is correct
21 Correct 159 ms 25776 KB Output is correct
22 Correct 158 ms 27196 KB Output is correct
23 Correct 159 ms 25620 KB Output is correct
24 Correct 162 ms 29428 KB Output is correct
25 Correct 69 ms 15744 KB Output is correct
26 Correct 67 ms 16820 KB Output is correct
27 Correct 164 ms 25684 KB Output is correct
28 Correct 158 ms 29420 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 Incorrect 2 ms 2772 KB Answer gives possible 1 while actual possible 0
5 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 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 41 ms 8648 KB Output is correct
5 Correct 156 ms 25628 KB Output is correct
6 Correct 160 ms 27212 KB Output is correct
7 Correct 162 ms 25604 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 42 ms 9572 KB Output is correct
10 Correct 161 ms 29672 KB Output is correct
11 Correct 164 ms 29644 KB Output is correct
12 Correct 165 ms 29712 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 41 ms 9440 KB Output is correct
17 Correct 161 ms 30316 KB Output is correct
18 Correct 161 ms 28460 KB Output is correct
19 Correct 158 ms 28732 KB Output is correct
20 Correct 160 ms 30204 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 1 ms 2644 KB Output is correct
5 Correct 1 ms 2648 KB Output is correct
6 Correct 8 ms 3528 KB Output is correct
7 Correct 158 ms 26152 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 2 ms 2648 KB Output is correct
12 Correct 8 ms 3800 KB Output is correct
13 Correct 166 ms 29756 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 4 ms 3148 KB Output is correct
17 Correct 68 ms 16160 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 1 ms 2644 KB Output is correct
20 Correct 40 ms 8716 KB Output is correct
21 Correct 159 ms 25776 KB Output is correct
22 Correct 158 ms 27196 KB Output is correct
23 Correct 159 ms 25620 KB Output is correct
24 Correct 162 ms 29428 KB Output is correct
25 Correct 69 ms 15744 KB Output is correct
26 Correct 67 ms 16820 KB Output is correct
27 Correct 164 ms 25684 KB Output is correct
28 Correct 158 ms 29420 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 Incorrect 2 ms 2772 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 1 ms 2644 KB Output is correct
5 Correct 1 ms 2648 KB Output is correct
6 Correct 8 ms 3528 KB Output is correct
7 Correct 158 ms 26152 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 2 ms 2648 KB Output is correct
12 Correct 8 ms 3800 KB Output is correct
13 Correct 166 ms 29756 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 4 ms 3148 KB Output is correct
17 Correct 68 ms 16160 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 1 ms 2644 KB Output is correct
20 Correct 40 ms 8716 KB Output is correct
21 Correct 159 ms 25776 KB Output is correct
22 Correct 158 ms 27196 KB Output is correct
23 Correct 159 ms 25620 KB Output is correct
24 Correct 162 ms 29428 KB Output is correct
25 Correct 69 ms 15744 KB Output is correct
26 Correct 67 ms 16820 KB Output is correct
27 Correct 164 ms 25684 KB Output is correct
28 Correct 158 ms 29420 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 Incorrect 2 ms 2772 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -