oj.uz

답안 #779209

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
779209 2023-07-11T09:00:05 Z kamelfanger83 슈퍼트리 잇기 (IOI20_supertrees) C++14
96 / 100
 182 ms 22040 KB 
#include "supertrees.h"
#include <vector>
#include <cassert>
#include <numeric>

using namespace std;

template <typename T>
bool operator==(vector<T> &a, vector<T> &b){
    for (int i = 0; i < a.size(); ++i) {
        if (a[i] != b[i]) return false;
    }
    return true;
}

template <typename T>
bool operator!=(vector<T> &a, vector<T> &b){
    return !(a==b);
}

struct Unionfind {
    vector<int> group;
    Unionfind(int n) {
        group.resize(n);
        iota(group.begin(), group.end(), 0);
    }
    int find(int i){
        if (group[i] == i) return i;
        return group[i] = find(group[i]);
    }
    void merge(int a, int b){
        a = find(a); b = find(b);
        if (a == b) return;
        group[b] = group[a];
    }
};

int construct(vector<vector<int>> p) {
    int n = p.size();
    vector<vector<int>> res (n);
    vector<bool> inc (n);
    vector<bool> hasc (n);

    Unionfind unionfind (n);

    for (int i = 0; i < n; ++i) {
        for (int j = i + 1; j < n; ++j) {
            if (p[i][j] != 0) unionfind.merge(i, j);
        }
    }

    for (int i = 0; i < n; ++i) {
        for (int j = i + 1; j < n; ++j) {
            if ((p[i][j] == 0) && (unionfind.find(i) == unionfind.find(j))) return 0;
        }
    }

    for (int i = 0; i < n; ++i) {
        if (!res[i].empty()) continue;
        res[i].assign(n, 0);
        inc[i] = true;
        for (int j = 0; j < n; ++j) {
            if (p[i][j] == 0 || i == j) continue;
            if (p[i][j] == 1){
                if (p[i] != p[j]) return 0;
                res[j].assign(n, 0);
                res[j][i] = 1;
                res[i][j] = 1;
            }
            if (p[i][j] == 2) hasc[i] = true;
        }
    }

    for (int i = 0; i < n; ++i) {
        if (!inc[i] || !hasc[i]) continue;
        int ft = -1, lt = -1, bt = -1, at = -1;
        for (int j = 0; j < n; ++j) {
            if (i == j) continue;
            if (inc[j] && (unionfind.find(i) == unionfind.find(j))){
                if (p[i][j] != 2) return 0;
                if (ft == -1) ft = j;
                if (j < i) bt = j;
                if (j > i && at == -1) at = j;
                lt = j;
            }
        }
        if (lt == -1) return 0;
        if (at == -1) at = ft;
        if (bt == -1) bt = lt;
        if (at == bt) return 0;
        res[i][bt] = 1;
        res[i][at] = 1;
    }

    build(res);
    return 1;
}

Compilation message

supertrees.cpp: In instantiation of 'bool operator==(std::vector<T>&, std::vector<T>&) [with T = int]':
supertrees.cpp:18:15:   required from 'bool operator!=(std::vector<T>&, std::vector<T>&) [with T = int]'
supertrees.cpp:65:32:   required from here
supertrees.cpp:10:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |     for (int i = 0; i < a.size(); ++i) {
      |                     ~~^~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 6 ms 1108 KB Output is correct
7 Correct 152 ms 21988 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 6 ms 1108 KB Output is correct
7 Correct 152 ms 21988 KB Output is correct
8 Correct 0 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 9 ms 1108 KB Output is correct
13 Correct 176 ms 21996 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 68 ms 8180 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 37 ms 5696 KB Output is correct
21 Correct 147 ms 21996 KB Output is correct
22 Correct 141 ms 21968 KB Output is correct
23 Correct 153 ms 21984 KB Output is correct
24 Correct 148 ms 22020 KB Output is correct
25 Correct 74 ms 8184 KB Output is correct
26 Correct 63 ms 8200 KB Output is correct
27 Correct 182 ms 21992 KB Output is correct
28 Correct 161 ms 21952 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 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 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 7 ms 1108 KB Output is correct
9 Correct 147 ms 22020 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 6 ms 1108 KB Output is correct
13 Correct 154 ms 22016 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 67 ms 8180 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 49 ms 5704 KB Output is correct
22 Correct 151 ms 21960 KB Output is correct
23 Correct 149 ms 22020 KB Output is correct
24 Correct 164 ms 22032 KB Output is correct
25 Correct 80 ms 12020 KB Output is correct
26 Correct 57 ms 8140 KB Output is correct
27 Correct 171 ms 22040 KB Output is correct
28 Correct 155 ms 21960 KB Output is correct
29 Correct 68 ms 12016 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 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 Correct 45 ms 5748 KB Output is correct
5 Correct 145 ms 22032 KB Output is correct
6 Correct 160 ms 21964 KB Output is correct
7 Correct 160 ms 21988 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 46 ms 5704 KB Output is correct
10 Correct 154 ms 22004 KB Output is correct
11 Correct 148 ms 22004 KB Output is correct
12 Correct 165 ms 21964 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 37 ms 5756 KB Output is correct
17 Correct 168 ms 21968 KB Output is correct
18 Correct 146 ms 22016 KB Output is correct
19 Correct 160 ms 22004 KB Output is correct
20 Correct 181 ms 22004 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 6 ms 1108 KB Output is correct
7 Correct 152 ms 21988 KB Output is correct
8 Correct 0 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 9 ms 1108 KB Output is correct
13 Correct 176 ms 21996 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 68 ms 8180 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 37 ms 5696 KB Output is correct
21 Correct 147 ms 21996 KB Output is correct
22 Correct 141 ms 21968 KB Output is correct
23 Correct 153 ms 21984 KB Output is correct
24 Correct 148 ms 22020 KB Output is correct
25 Correct 74 ms 8184 KB Output is correct
26 Correct 63 ms 8200 KB Output is correct
27 Correct 182 ms 21992 KB Output is correct
28 Correct 161 ms 21952 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 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 7 ms 1108 KB Output is correct
37 Correct 147 ms 22020 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 6 ms 1108 KB Output is correct
41 Correct 154 ms 22016 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 3 ms 596 KB Output is correct
45 Correct 67 ms 8180 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 49 ms 5704 KB Output is correct
50 Correct 151 ms 21960 KB Output is correct
51 Correct 149 ms 22020 KB Output is correct
52 Correct 164 ms 22032 KB Output is correct
53 Correct 80 ms 12020 KB Output is correct
54 Correct 57 ms 8140 KB Output is correct
55 Correct 171 ms 22040 KB Output is correct
56 Correct 155 ms 21960 KB Output is correct
57 Correct 68 ms 12016 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 5 ms 596 KB Output is correct
61 Correct 82 ms 8188 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 0 ms 212 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 45 ms 5636 KB Output is correct
66 Correct 77 ms 8180 KB Output is correct
67 Correct 67 ms 8180 KB Output is correct
68 Correct 74 ms 8180 KB Output is correct
69 Correct 64 ms 12036 KB Output is correct

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 6 ms 1108 KB Output is correct
7 Correct 152 ms 21988 KB Output is correct
8 Correct 0 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 9 ms 1108 KB Output is correct
13 Correct 176 ms 21996 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 68 ms 8180 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 37 ms 5696 KB Output is correct
21 Correct 147 ms 21996 KB Output is correct
22 Correct 141 ms 21968 KB Output is correct
23 Correct 153 ms 21984 KB Output is correct
24 Correct 148 ms 22020 KB Output is correct
25 Correct 74 ms 8184 KB Output is correct
26 Correct 63 ms 8200 KB Output is correct
27 Correct 182 ms 21992 KB Output is correct
28 Correct 161 ms 21952 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 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 7 ms 1108 KB Output is correct
37 Correct 147 ms 22020 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 6 ms 1108 KB Output is correct
41 Correct 154 ms 22016 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 3 ms 596 KB Output is correct
45 Correct 67 ms 8180 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 49 ms 5704 KB Output is correct
50 Correct 151 ms 21960 KB Output is correct
51 Correct 149 ms 22020 KB Output is correct
52 Correct 164 ms 22032 KB Output is correct
53 Correct 80 ms 12020 KB Output is correct
54 Correct 57 ms 8140 KB Output is correct
55 Correct 171 ms 22040 KB Output is correct
56 Correct 155 ms 21960 KB Output is correct
57 Correct 68 ms 12016 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 45 ms 5748 KB Output is correct
62 Correct 145 ms 22032 KB Output is correct
63 Correct 160 ms 21964 KB Output is correct
64 Correct 160 ms 21988 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 46 ms 5704 KB Output is correct
67 Correct 154 ms 22004 KB Output is correct
68 Correct 148 ms 22004 KB Output is correct
69 Correct 165 ms 21964 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Correct 37 ms 5756 KB Output is correct
74 Correct 168 ms 21968 KB Output is correct
75 Correct 146 ms 22016 KB Output is correct
76 Correct 160 ms 22004 KB Output is correct
77 Correct 181 ms 22004 KB Output is correct
78 Correct 1 ms 212 KB Output is correct
79 Correct 0 ms 212 KB Output is correct
80 Correct 5 ms 596 KB Output is correct
81 Correct 82 ms 8188 KB Output is correct
82 Correct 0 ms 212 KB Output is correct
83 Correct 0 ms 212 KB Output is correct
84 Correct 0 ms 212 KB Output is correct
85 Correct 45 ms 5636 KB Output is correct
86 Correct 77 ms 8180 KB Output is correct
87 Correct 67 ms 8180 KB Output is correct
88 Correct 74 ms 8180 KB Output is correct
89 Correct 64 ms 12036 KB Output is correct
90 Correct 0 ms 212 KB Output is correct
91 Correct 0 ms 212 KB Output is correct
92 Correct 3 ms 596 KB Output is correct
93 Correct 70 ms 8180 KB Output is correct
94 Correct 0 ms 212 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 0 ms 212 KB Output is correct
97 Correct 16 ms 2172 KB Output is correct
98 Correct 61 ms 8200 KB Output is correct
99 Correct 62 ms 8188 KB Output is correct
100 Correct 63 ms 8184 KB Output is correct
101 Incorrect 150 ms 21948 KB Answer gives possible 1 while actual possible 0
102 Halted 0 ms 0 KB -