oj.uz

답안 #313781

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
313781 2020-10-17T04:44:19 Z nikatamliani 슈퍼트리 잇기 (IOI20_supertrees) C++14
100 / 100
 316 ms 22360 KB 
#include <bits/stdc++.h>
using namespace std;
#include "supertrees.h"
int find_set(int x, vector < int > &parent) {
    return parent[x] == x ? x : parent[x] = find_set(parent[x], parent);
}
void union_sets(int x, int y, vector < int > &parent) {
    x = find_set(x, parent);
    y = find_set(y, parent);
    parent[x] = y; 
}
int construct(vector < vector < int > > p) {
    int n = p.size();
    vector < int > parent(n);
    for(int i = 0; i < n; ++i) parent[i] = i;
    for(int i = 0; i < n; ++i) {
        for(int j = 0; j < n; ++j) {
            if(p[i][j] == 3) return 0;
            if(p[i][j] > 0) {
                union_sets(i, j, parent);
            }
        }
    }
    for(int i = 0; i < n; ++i) {
        for(int j = 0; j < n; ++j) {
            if(find_set(i, parent) == find_set(j, parent) && !p[i][j]) {
                return 0;
            }
        }
    }
    vector < vector < int > > g(n, vector < int >(0, 0));
    for(int i = 0; i < n; ++i) {
        g[find_set(i, parent)].push_back(i);
    }
    for(int i = 0; i < n; ++i) parent[i] = i;
    vector < vector < int > > edges(n, vector < int >(n, 0));
    for(int i = 0; i < n; ++i) {
        if(g[i].empty()) continue;
        for(int x : g[i]) {
            for(int y : g[i]) {
                if(p[x][y] == 1) {
                    union_sets(x, y, parent);
                }
            }
        }
        for(int x : g[i]) {
            for(int y : g[i]) {
                if(find_set(x, parent) == find_set(y, parent) && p[x][y] == 2) {
                    return 0;
                }
            }
        }
        vector < int > last(n, -1), parents;
        for(int x : g[i]) {
            int pp = find_set(x, parent);
            if(~last[pp]) {
                edges[last[pp]][x] = edges[x][last[pp]] = 1; 
            }
            last[pp] = x;
            if(x == pp) {
                parents.push_back(x);
            }
        }
        if(parents.size() == 2) {
            return 0;
        }
        for(int j = 1; j < parents.size(); ++j) {
            int from = parents[j - 1], to = parents[j];
            edges[from][to] = edges[to][from] = 1; 
        }
        int from = parents.back(), to = parents[0];
        if(from != to) {
            edges[from][to] = edges[to][from] = 1;  
        }
    }
    build(edges);
    return 1;
}

