oj.uz

Submission #771029

# Submission time Handle Problem Language Result Execution time Memory
771029 2023-07-02T11:09:23 Z OrazB Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 165 ms 28984 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;
		}
		vis[i] = ++cnt;
		vector<int> v;
		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;
				}else v.pb(j), ok[j] = 1;
			}
			vec[cnt].pb(p[i][j]);
		}
		if (ok[i] or !v.size()) continue;
		b[i][v[0]] = b[v[0]][i] = 1;
		b[i][v.back()] = b[v.back()][i] = 1;
		for (int i = 1; i < v.size(); i++){
			b[v[i-1]][v[i]] = b[v[i]][v[i-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:39:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |   for (int i = 1; i < v.size(); i++){
      |                   ~~^~~~~~~~~~

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 2 ms 2644 KB Output is correct
6 Correct 8 ms 3540 KB Output is correct
7 Correct 152 ms 24604 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 2 ms 2644 KB Output is correct
6 Correct 8 ms 3540 KB Output is correct
7 Correct 152 ms 24604 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 2644 KB Output is correct
11 Correct 1 ms 2648 KB Output is correct
12 Correct 8 ms 3796 KB Output is correct
13 Correct 159 ms 28696 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 4 ms 3148 KB Output is correct
17 Correct 71 ms 14620 KB Output is correct
18 Correct 1 ms 2644 KB Output is correct
19 Correct 1 ms 2644 KB Output is correct
20 Correct 40 ms 8348 KB Output is correct
21 Correct 153 ms 24488 KB Output is correct
22 Correct 156 ms 26104 KB Output is correct
23 Correct 159 ms 24612 KB Output is correct
24 Correct 160 ms 28260 KB Output is correct
25 Correct 66 ms 14580 KB Output is correct
26 Correct 67 ms 15828 KB Output is correct
27 Correct 157 ms 24536 KB Output is correct
28 Correct 161 ms 28368 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 1 ms 2644 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
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 40 ms 8424 KB Output is correct
5 Correct 157 ms 24700 KB Output is correct
6 Correct 162 ms 26528 KB Output is correct
7 Correct 157 ms 24660 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 42 ms 9292 KB Output is correct
10 Correct 165 ms 28676 KB Output is correct
11 Correct 163 ms 28624 KB Output is correct
12 Correct 165 ms 28984 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2652 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Incorrect 41 ms 9108 KB Too many ways to get from 0 to 250, should be 2 found no less than 3
17 Halted 0 ms 0 KB -

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 2 ms 2644 KB Output is correct
6 Correct 8 ms 3540 KB Output is correct
7 Correct 152 ms 24604 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 2644 KB Output is correct
11 Correct 1 ms 2648 KB Output is correct
12 Correct 8 ms 3796 KB Output is correct
13 Correct 159 ms 28696 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 4 ms 3148 KB Output is correct
17 Correct 71 ms 14620 KB Output is correct
18 Correct 1 ms 2644 KB Output is correct
19 Correct 1 ms 2644 KB Output is correct
20 Correct 40 ms 8348 KB Output is correct
21 Correct 153 ms 24488 KB Output is correct
22 Correct 156 ms 26104 KB Output is correct
23 Correct 159 ms 24612 KB Output is correct
24 Correct 160 ms 28260 KB Output is correct
25 Correct 66 ms 14580 KB Output is correct
26 Correct 67 ms 15828 KB Output is correct
27 Correct 157 ms 24536 KB Output is correct
28 Correct 161 ms 28368 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 1 ms 2644 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 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 2644 KB Output is correct
6 Correct 8 ms 3540 KB Output is correct
7 Correct 152 ms 24604 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 2644 KB Output is correct
11 Correct 1 ms 2648 KB Output is correct
12 Correct 8 ms 3796 KB Output is correct
13 Correct 159 ms 28696 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 4 ms 3148 KB Output is correct
17 Correct 71 ms 14620 KB Output is correct
18 Correct 1 ms 2644 KB Output is correct
19 Correct 1 ms 2644 KB Output is correct
20 Correct 40 ms 8348 KB Output is correct
21 Correct 153 ms 24488 KB Output is correct
22 Correct 156 ms 26104 KB Output is correct
23 Correct 159 ms 24612 KB Output is correct
24 Correct 160 ms 28260 KB Output is correct
25 Correct 66 ms 14580 KB Output is correct
26 Correct 67 ms 15828 KB Output is correct
27 Correct 157 ms 24536 KB Output is correct
28 Correct 161 ms 28368 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 1 ms 2644 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -