oj.uz

Submission #305058

# Submission time Handle Problem Language Result Execution time Memory
305058 2020-09-22T13:35:01 Z daveeed Connecting Supertrees (IOI20_supertrees) C++17
100 / 100
 265 ms 22264 KB 
#include "supertrees.h"
#include <vector>

const int MAXN = 1000;

int parent[MAXN], sz[MAXN], comp[MAXN];

int find(int p){
    while (p != parent[p])
        p = parent[p];
    return p;
}

void merge(int p, int q) {
    int rootP = find(p);
    int rootQ = find(q);
    if (rootP == rootQ) return;
    if (sz[rootP] < sz[rootQ]) {
        parent[rootP] = rootQ;
        sz[rootQ] += sz[rootP];
    }
    else {
        parent[rootQ] = rootP;
        sz[rootP] += sz[rootQ];
    }
}

int construct(std::vector<std::vector<int> > p) {
	int n = p.size();
	std::vector<std::vector<int> > answer;
	for (int i = 0; i < n; i++) {
		std::vector<int> row;
		row.resize(n);
		answer.push_back(row);
	}

    for(int i = 0; i < n; i++){
        parent[i] = i;
    }

    //bool isTwo = false;
    //bool isThree = false;
    

    for(int i = 0; i < n; i++){
        for(int j = i + 1; j < n; j++){
            if(p[i][j])
                merge(i, j);
            /*if(p[i][j] == 3)
                isThree = true;
            if(p[i][j] == 2)
                isTwo = true;*/
        }
    }

    for(int i = 0; i < n; i++){
        for(int j = i + 1; j < n; j++){
            if(find(i) == find(j) && !p[i][j])
                return 0;
        }
    }
    for(int i = 0; i < n; i++){
        int r = find(i);
        if(r == i){
            std::vector<int> inComp;
            for(int j = 0; j < n; j++){
                if(find(j) == r){
                    inComp.push_back(j);
                }
            }
            int start = -1;
            int prev = -1;
            int second = -1;
            int c = 0;
            bool isThree = false;
            bool isTwo = false;
            for(int j = 0; j < inComp.size(); j++) if(comp[inComp[j]] == 0){
                comp[inComp[j]] = ++c;
                for(int k = j + 1; k < inComp.size(); k++){
                    if(p[inComp[j]][inComp[k]] == 3){
                        isThree = true;
                    }
                    if(p[inComp[j]][inComp[k]] == 3){
                        isTwo = true;
                    }
                    if(comp[inComp[k]] == 0 && p[inComp[j]][inComp[k]] == 1){
                        comp[inComp[k]] = comp[inComp[j]];
                        answer[inComp[j]][inComp[k]] = 1;
                        answer[inComp[k]][inComp[j]] = 1;
                    }
                }
                if(isThree && isTwo)
                    return 0;
                if(start == -1){
                    start = inComp[j];
                    prev = inComp[j];
                }
                else{
                    if(second == -1){
                        second = inComp[j];
                    }
                    answer[prev][inComp[j]] = 1;
                    answer[inComp[j]][prev] = 1;
                    prev = inComp[j];
                }
            }
            if(c == 1){
                continue;
            }
            if(c == 2){
                return 0;
            }
            if(c == 3 && isThree){
                return 0;
            }
            answer[prev][start] = 1;
            answer[start][prev] = 1;
            if(isThree){
                answer[prev][second] = 1;
                answer[second][prev] = 1;
            }
        }
    }
    

	build(answer);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:77:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |             for(int j = 0; j < inComp.size(); j++) if(comp[inComp[j]] == 0){
      |                            ~~^~~~~~~~~~~~~~~
supertrees.cpp:79:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |                 for(int k = j + 1; k < inComp.size(); k++){
      |                                    ~~^~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 11 ms 1152 KB Output is correct
7 Correct 251 ms 22140 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 11 ms 1152 KB Output is correct
7 Correct 251 ms 22140 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 11 ms 1152 KB Output is correct
13 Correct 248 ms 22136 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 120 ms 12152 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 61 ms 5824 KB Output is correct
21 Correct 258 ms 22136 KB Output is correct
22 Correct 251 ms 22136 KB Output is correct
23 Correct 265 ms 22140 KB Output is correct
24 Correct 250 ms 22136 KB Output is correct
25 Correct 109 ms 12152 KB Output is correct
26 Correct 108 ms 12152 KB Output is correct
27 Correct 257 ms 22136 KB Output is correct
28 Correct 247 ms 22136 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 10 ms 1152 KB Output is correct
9 Correct 247 ms 22136 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 12 ms 1152 KB Output is correct
13 Correct 253 ms 22144 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 118 ms 12112 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 64 ms 5752 KB Output is correct
22 Correct 251 ms 22220 KB Output is correct
23 Correct 252 ms 22136 KB Output is correct
24 Correct 259 ms 22136 KB Output is correct
25 Correct 107 ms 12152 KB Output is correct
26 Correct 105 ms 12152 KB Output is correct
27 Correct 244 ms 22036 KB Output is correct
28 Correct 261 ms 22136 KB Output is correct
29 Correct 107 ms 12152 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 62 ms 5752 KB Output is correct
5 Correct 247 ms 22136 KB Output is correct
6 Correct 244 ms 22136 KB Output is correct
7 Correct 260 ms 22136 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 61 ms 5752 KB Output is correct
10 Correct 246 ms 22136 KB Output is correct
11 Correct 243 ms 22136 KB Output is correct
12 Correct 258 ms 22136 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 63 ms 5880 KB Output is correct
17 Correct 248 ms 22136 KB Output is correct
18 Correct 247 ms 22264 KB Output is correct
19 Correct 246 ms 22136 KB Output is correct
20 Correct 248 ms 22136 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 11 ms 1152 KB Output is correct
7 Correct 251 ms 22140 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 11 ms 1152 KB Output is correct
13 Correct 248 ms 22136 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 120 ms 12152 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 61 ms 5824 KB Output is correct
21 Correct 258 ms 22136 KB Output is correct
22 Correct 251 ms 22136 KB Output is correct
23 Correct 265 ms 22140 KB Output is correct
24 Correct 250 ms 22136 KB Output is correct
25 Correct 109 ms 12152 KB Output is correct
26 Correct 108 ms 12152 KB Output is correct
27 Correct 257 ms 22136 KB Output is correct
28 Correct 247 ms 22136 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 0 ms 256 KB Output is correct
36 Correct 10 ms 1152 KB Output is correct
37 Correct 247 ms 22136 KB Output is correct
38 Correct 0 ms 256 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 12 ms 1152 KB Output is correct
41 Correct 253 ms 22144 KB Output is correct
42 Correct 0 ms 256 KB Output is correct
43 Correct 0 ms 256 KB Output is correct
44 Correct 6 ms 768 KB Output is correct
45 Correct 118 ms 12112 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 0 ms 256 KB Output is correct
49 Correct 64 ms 5752 KB Output is correct
50 Correct 251 ms 22220 KB Output is correct
51 Correct 252 ms 22136 KB Output is correct
52 Correct 259 ms 22136 KB Output is correct
53 Correct 107 ms 12152 KB Output is correct
54 Correct 105 ms 12152 KB Output is correct
55 Correct 244 ms 22036 KB Output is correct
56 Correct 261 ms 22136 KB Output is correct
57 Correct 107 ms 12152 KB Output is correct
58 Correct 0 ms 256 KB Output is correct
59 Correct 0 ms 256 KB Output is correct
60 Correct 5 ms 768 KB Output is correct
61 Correct 126 ms 12152 KB Output is correct
62 Correct 0 ms 256 KB Output is correct
63 Correct 0 ms 256 KB Output is correct
64 Correct 1 ms 256 KB Output is correct
65 Correct 63 ms 5832 KB Output is correct
66 Correct 107 ms 12152 KB Output is correct
67 Correct 108 ms 12152 KB Output is correct
68 Correct 106 ms 12152 KB Output is correct
69 Correct 106 ms 12152 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 11 ms 1152 KB Output is correct
7 Correct 251 ms 22140 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 11 ms 1152 KB Output is correct
13 Correct 248 ms 22136 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 120 ms 12152 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 61 ms 5824 KB Output is correct
21 Correct 258 ms 22136 KB Output is correct
22 Correct 251 ms 22136 KB Output is correct
23 Correct 265 ms 22140 KB Output is correct
24 Correct 250 ms 22136 KB Output is correct
25 Correct 109 ms 12152 KB Output is correct
26 Correct 108 ms 12152 KB Output is correct
27 Correct 257 ms 22136 KB Output is correct
28 Correct 247 ms 22136 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 0 ms 256 KB Output is correct
36 Correct 10 ms 1152 KB Output is correct
37 Correct 247 ms 22136 KB Output is correct
38 Correct 0 ms 256 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 12 ms 1152 KB Output is correct
41 Correct 253 ms 22144 KB Output is correct
42 Correct 0 ms 256 KB Output is correct
43 Correct 0 ms 256 KB Output is correct
44 Correct 6 ms 768 KB Output is correct
45 Correct 118 ms 12112 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 0 ms 256 KB Output is correct
49 Correct 64 ms 5752 KB Output is correct
50 Correct 251 ms 22220 KB Output is correct
51 Correct 252 ms 22136 KB Output is correct
52 Correct 259 ms 22136 KB Output is correct
53 Correct 107 ms 12152 KB Output is correct
54 Correct 105 ms 12152 KB Output is correct
55 Correct 244 ms 22036 KB Output is correct
56 Correct 261 ms 22136 KB Output is correct
57 Correct 107 ms 12152 KB Output is correct
58 Correct 0 ms 256 KB Output is correct
59 Correct 0 ms 256 KB Output is correct
60 Correct 0 ms 256 KB Output is correct
61 Correct 62 ms 5752 KB Output is correct
62 Correct 247 ms 22136 KB Output is correct
63 Correct 244 ms 22136 KB Output is correct
64 Correct 260 ms 22136 KB Output is correct
65 Correct 0 ms 256 KB Output is correct
66 Correct 61 ms 5752 KB Output is correct
67 Correct 246 ms 22136 KB Output is correct
68 Correct 243 ms 22136 KB Output is correct
69 Correct 258 ms 22136 KB Output is correct
70 Correct 0 ms 256 KB Output is correct
71 Correct 0 ms 256 KB Output is correct
72 Correct 1 ms 256 KB Output is correct
73 Correct 63 ms 5880 KB Output is correct
74 Correct 248 ms 22136 KB Output is correct
75 Correct 247 ms 22264 KB Output is correct
76 Correct 246 ms 22136 KB Output is correct
77 Correct 248 ms 22136 KB Output is correct
78 Correct 0 ms 256 KB Output is correct
79 Correct 0 ms 256 KB Output is correct
80 Correct 5 ms 768 KB Output is correct
81 Correct 126 ms 12152 KB Output is correct
82 Correct 0 ms 256 KB Output is correct
83 Correct 0 ms 256 KB Output is correct
84 Correct 1 ms 256 KB Output is correct
85 Correct 63 ms 5832 KB Output is correct
86 Correct 107 ms 12152 KB Output is correct
87 Correct 108 ms 12152 KB Output is correct
88 Correct 106 ms 12152 KB Output is correct
89 Correct 106 ms 12152 KB Output is correct
90 Correct 0 ms 256 KB Output is correct
91 Correct 0 ms 256 KB Output is correct
92 Correct 5 ms 768 KB Output is correct
93 Correct 118 ms 12116 KB Output is correct
94 Correct 0 ms 256 KB Output is correct
95 Correct 0 ms 384 KB Output is correct
96 Correct 0 ms 256 KB Output is correct
97 Correct 27 ms 3320 KB Output is correct
98 Correct 108 ms 12152 KB Output is correct
99 Correct 109 ms 12280 KB Output is correct
100 Correct 106 ms 12108 KB Output is correct
101 Correct 107 ms 12152 KB Output is correct
102 Correct 114 ms 12152 KB Output is correct
103 Correct 119 ms 12152 KB Output is correct
104 Correct 122 ms 12152 KB Output is correct
105 Correct 124 ms 12152 KB Output is correct