oj.uz

Submission #1063244

# Submission time Handle Problem Language Result Execution time Memory
1063244 2024-08-17T15:41:13 Z jamjanek Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 174 ms 24148 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

int father1[1010], father[1010];
int find1(int x){
	if(father1[x]==x)return x;
	return father1[x] = find1(father1[x]);
}
int find2(int x){
	if(father[x]==x)return x;
	return father[x] = find2(father[x]);
}


int construct(std::vector<std::vector<int>> p) {
	int n = p.size(), i, j;
	for(i=0;i<n;i++)father[i] = father1[i] = i;
	std::vector<std::vector<int>> answer = p;
	for(i=0;i<n;i++)
		for(j=0;j<n;j++)
			answer[i][j] = 0;
	for(i=0;i<n;i++)
		for(j=0;j<n;j++){
			if(p[i][j]==3 || (i==j && p[i][j]!=1) || (p[i][j]!=p[j][i]))
				return 0;
			if(p[i][j]>0)
				father1[find1(i)] = find1(j);
			else
				if(find1(i)==find2(j))return 0;
			if(p[i][j]==1 && find2(i)!=find2(j)){
				father[find2(i)] = find2(j);
				answer[i][j] = answer[j][i] = 1;
			}
		}
	build(answer);
	return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1368 KB Output is correct
7 Correct 132 ms 24148 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1368 KB Output is correct
7 Correct 132 ms 24148 KB Output is correct
8 Correct 0 ms 600 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1196 KB Output is correct
13 Correct 121 ms 23932 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 940 KB Output is correct
17 Correct 56 ms 14212 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 30 ms 6388 KB Output is correct
21 Correct 121 ms 24148 KB Output is correct
22 Correct 113 ms 24144 KB Output is correct
23 Correct 123 ms 24148 KB Output is correct
24 Correct 116 ms 24148 KB Output is correct
25 Correct 56 ms 14160 KB Output is correct
26 Correct 50 ms 14164 KB Output is correct
27 Correct 174 ms 24148 KB Output is correct
28 Correct 120 ms 23980 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Incorrect 0 ms 348 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 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Too few ways to get from 0 to 1, should be 2 found 0
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1368 KB Output is correct
7 Correct 132 ms 24148 KB Output is correct
8 Correct 0 ms 600 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1196 KB Output is correct
13 Correct 121 ms 23932 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 940 KB Output is correct
17 Correct 56 ms 14212 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 30 ms 6388 KB Output is correct
21 Correct 121 ms 24148 KB Output is correct
22 Correct 113 ms 24144 KB Output is correct
23 Correct 123 ms 24148 KB Output is correct
24 Correct 116 ms 24148 KB Output is correct
25 Correct 56 ms 14160 KB Output is correct
26 Correct 50 ms 14164 KB Output is correct
27 Correct 174 ms 24148 KB Output is correct
28 Correct 120 ms 23980 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Incorrect 0 ms 348 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 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1368 KB Output is correct
7 Correct 132 ms 24148 KB Output is correct
8 Correct 0 ms 600 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1196 KB Output is correct
13 Correct 121 ms 23932 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 940 KB Output is correct
17 Correct 56 ms 14212 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 30 ms 6388 KB Output is correct
21 Correct 121 ms 24148 KB Output is correct
22 Correct 113 ms 24144 KB Output is correct
23 Correct 123 ms 24148 KB Output is correct
24 Correct 116 ms 24148 KB Output is correct
25 Correct 56 ms 14160 KB Output is correct
26 Correct 50 ms 14164 KB Output is correct
27 Correct 174 ms 24148 KB Output is correct
28 Correct 120 ms 23980 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -