oj.uz

Submission #625339

# Submission time Handle Problem Language Result Execution time Memory
625339 2022-08-10T05:16:44 Z OrazB Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 282 ms 27508 KB 
#include <bits/stdc++.h>
#include "supertrees.h"
#define N 1005
#define wr cout << "Continue debugging\n";
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second
using namespace std;

int col[N], p[N][N], k[N], m[N];
vector <int> e[N];
vector<vector<int>> b;

int construct (vector <vector<int>> p){
	int cnt = 0;
	int n = p.size();
	b.resize(n);
	for (int i = 0; i < (int)p.size(); i++){
		b[i].resize(n);
		for (int j = 0; j < (int)(int)p[i].size(); j++) if (p[i][j] != p[j][i]) return 0;
	}
	for (int i = 0; i < (int)p.size(); i++){
		if (!col[i]) cnt++, col[i] = cnt;
		for (int j = 0; j < (int)p[i].size(); j++){
			if (!p[i][j]) continue; 
			col[j] = col[i];
			if (p[i][j] != 1 and k[col[i]] and k[col[i]] != p[i][j]) return 0;
			else if (p[i][j] != 1) k[col[i]] = p[i][j];
		}
	}
	for (int i = 0; i < (int)p.size(); i++) if (!k[col[i]]) k[col[i]] = 1;
	for (int i = 0; i < (int)p.size(); i++){
		cnt = 0;
		for (int j = 0; j < (int)p[i].size(); j++) if (p[i][j] == k[col[i]]) cnt++;
		if (cnt < k[col[i]]) return 0;
	}
	cnt = 0;
	for (int i = 0; i < (int)p.size(); i++){
		if (m[i]){
			for (int j = 0; j < (int)p[i].size(); j++) if (e[m[i]][j] != p[i][j]) return 0;
			continue;
		}
		cnt++;
		for (int j = 0; j < (int)p[i].size(); j++) e[cnt].pb(p[i][j]);
		for (int j = 0; j < (int)p[i].size(); j++){
			if (i == j or p[i][j] != 1 or m[j]) continue;
			b[i][j] = b[j][i] = 1; m[j] = cnt;
		}
	}
	for (int i = 0; i < (int)p.size(); i++){
		if (m[i]) continue;
		for (int j = 0; j < (int)p[i].size(); j++){
			if (p[i][j] < 2 or m[j]) continue;
			b[i][j] = b[j][i] = 1;
		}
	}
	build(b);
	// for (int i = 0; i < p.size(); i++){
	// 	for (int j = 0; j < p[i].size(); j++) cout << b[i][j] << " ";
	// 	cout << '\n';
	// }
	return 1;
}
// int main ()
// {
// 	ios::sync_with_stdio(false);
// 	cin.tie(0);
// 	int n;
// 	cin >> n;
// 	vector<vector<int>> afk(n, vector <int> (n));
// 	for (int i = 0; i < n; i++){
// 		for (int j = 0; j < n; j++) cin >> afk[i][j];
// 	}
// 	cout << construct(afk);
// }

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 8 ms 1244 KB Output is correct
7 Correct 206 ms 23384 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 8 ms 1244 KB Output is correct
7 Correct 206 ms 23384 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 9 ms 1436 KB Output is correct
13 Correct 282 ms 27488 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 4 ms 852 KB Output is correct
17 Correct 86 ms 13724 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 60 ms 6344 KB Output is correct
21 Correct 232 ms 23516 KB Output is correct
22 Correct 186 ms 25108 KB Output is correct
23 Correct 180 ms 23500 KB Output is correct
24 Correct 176 ms 27332 KB Output is correct
25 Correct 73 ms 13560 KB Output is correct
26 Correct 77 ms 14688 KB Output is correct
27 Correct 182 ms 23424 KB Output is correct
28 Correct 171 ms 27224 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 8 ms 1468 KB Output is correct
9 Correct 180 ms 27508 KB Output is correct
10 Incorrect 1 ms 340 KB Too many ways to get from 0 to 3, should be 2 found no less than 3
11 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 45 ms 6404 KB Output is correct
5 Correct 167 ms 23496 KB Output is correct
6 Correct 171 ms 25068 KB Output is correct
7 Correct 185 ms 23420 KB Output is correct
8 Incorrect 0 ms 340 KB Too many ways to get from 0 to 2, should be 2 found no less than 3
9 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 8 ms 1244 KB Output is correct
7 Correct 206 ms 23384 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 9 ms 1436 KB Output is correct
13 Correct 282 ms 27488 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 4 ms 852 KB Output is correct
17 Correct 86 ms 13724 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 60 ms 6344 KB Output is correct
21 Correct 232 ms 23516 KB Output is correct
22 Correct 186 ms 25108 KB Output is correct
23 Correct 180 ms 23500 KB Output is correct
24 Correct 176 ms 27332 KB Output is correct
25 Correct 73 ms 13560 KB Output is correct
26 Correct 77 ms 14688 KB Output is correct
27 Correct 182 ms 23424 KB Output is correct
28 Correct 171 ms 27224 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 8 ms 1468 KB Output is correct
37 Correct 180 ms 27508 KB Output is correct
38 Incorrect 1 ms 340 KB Too many ways to get from 0 to 3, should be 2 found no less than 3
39 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 8 ms 1244 KB Output is correct
7 Correct 206 ms 23384 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 9 ms 1436 KB Output is correct
13 Correct 282 ms 27488 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 4 ms 852 KB Output is correct
17 Correct 86 ms 13724 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 60 ms 6344 KB Output is correct
21 Correct 232 ms 23516 KB Output is correct
22 Correct 186 ms 25108 KB Output is correct
23 Correct 180 ms 23500 KB Output is correct
24 Correct 176 ms 27332 KB Output is correct
25 Correct 73 ms 13560 KB Output is correct
26 Correct 77 ms 14688 KB Output is correct
27 Correct 182 ms 23424 KB Output is correct
28 Correct 171 ms 27224 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 8 ms 1468 KB Output is correct
37 Correct 180 ms 27508 KB Output is correct
38 Incorrect 1 ms 340 KB Too many ways to get from 0 to 3, should be 2 found no less than 3
39 Halted 0 ms 0 KB -