oj.uz

Submission #771063

# Submission time Handle Problem Language Result Execution time Memory
771063 2023-07-02T12:11:19 Z OrazB Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 193 ms 29896 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, -1);
	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);
			}
			vec[cnt].pb(p[i][j]);
		}
		if (!v.size()) continue;
		if (ok[i] != -1){
			for (int j = 0; j < n; j++){
				if (i != j and p[i][j] == 1){
					b[ok[i]][j] = b[j][ok[i]] = 0;
				}
			}
			continue;
		}
		b[i][v[0]] = b[v[0]][i] = 1;
		b[i][v.back()] = b[v.back()][i] = 1;
		ok[v[0]] = i;
		for (int j = 1; j < v.size(); j++){
			b[v[j-1]][v[j]] = b[v[j]][v[j-1]] = 1;
			ok[v[j]] = i;
		}
	}
	// 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 2664 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 8 ms 3588 KB Output is correct
7 Correct 193 ms 25508 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 2664 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 8 ms 3588 KB Output is correct
7 Correct 193 ms 25508 KB Output is correct
8 Correct 1 ms 2648 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 13 ms 3820 KB Output is correct
13 Correct 175 ms 29896 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 6 ms 3172 KB Output is correct
17 Correct 70 ms 15192 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 39 ms 8632 KB Output is correct
21 Correct 163 ms 25292 KB Output is correct
22 Correct 183 ms 26896 KB Output is correct
23 Correct 166 ms 25292 KB Output is correct
24 Correct 164 ms 29124 KB Output is correct
25 Correct 69 ms 15348 KB Output is correct
26 Correct 83 ms 16464 KB Output is correct
27 Correct 162 ms 25308 KB Output is correct
28 Correct 161 ms 29056 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 2 ms 2644 KB Output is correct
3 Correct 1 ms 2652 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 2 ms 2652 KB Output is correct
4 Correct 41 ms 8736 KB Output is correct
5 Correct 182 ms 25660 KB Output is correct
6 Correct 161 ms 27260 KB Output is correct
7 Correct 167 ms 25540 KB Output is correct
8 Correct 2 ms 2652 KB Output is correct
9 Correct 43 ms 9548 KB Output is correct
10 Correct 189 ms 29332 KB Output is correct
11 Correct 166 ms 29364 KB Output is correct
12 Correct 167 ms 29444 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Incorrect 43 ms 9416 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 2 ms 2644 KB Output is correct
2 Correct 2 ms 2664 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 8 ms 3588 KB Output is correct
7 Correct 193 ms 25508 KB Output is correct
8 Correct 1 ms 2648 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 13 ms 3820 KB Output is correct
13 Correct 175 ms 29896 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 6 ms 3172 KB Output is correct
17 Correct 70 ms 15192 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 39 ms 8632 KB Output is correct
21 Correct 163 ms 25292 KB Output is correct
22 Correct 183 ms 26896 KB Output is correct
23 Correct 166 ms 25292 KB Output is correct
24 Correct 164 ms 29124 KB Output is correct
25 Correct 69 ms 15348 KB Output is correct
26 Correct 83 ms 16464 KB Output is correct
27 Correct 162 ms 25308 KB Output is correct
28 Correct 161 ms 29056 KB Output is correct
29 Correct 1 ms 2644 KB Output is correct
30 Correct 2 ms 2644 KB Output is correct
31 Correct 1 ms 2652 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 2 ms 2644 KB Output is correct
2 Correct 2 ms 2664 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 8 ms 3588 KB Output is correct
7 Correct 193 ms 25508 KB Output is correct
8 Correct 1 ms 2648 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 13 ms 3820 KB Output is correct
13 Correct 175 ms 29896 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 6 ms 3172 KB Output is correct
17 Correct 70 ms 15192 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 39 ms 8632 KB Output is correct
21 Correct 163 ms 25292 KB Output is correct
22 Correct 183 ms 26896 KB Output is correct
23 Correct 166 ms 25292 KB Output is correct
24 Correct 164 ms 29124 KB Output is correct
25 Correct 69 ms 15348 KB Output is correct
26 Correct 83 ms 16464 KB Output is correct
27 Correct 162 ms 25308 KB Output is correct
28 Correct 161 ms 29056 KB Output is correct
29 Correct 1 ms 2644 KB Output is correct
30 Correct 2 ms 2644 KB Output is correct
31 Correct 1 ms 2652 KB Output is correct
32 Incorrect 1 ms 2644 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -