oj.uz

Submission #478395

# Submission time Handle Problem Language Result Execution time Memory
478395 2021-10-07T07:47:20 Z ponytail Connecting Supertrees (IOI20_supertrees) C++17
100 / 100
 283 ms 22116 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
int dsu[1000];
 
int dsu2[1000];
 
int set_of(int u) {
    if(dsu[u] == u) return u;
    return dsu[u] = set_of(dsu[u]);
}
 
void union_(int u, int v) {
    dsu[set_of(u)] = set_of(v);
}
 
 
int set_of2(int u) {
    if(dsu2[u] == u) return u;
    return dsu2[u] = set_of2(dsu2[u]);
}
 
void union2(int u, int v) {
    dsu2[set_of2(u)] = set_of2(v);
}
 
 
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++) {
        for(int j=0; j<n; j++) {
            if(p[i][j] == 3) return 0;
        }
    }
    for(int i=0; i<n; i++) {
        dsu[i] = dsu2[i] = i;
    }
    vector<vector<int> > v(n);
    for(int i=0; i<n; i++) {
        for(int j=0; j<n; j++) {
            if(p[i][j] == 1) {
                if(set_of(i) != set_of(j)) {
                    union_(i, j);
                    answer[i][j] = answer[j][i] = 1;
                }
            }
        }
    }
    for(int i=0; i<n; i++) {
        for(int j=0; j<n; j++) {
            if(p[i][j] != 1 && set_of(i) == set_of(j)) {
                return 0;
            }
        }
    }
    vector<int> fin;
    for(int i=0; i<n; i++) {
        for(int j=0; j<n; j++) {
            if(p[i][j] == 2 && set_of(i) != set_of(j)) {
                union2(set_of(i), set_of(j));
            }
        }
    }
    for(int i=0; i<n; i++) {
        v[set_of2(i)].push_back(i);
    }
 
    for(int i=0; i<n; i++) {
        if(v[i].size() == 2) return 0;
    }
 
    for(int i=0; i<n; i++) {
        if(v[i].size() > 2) {
            for(int j=0; j<v[i].size(); j++) {
                answer[v[i][j]][v[i][(j+1) % v[i].size()]] = 1;
                answer[v[i][(j+1) % v[i].size()]][v[i][j]] = 1;
                union_(v[i][j], v[i][(j+1) % v[i].size()]);
            }
        }
    }
    
    for(int i=0; i<n; i++) {
        for(int j=0; j<n; j++) {
            if(set_of(i) != set_of(j) && p[i][j] > 0) return 0;
            if(set_of(i) == set_of(j) && p[i][j] == 0) return 0;
        }
    }

	build(answer);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:80:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |             for(int j=0; j<v[i].size(); j++) {
      |                          ~^~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 11 ms 1100 KB Output is correct
7 Correct 228 ms 21988 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 11 ms 1100 KB Output is correct
7 Correct 228 ms 21988 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1100 KB Output is correct
13 Correct 227 ms 22116 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 4 ms 716 KB Output is correct
17 Correct 97 ms 12172 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 55 ms 5696 KB Output is correct
21 Correct 218 ms 22100 KB Output is correct
22 Correct 226 ms 22020 KB Output is correct
23 Correct 236 ms 22024 KB Output is correct
24 Correct 207 ms 22084 KB Output is correct
25 Correct 78 ms 12160 KB Output is correct
26 Correct 79 ms 12160 KB Output is correct
27 Correct 236 ms 22016 KB Output is correct
28 Correct 204 ms 22084 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 9 ms 1100 KB Output is correct
9 Correct 272 ms 22028 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 10 ms 1100 KB Output is correct
13 Correct 235 ms 22016 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 7 ms 716 KB Output is correct
17 Correct 105 ms 12228 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 57 ms 5788 KB Output is correct
22 Correct 222 ms 22088 KB Output is correct
23 Correct 212 ms 22020 KB Output is correct
24 Correct 234 ms 22088 KB Output is correct
25 Correct 93 ms 12228 KB Output is correct
26 Correct 90 ms 12160 KB Output is correct
27 Correct 210 ms 21988 KB Output is correct
28 Correct 245 ms 22064 KB Output is correct
29 Correct 85 ms 12172 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 59 ms 5684 KB Output is correct
5 Correct 223 ms 22092 KB Output is correct
6 Correct 283 ms 22032 KB Output is correct
7 Correct 243 ms 22028 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 63 ms 5748 KB Output is correct
10 Correct 219 ms 22028 KB Output is correct
11 Correct 222 ms 22084 KB Output is correct
12 Correct 236 ms 22028 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 61 ms 5760 KB Output is correct
17 Correct 210 ms 22028 KB Output is correct
18 Correct 254 ms 22084 KB Output is correct
19 Correct 210 ms 22084 KB Output is correct
20 Correct 216 ms 22028 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 11 ms 1100 KB Output is correct
7 Correct 228 ms 21988 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1100 KB Output is correct
13 Correct 227 ms 22116 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 4 ms 716 KB Output is correct
17 Correct 97 ms 12172 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 55 ms 5696 KB Output is correct
21 Correct 218 ms 22100 KB Output is correct
22 Correct 226 ms 22020 KB Output is correct
23 Correct 236 ms 22024 KB Output is correct
24 Correct 207 ms 22084 KB Output is correct
25 Correct 78 ms 12160 KB Output is correct
26 Correct 79 ms 12160 KB Output is correct
27 Correct 236 ms 22016 KB Output is correct
28 Correct 204 ms 22084 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 9 ms 1100 KB Output is correct
37 Correct 272 ms 22028 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 10 ms 1100 KB Output is correct
41 Correct 235 ms 22016 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 7 ms 716 KB Output is correct
45 Correct 105 ms 12228 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 57 ms 5788 KB Output is correct
50 Correct 222 ms 22088 KB Output is correct
51 Correct 212 ms 22020 KB Output is correct
52 Correct 234 ms 22088 KB Output is correct
53 Correct 93 ms 12228 KB Output is correct
54 Correct 90 ms 12160 KB Output is correct
55 Correct 210 ms 21988 KB Output is correct
56 Correct 245 ms 22064 KB Output is correct
57 Correct 85 ms 12172 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 1 ms 208 KB Output is correct
60 Correct 5 ms 828 KB Output is correct
61 Correct 94 ms 14068 KB Output is correct
62 Correct 0 ms 208 KB Output is correct
63 Correct 1 ms 208 KB Output is correct
64 Correct 1 ms 208 KB Output is correct
65 Correct 58 ms 6252 KB Output is correct
66 Correct 90 ms 14052 KB Output is correct
67 Correct 77 ms 14072 KB Output is correct
68 Correct 123 ms 14152 KB Output is correct
69 Correct 90 ms 14084 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 11 ms 1100 KB Output is correct
7 Correct 228 ms 21988 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1100 KB Output is correct
13 Correct 227 ms 22116 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 4 ms 716 KB Output is correct
17 Correct 97 ms 12172 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 55 ms 5696 KB Output is correct
21 Correct 218 ms 22100 KB Output is correct
22 Correct 226 ms 22020 KB Output is correct
23 Correct 236 ms 22024 KB Output is correct
24 Correct 207 ms 22084 KB Output is correct
25 Correct 78 ms 12160 KB Output is correct
26 Correct 79 ms 12160 KB Output is correct
27 Correct 236 ms 22016 KB Output is correct
28 Correct 204 ms 22084 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 9 ms 1100 KB Output is correct
37 Correct 272 ms 22028 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 10 ms 1100 KB Output is correct
41 Correct 235 ms 22016 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 7 ms 716 KB Output is correct
45 Correct 105 ms 12228 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 57 ms 5788 KB Output is correct
50 Correct 222 ms 22088 KB Output is correct
51 Correct 212 ms 22020 KB Output is correct
52 Correct 234 ms 22088 KB Output is correct
53 Correct 93 ms 12228 KB Output is correct
54 Correct 90 ms 12160 KB Output is correct
55 Correct 210 ms 21988 KB Output is correct
56 Correct 245 ms 22064 KB Output is correct
57 Correct 85 ms 12172 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 1 ms 204 KB Output is correct
61 Correct 59 ms 5684 KB Output is correct
62 Correct 223 ms 22092 KB Output is correct
63 Correct 283 ms 22032 KB Output is correct
64 Correct 243 ms 22028 KB Output is correct
65 Correct 0 ms 204 KB Output is correct
66 Correct 63 ms 5748 KB Output is correct
67 Correct 219 ms 22028 KB Output is correct
68 Correct 222 ms 22084 KB Output is correct
69 Correct 236 ms 22028 KB Output is correct
70 Correct 1 ms 204 KB Output is correct
71 Correct 0 ms 204 KB Output is correct
72 Correct 0 ms 204 KB Output is correct
73 Correct 61 ms 5760 KB Output is correct
74 Correct 210 ms 22028 KB Output is correct
75 Correct 254 ms 22084 KB Output is correct
76 Correct 210 ms 22084 KB Output is correct
77 Correct 216 ms 22028 KB Output is correct
78 Correct 1 ms 204 KB Output is correct
79 Correct 1 ms 208 KB Output is correct
80 Correct 5 ms 828 KB Output is correct
81 Correct 94 ms 14068 KB Output is correct
82 Correct 0 ms 208 KB Output is correct
83 Correct 1 ms 208 KB Output is correct
84 Correct 1 ms 208 KB Output is correct
85 Correct 58 ms 6252 KB Output is correct
86 Correct 90 ms 14052 KB Output is correct
87 Correct 77 ms 14072 KB Output is correct
88 Correct 123 ms 14152 KB Output is correct
89 Correct 90 ms 14084 KB Output is correct
90 Correct 0 ms 208 KB Output is correct
91 Correct 0 ms 208 KB Output is correct
92 Correct 4 ms 848 KB Output is correct
93 Correct 89 ms 14064 KB Output is correct
94 Correct 1 ms 208 KB Output is correct
95 Correct 1 ms 208 KB Output is correct
96 Correct 1 ms 208 KB Output is correct
97 Correct 29 ms 3664 KB Output is correct
98 Correct 91 ms 14068 KB Output is correct
99 Correct 83 ms 14076 KB Output is correct
100 Correct 73 ms 14068 KB Output is correct
101 Correct 72 ms 14080 KB Output is correct
102 Correct 73 ms 14068 KB Output is correct
103 Correct 73 ms 14080 KB Output is correct
104 Correct 71 ms 14064 KB Output is correct
105 Correct 83 ms 14080 KB Output is correct