Compilation message

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

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 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 1 ms 384 KB Output is correct
6 Correct 12 ms 1152 KB Output is correct
7 Correct 316 ms 22100 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 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 1 ms 384 KB Output is correct
6 Correct 12 ms 1152 KB Output is correct
7 Correct 316 ms 22100 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 12 ms 1152 KB Output is correct
13 Correct 241 ms 22240 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 125 ms 8184 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 90 ms 5788 KB Output is correct
21 Correct 248 ms 22136 KB Output is correct
22 Correct 243 ms 22136 KB Output is correct
23 Correct 281 ms 22136 KB Output is correct
24 Correct 245 ms 22136 KB Output is correct
25 Correct 98 ms 8184 KB Output is correct
26 Correct 94 ms 8184 KB Output is correct
27 Correct 283 ms 22136 KB Output is correct
28 Correct 239 ms 22136 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 10 ms 1152 KB Output is correct
9 Correct 236 ms 22360 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 11 ms 1152 KB Output is correct
13 Correct 260 ms 22100 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 110 ms 8184 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 61 ms 5880 KB Output is correct
22 Correct 270 ms 22140 KB Output is correct
23 Correct 238 ms 22136 KB Output is correct
24 Correct 265 ms 22164 KB Output is correct
25 Correct 98 ms 12152 KB Output is correct
26 Correct 96 ms 8184 KB Output is correct
27 Correct 251 ms 22136 KB Output is correct
28 Correct 262 ms 22136 KB Output is correct
29 Correct 98 ms 12152 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 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 81 ms 5880 KB Output is correct
5 Correct 251 ms 22232 KB Output is correct
6 Correct 241 ms 22136 KB Output is correct
7 Correct 271 ms 22136 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 61 ms 5880 KB Output is correct
10 Correct 244 ms 22136 KB Output is correct
11 Correct 235 ms 22136 KB Output is correct
12 Correct 266 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 0 ms 256 KB Output is correct
16 Correct 61 ms 5880 KB Output is correct
17 Correct 248 ms 22136 KB Output is correct
18 Correct 247 ms 22136 KB Output is correct
19 Correct 243 ms 22136 KB Output is correct
20 Correct 240 ms 22264 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 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 1 ms 384 KB Output is correct
6 Correct 12 ms 1152 KB Output is correct
7 Correct 316 ms 22100 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 12 ms 1152 KB Output is correct
13 Correct 241 ms 22240 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 125 ms 8184 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 90 ms 5788 KB Output is correct
21 Correct 248 ms 22136 KB Output is correct
22 Correct 243 ms 22136 KB Output is correct
23 Correct 281 ms 22136 KB Output is correct
24 Correct 245 ms 22136 KB Output is correct
25 Correct 98 ms 8184 KB Output is correct
26 Correct 94 ms 8184 KB Output is correct
27 Correct 283 ms 22136 KB Output is correct
28 Correct 239 ms 22136 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 0 ms 256 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 10 ms 1152 KB Output is correct
37 Correct 236 ms 22360 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 11 ms 1152 KB Output is correct
41 Correct 260 ms 22100 KB Output is correct
42 Correct 0 ms 256 KB Output is correct
43 Correct 0 ms 256 KB Output is correct
44 Correct 5 ms 640 KB Output is correct
45 Correct 110 ms 8184 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 1 ms 256 KB Output is correct
49 Correct 61 ms 5880 KB Output is correct
50 Correct 270 ms 22140 KB Output is correct
51 Correct 238 ms 22136 KB Output is correct
52 Correct 265 ms 22164 KB Output is correct
53 Correct 98 ms 12152 KB Output is correct
54 Correct 96 ms 8184 KB Output is correct
55 Correct 251 ms 22136 KB Output is correct
56 Correct 262 ms 22136 KB Output is correct
57 Correct 98 ms 12152 KB Output is correct
58 Correct 0 ms 256 KB Output is correct
59 Correct 1 ms 256 KB Output is correct
60 Correct 5 ms 640 KB Output is correct
61 Correct 118 ms 8280 KB Output is correct
62 Correct 1 ms 256 KB Output is correct
63 Correct 1 ms 256 KB Output is correct
64 Correct 1 ms 256 KB Output is correct
65 Correct 61 ms 5880 KB Output is correct
66 Correct 96 ms 8188 KB Output is correct
67 Correct 101 ms 8184 KB Output is correct
68 Correct 96 ms 8156 KB Output is correct
69 Correct 99 ms 12280 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 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 1 ms 384 KB Output is correct
6 Correct 12 ms 1152 KB Output is correct
7 Correct 316 ms 22100 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 12 ms 1152 KB Output is correct
13 Correct 241 ms 22240 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 125 ms 8184 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 90 ms 5788 KB Output is correct
21 Correct 248 ms 22136 KB Output is correct
22 Correct 243 ms 22136 KB Output is correct
23 Correct 281 ms 22136 KB Output is correct
24 Correct 245 ms 22136 KB Output is correct
25 Correct 98 ms 8184 KB Output is correct
26 Correct 94 ms 8184 KB Output is correct
27 Correct 283 ms 22136 KB Output is correct
28 Correct 239 ms 22136 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 0 ms 256 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 10 ms 1152 KB Output is correct
37 Correct 236 ms 22360 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 11 ms 1152 KB Output is correct
41 Correct 260 ms 22100 KB Output is correct
42 Correct 0 ms 256 KB Output is correct
43 Correct 0 ms 256 KB Output is correct
44 Correct 5 ms 640 KB Output is correct
45 Correct 110 ms 8184 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 1 ms 256 KB Output is correct
49 Correct 61 ms 5880 KB Output is correct
50 Correct 270 ms 22140 KB Output is correct
51 Correct 238 ms 22136 KB Output is correct
52 Correct 265 ms 22164 KB Output is correct
53 Correct 98 ms 12152 KB Output is correct
54 Correct 96 ms 8184 KB Output is correct
55 Correct 251 ms 22136 KB Output is correct
56 Correct 262 ms 22136 KB Output is correct
57 Correct 98 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 1 ms 256 KB Output is correct
61 Correct 81 ms 5880 KB Output is correct
62 Correct 251 ms 22232 KB Output is correct
63 Correct 241 ms 22136 KB Output is correct
64 Correct 271 ms 22136 KB Output is correct
65 Correct 0 ms 256 KB Output is correct
66 Correct 61 ms 5880 KB Output is correct
67 Correct 244 ms 22136 KB Output is correct
68 Correct 235 ms 22136 KB Output is correct
69 Correct 266 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 0 ms 256 KB Output is correct
73 Correct 61 ms 5880 KB Output is correct
74 Correct 248 ms 22136 KB Output is correct
75 Correct 247 ms 22136 KB Output is correct
76 Correct 243 ms 22136 KB Output is correct
77 Correct 240 ms 22264 KB Output is correct
78 Correct 0 ms 256 KB Output is correct
79 Correct 1 ms 256 KB Output is correct
80 Correct 5 ms 640 KB Output is correct
81 Correct 118 ms 8280 KB Output is correct
82 Correct 1 ms 256 KB Output is correct
83 Correct 1 ms 256 KB Output is correct
84 Correct 1 ms 256 KB Output is correct
85 Correct 61 ms 5880 KB Output is correct
86 Correct 96 ms 8188 KB Output is correct
87 Correct 101 ms 8184 KB Output is correct
88 Correct 96 ms 8156 KB Output is correct
89 Correct 99 ms 12280 KB Output is correct
90 Correct 0 ms 256 KB Output is correct
91 Correct 1 ms 256 KB Output is correct
92 Correct 4 ms 640 KB Output is correct
93 Correct 96 ms 8184 KB Output is correct
94 Correct 0 ms 256 KB Output is correct
95 Correct 1 ms 256 KB Output is correct
96 Correct 0 ms 256 KB Output is correct
97 Correct 23 ms 2304 KB Output is correct
98 Correct 108 ms 8156 KB Output is correct
99 Correct 94 ms 8184 KB Output is correct
100 Correct 91 ms 8184 KB Output is correct
101 Correct 92 ms 8184 KB Output is correct
102 Correct 94 ms 8184 KB Output is correct
103 Correct 93 ms 8184 KB Output is correct
104 Correct 95 ms 8184 KB Output is correct
105 Correct 100 ms 8188 KB Output is correct