oj.uz

Submission #783566

# Submission time Handle Problem Language Result Execution time Memory
783566 2023-07-15T04:12:09 Z mindiyak Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 923 ms 22032 KB 
#include "supertrees.h"
#include <vector>
#include <iostream>

#define pb push_back

using namespace std;

int find_head(vector<int> a,int val){
	if(a[val] == val)
	    return val;
	return find_head(a,a[val]);
}

int find_leaf(vector<int> a,int val){
	if(a[val] == val)
	    return val;
	return find_leaf(a,a[val]);
}

int construct(vector<vector<int>> p) {
    // cout << "started" << endl;
	int n = p.size();

	vector<vector<int>> ans;
	vector<int> temp(n,0);
	vector<int> head;
	vector<int> leaf;
	for (int i = 0; i < n; i++) {
		ans.pb(temp);
		head.pb(i);
		leaf.pb(i);
	}

	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(p[i][j] >= 1){
				int c = min(i,j),d = max(i,j);
				int h_c = find_head(head,c);
				int h_d = find_head(head,d);
				if(h_c != h_d){
				    ans[h_c][h_d] = 1;
				    ans[h_d][h_c] = 1;
				}
				head[h_d] = h_c;
				leaf[h_c] = find_leaf(leaf,d);
			} 
		}
	}

	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			int c = min(i,j),d = max(i,j);
			int h_c = find_head(head,c);
			int h_d = find_head(head,d);
			int l_c = find_leaf(leaf,c);
			int l_d = find_leaf(leaf,d);

			if(p[i][j] == 2){
				ans[h_c][l_d] = 1;
				ans[l_d][h_c] = 1;
			}

			if(p[i][j] == 2 and h_c == l_d){
				return 0;
			}
			
			if(p[i][j] == 0 and h_c == h_d){
				return 0;
			}
			if(p[i][j] >= 1 and h_c != h_d){
				return 0;
			}
		}
	}


	build(ans);
// 	cout << "finish" << endl;
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:56:8: warning: unused variable 'l_c' [-Wunused-variable]
   56 |    int l_c = find_leaf(leaf,c);
      |        ^~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 18 ms 1152 KB Output is correct
7 Correct 923 ms 21968 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 18 ms 1152 KB Output is correct
7 Correct 923 ms 21968 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 11 ms 1096 KB Output is correct
13 Correct 427 ms 22008 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 6 ms 724 KB Output is correct
17 Correct 377 ms 12168 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 122 ms 5728 KB Output is correct
21 Correct 668 ms 21940 KB Output is correct
22 Correct 578 ms 21956 KB Output is correct
23 Correct 765 ms 21968 KB Output is correct
24 Correct 440 ms 22032 KB Output is correct
25 Correct 121 ms 12164 KB Output is correct
26 Correct 90 ms 12036 KB Output is correct
27 Correct 764 ms 22024 KB Output is correct
28 Correct 477 ms 21968 KB Output is correct

Subtask #3
0 / 19.0

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

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 18 ms 1152 KB Output is correct
7 Correct 923 ms 21968 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 11 ms 1096 KB Output is correct
13 Correct 427 ms 22008 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 6 ms 724 KB Output is correct
17 Correct 377 ms 12168 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 122 ms 5728 KB Output is correct
21 Correct 668 ms 21940 KB Output is correct
22 Correct 578 ms 21956 KB Output is correct
23 Correct 765 ms 21968 KB Output is correct
24 Correct 440 ms 22032 KB Output is correct
25 Correct 121 ms 12164 KB Output is correct
26 Correct 90 ms 12036 KB Output is correct
27 Correct 764 ms 22024 KB Output is correct
28 Correct 477 ms 21968 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Incorrect 0 ms 212 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 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 18 ms 1152 KB Output is correct
7 Correct 923 ms 21968 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 11 ms 1096 KB Output is correct
13 Correct 427 ms 22008 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 6 ms 724 KB Output is correct
17 Correct 377 ms 12168 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 122 ms 5728 KB Output is correct
21 Correct 668 ms 21940 KB Output is correct
22 Correct 578 ms 21956 KB Output is correct
23 Correct 765 ms 21968 KB Output is correct
24 Correct 440 ms 22032 KB Output is correct
25 Correct 121 ms 12164 KB Output is correct
26 Correct 90 ms 12036 KB Output is correct
27 Correct 764 ms 22024 KB Output is correct
28 Correct 477 ms 21968 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Incorrect 0 ms 212 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -