oj.uz

답안 #568969

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
568969 2022-05-26T11:49:08 Z Stickfish 슈퍼트리 잇기 (IOI20_supertrees) C++17
100 / 100
 195 ms 24028 KB 
#include "supertrees.h"
#include <vector>
#include <iostream>
using namespace std;

struct dsu {
    void resize(int n) {
        par.resize(n);
        sz.assign(n, 1);
        for (int i = 0; i < n; ++i)
            par[i] = i;
    }

    int gst(int i) {
        if (par[i] == i)
            return i;
        return par[i] = gst(par[i]);
    }

    void unite(int i, int j) {
        i = gst(i);
        j = gst(j);
        if (i == j)
            return;
        if (sz[i] < sz[j])
            swap(i, j);
        par[j] = i;
        sz[i] += sz[j];
    }
 private:
     vector<int> par;
     vector<int> sz;
};

int construct(vector<vector<int>> p) {
	int n = p.size();
    dsu suall;
    suall.resize(n);
    dsu su1;
    su1.resize(n);
    for (int i = 0; i < n; ++i) {
        for (int j = i + 1; j < n; ++j) {
            if (p[i][j] > 0)
                suall.unite(i, j);
            if (p[i][j] == 1)
                su1.unite(i, j);
            if (p[i][j] == 3)
                return 0;
        }
    }
    for (int i = 0; i < n; ++i) {
        for (int j = i + 1; j < n; ++j) {
            if (p[i][j] == 0 && suall.gst(i) == suall.gst(j))
                return 0;
            if (p[i][j] == 2 && su1.gst(i) == su1.gst(j))
                return 0;
        }
    }
    //for (int i = 0; i < n; ++i)
        //cout << suall.gst(i) << ' ';
    //cout << endl;
    //for (int i = 0; i < n; ++i)
        //cout << su1.gst(i) << ' ';
    //cout << endl;
    vector<vector<int>> ans(n, vector<int>(n, 0));
    for (int i = 0; i < n; ++i) {
        if (suall.gst(i) == i) {
            vector<int> comp;
            for (int j = 0; j < n; ++j) {
                if (suall.gst(j) == i)
                    comp.push_back(j);
            }
            vector<int> cycle;
            for (int j : comp) {
                if (su1.gst(j) == j)
                    cycle.push_back(j);
                else
                    ans[j][su1.gst(j)] = ans[su1.gst(j)][j] = 1;
            }
            if (cycle.size() == 2) {
                return 0;
            }
            if (cycle.size() > 1) {
                for (int t = 0; t < cycle.size(); ++t) {
                    int v = cycle[t];
                    int u = cycle[(t + 1) % cycle.size()];
                    ans[u][v] = ans[v][u] = 1;
                }
            }
        }
    }
    build(ans);
    return 1;
    
}

Compilation message

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

Subtask #1
11.0 / 11.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 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 7 ms 1108 KB Output is correct
7 Correct 166 ms 22032 KB Output is correct

Subtask #2
10.0 / 10.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 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 7 ms 1108 KB Output is correct
7 Correct 166 ms 22032 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 7 ms 1108 KB Output is correct
13 Correct 174 ms 22032 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 4 ms 596 KB Output is correct
17 Correct 76 ms 8196 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 44 ms 5776 KB Output is correct
21 Correct 180 ms 22004 KB Output is correct
22 Correct 174 ms 22036 KB Output is correct
23 Correct 193 ms 22024 KB Output is correct
24 Correct 172 ms 22024 KB Output is correct
25 Correct 69 ms 8068 KB Output is correct
26 Correct 71 ms 8140 KB Output is correct
27 Correct 181 ms 22072 KB Output is correct
28 Correct 195 ms 22016 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 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 8 ms 1236 KB Output is correct
9 Correct 174 ms 24012 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1264 KB Output is correct
13 Correct 168 ms 23936 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 4 ms 596 KB Output is correct
17 Correct 80 ms 10112 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 45 ms 6260 KB Output is correct
22 Correct 181 ms 24012 KB Output is correct
23 Correct 177 ms 24028 KB Output is correct
24 Correct 185 ms 23908 KB Output is correct
25 Correct 76 ms 14072 KB Output is correct
26 Correct 68 ms 10100 KB Output is correct
27 Correct 179 ms 23908 KB Output is correct
28 Correct 186 ms 23932 KB Output is correct
29 Correct 74 ms 14004 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 49 ms 5868 KB Output is correct
5 Correct 174 ms 21972 KB Output is correct
6 Correct 180 ms 21996 KB Output is correct
7 Correct 188 ms 22036 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 51 ms 5664 KB Output is correct
10 Correct 185 ms 22172 KB Output is correct
11 Correct 170 ms 22020 KB Output is correct
12 Correct 184 ms 22032 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 280 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 45 ms 5764 KB Output is correct
17 Correct 179 ms 22012 KB Output is correct
18 Correct 170 ms 22032 KB Output is correct
19 Correct 164 ms 22016 KB Output is correct
20 Correct 174 ms 21996 KB Output is correct

Subtask #5
21.0 / 21.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 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 7 ms 1108 KB Output is correct
7 Correct 166 ms 22032 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 7 ms 1108 KB Output is correct
13 Correct 174 ms 22032 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 4 ms 596 KB Output is correct
17 Correct 76 ms 8196 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 44 ms 5776 KB Output is correct
21 Correct 180 ms 22004 KB Output is correct
22 Correct 174 ms 22036 KB Output is correct
23 Correct 193 ms 22024 KB Output is correct
24 Correct 172 ms 22024 KB Output is correct
25 Correct 69 ms 8068 KB Output is correct
26 Correct 71 ms 8140 KB Output is correct
27 Correct 181 ms 22072 KB Output is correct
28 Correct 195 ms 22016 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 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 296 KB Output is correct
36 Correct 8 ms 1236 KB Output is correct
37 Correct 174 ms 24012 KB Output is correct
38 Correct 1 ms 296 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 7 ms 1264 KB Output is correct
41 Correct 168 ms 23936 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 4 ms 596 KB Output is correct
45 Correct 80 ms 10112 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 45 ms 6260 KB Output is correct
50 Correct 181 ms 24012 KB Output is correct
51 Correct 177 ms 24028 KB Output is correct
52 Correct 185 ms 23908 KB Output is correct
53 Correct 76 ms 14072 KB Output is correct
54 Correct 68 ms 10100 KB Output is correct
55 Correct 179 ms 23908 KB Output is correct
56 Correct 186 ms 23932 KB Output is correct
57 Correct 74 ms 14004 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 304 KB Output is correct
60 Correct 4 ms 672 KB Output is correct
61 Correct 79 ms 10116 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 1 ms 212 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 46 ms 6224 KB Output is correct
66 Correct 72 ms 10100 KB Output is correct
67 Correct 68 ms 10096 KB Output is correct
68 Correct 69 ms 10100 KB Output is correct
69 Correct 68 ms 14076 KB Output is correct

Subtask #6
4.0 / 4.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 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 7 ms 1108 KB Output is correct
7 Correct 166 ms 22032 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 7 ms 1108 KB Output is correct
13 Correct 174 ms 22032 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 4 ms 596 KB Output is correct
17 Correct 76 ms 8196 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 44 ms 5776 KB Output is correct
21 Correct 180 ms 22004 KB Output is correct
22 Correct 174 ms 22036 KB Output is correct
23 Correct 193 ms 22024 KB Output is correct
24 Correct 172 ms 22024 KB Output is correct
25 Correct 69 ms 8068 KB Output is correct
26 Correct 71 ms 8140 KB Output is correct
27 Correct 181 ms 22072 KB Output is correct
28 Correct 195 ms 22016 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 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 296 KB Output is correct
36 Correct 8 ms 1236 KB Output is correct
37 Correct 174 ms 24012 KB Output is correct
38 Correct 1 ms 296 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 7 ms 1264 KB Output is correct
41 Correct 168 ms 23936 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 4 ms 596 KB Output is correct
45 Correct 80 ms 10112 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 45 ms 6260 KB Output is correct
50 Correct 181 ms 24012 KB Output is correct
51 Correct 177 ms 24028 KB Output is correct
52 Correct 185 ms 23908 KB Output is correct
53 Correct 76 ms 14072 KB Output is correct
54 Correct 68 ms 10100 KB Output is correct
55 Correct 179 ms 23908 KB Output is correct
56 Correct 186 ms 23932 KB Output is correct
57 Correct 74 ms 14004 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 49 ms 5868 KB Output is correct
62 Correct 174 ms 21972 KB Output is correct
63 Correct 180 ms 21996 KB Output is correct
64 Correct 188 ms 22036 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 51 ms 5664 KB Output is correct
67 Correct 185 ms 22172 KB Output is correct
68 Correct 170 ms 22020 KB Output is correct
69 Correct 184 ms 22032 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 1 ms 280 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Correct 45 ms 5764 KB Output is correct
74 Correct 179 ms 22012 KB Output is correct
75 Correct 170 ms 22032 KB Output is correct
76 Correct 164 ms 22016 KB Output is correct
77 Correct 174 ms 21996 KB Output is correct
78 Correct 1 ms 212 KB Output is correct
79 Correct 1 ms 304 KB Output is correct
80 Correct 4 ms 672 KB Output is correct
81 Correct 79 ms 10116 KB Output is correct
82 Correct 1 ms 212 KB Output is correct
83 Correct 1 ms 212 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 46 ms 6224 KB Output is correct
86 Correct 72 ms 10100 KB Output is correct
87 Correct 68 ms 10096 KB Output is correct
88 Correct 69 ms 10100 KB Output is correct
89 Correct 68 ms 14076 KB Output is correct
90 Correct 1 ms 212 KB Output is correct
91 Correct 1 ms 212 KB Output is correct
92 Correct 4 ms 596 KB Output is correct
93 Correct 73 ms 10184 KB Output is correct
94 Correct 1 ms 212 KB Output is correct
95 Correct 1 ms 304 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 18 ms 2676 KB Output is correct
98 Correct 69 ms 10060 KB Output is correct
99 Correct 71 ms 10092 KB Output is correct
100 Correct 66 ms 10060 KB Output is correct
101 Correct 70 ms 10060 KB Output is correct
102 Correct 72 ms 10104 KB Output is correct
103 Correct 67 ms 10100 KB Output is correct
104 Correct 77 ms 10064 KB Output is correct
105 Correct 80 ms 10060 KB Output is correct