oj.uz

답안 #303161

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
303161 2020-09-19T23:50:24 Z qpwoeirut 슈퍼트리 잇기 (IOI20_supertrees) C++17
100 / 100
 271 ms 22268 KB 
#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;

typedef vector<vector<int>> vvi;
typedef pair<int,int> pii;

const int MN = 1001;
int N;

int root[MN];
int oroot[MN];
int par(int u) {
    if (u == root[u]) return u;
    root[u] = par(root[u]);
    return root[u];
}
void join(int u, int v) {
    int ru = par(u), rv = par(v);
    if (ru == rv) return;
    root[ru] = rv;
}
int opar(int u) {
    if (u == oroot[u]) return u;
    oroot[u] = opar(oroot[u]);
    return oroot[u];
}
void ojoin(int u, int v) {
    int ru = opar(u), rv = opar(v);
    if (ru == rv) return;
    oroot[ru] = rv;
}
bool dsu(const vvi& p) {
    for (int i=0; i<N; ++i) {
        root[i] = i;
        oroot[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]) join(i, j);
            if (p[i][j] == 1) ojoin(i, j);
        }
    }
    for (int i=0; i<N; ++i) {
        for (int j=0; j<N; ++j) {
            if (p[i][j] == 0 && par(i) == par(j)) return 0;
            if (p[opar(i)][j] != p[i][j]) return 0;
        }
    }
    
    return 1;
}

int ones[MN];
vvi ans;
bool make_part(const vvi& p, const vector<int>& nodes) {
    set<pii, greater<pii>> q;
    for (int i=0; i<nodes.size(); ++i) {
        q.insert(pii(ones[nodes[i]], nodes[i]));
    }

    int root = -1;
    int last = -1;

    int inner_ct = 0;
    while (q.size() > 0) {
        int cur = q.begin()->second;
        q.erase(q.begin());
        ++inner_ct;

        if (root == -1) {
            root = cur;
        }
        if (last != -1) {
            ans[cur][last] = 1;
            ans[last][cur] = 1;
        }
        last = cur;

        for (int i=0; i<N; ++i) {
            if (cur == i) continue;
            if (p[cur][i] == 1) {
                ans[cur][i] = 1;
                ans[i][cur] = 1;
                q.erase(pii(ones[i], i));
            }
        }
    }
    assert(root != -1 && last != -1);
    if (inner_ct <= 2) {
        for (int i=0; i<N; ++i ) {
            if (p[root][i] == 2 || p[last][i] == 2) {
                return false;
            }
        }
    }

    if (root != last) {
        ans[root][last] = 1;
        ans[last][root] = 1;
    }
    return 1;
}

int construct(std::vector<std::vector<int>> p) {
	N = p.size();
    if (!dsu(p)) return 0;

    map<int, vector<int>> parts;
    for (int i=0; i<N; ++i) {
        parts[par(i)].push_back(i);
        for (int j=0; j<N; ++j) {
            if (p[i][j] == 1) ++ones[i];
        }
    }

    ans = vvi(N, vector<int>(N));
    for (auto it=parts.begin(); it!=parts.end(); ++it) {
        if (!make_part(p, it->second)) return 0;
    }

    build(ans);

    return 1;
}

Compilation message

supertrees.cpp: In function 'bool make_part(const vvi&, const std::vector<int>&)':
supertrees.cpp:60:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |     for (int i=0; i<nodes.size(); ++i) {
      |                   ~^~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 384 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 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 258 ms 22136 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 384 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 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 258 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 11 ms 1408 KB Output is correct
13 Correct 240 ms 22264 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 111 ms 8060 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 5880 KB Output is correct
21 Correct 246 ms 22136 KB Output is correct
22 Correct 244 ms 22264 KB Output is correct
23 Correct 271 ms 22136 KB Output is correct
24 Correct 242 ms 22264 KB Output is correct
25 Correct 97 ms 8312 KB Output is correct
26 Correct 93 ms 8184 KB Output is correct
27 Correct 269 ms 22136 KB Output is correct
28 Correct 239 ms 22264 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 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 1280 KB Output is correct
9 Correct 243 ms 22268 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 10 ms 1152 KB Output is correct
13 Correct 246 ms 22136 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 117 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 384 KB Output is correct
21 Correct 63 ms 6008 KB Output is correct
22 Correct 243 ms 22136 KB Output is correct
23 Correct 243 ms 22264 KB Output is correct
24 Correct 256 ms 22140 KB Output is correct
25 Correct 99 ms 12280 KB Output is correct
26 Correct 95 ms 8184 KB Output is correct
27 Correct 240 ms 22264 KB Output is correct
28 Correct 256 ms 22136 KB Output is correct
29 Correct 100 ms 12280 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 70 ms 5880 KB Output is correct
5 Correct 250 ms 22136 KB Output is correct
6 Correct 242 ms 22136 KB Output is correct
7 Correct 263 ms 22136 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 61 ms 5840 KB Output is correct
10 Correct 244 ms 22152 KB Output is correct
11 Correct 242 ms 22136 KB Output is correct
12 Correct 262 ms 22172 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 61 ms 5880 KB Output is correct
17 Correct 245 ms 22136 KB Output is correct
18 Correct 250 ms 22136 KB Output is correct
19 Correct 244 ms 22136 KB Output is correct
20 Correct 237 ms 22136 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 384 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 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 258 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 11 ms 1408 KB Output is correct
13 Correct 240 ms 22264 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 111 ms 8060 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 5880 KB Output is correct
21 Correct 246 ms 22136 KB Output is correct
22 Correct 244 ms 22264 KB Output is correct
23 Correct 271 ms 22136 KB Output is correct
24 Correct 242 ms 22264 KB Output is correct
25 Correct 97 ms 8312 KB Output is correct
26 Correct 93 ms 8184 KB Output is correct
27 Correct 269 ms 22136 KB Output is correct
28 Correct 239 ms 22264 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 0 ms 384 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 1280 KB Output is correct
37 Correct 243 ms 22268 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 10 ms 1152 KB Output is correct
41 Correct 246 ms 22136 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 117 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 384 KB Output is correct
49 Correct 63 ms 6008 KB Output is correct
50 Correct 243 ms 22136 KB Output is correct
51 Correct 243 ms 22264 KB Output is correct
52 Correct 256 ms 22140 KB Output is correct
53 Correct 99 ms 12280 KB Output is correct
54 Correct 95 ms 8184 KB Output is correct
55 Correct 240 ms 22264 KB Output is correct
56 Correct 256 ms 22136 KB Output is correct
57 Correct 100 ms 12280 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 0 ms 256 KB Output is correct
60 Correct 5 ms 640 KB Output is correct
61 Correct 114 ms 8184 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 0 ms 384 KB Output is correct
64 Correct 0 ms 384 KB Output is correct
65 Correct 61 ms 5840 KB Output is correct
66 Correct 94 ms 8184 KB Output is correct
67 Correct 99 ms 8152 KB Output is correct
68 Correct 95 ms 8184 KB Output is correct
69 Correct 100 ms 12280 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 384 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 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 258 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 11 ms 1408 KB Output is correct
13 Correct 240 ms 22264 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 111 ms 8060 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 5880 KB Output is correct
21 Correct 246 ms 22136 KB Output is correct
22 Correct 244 ms 22264 KB Output is correct
23 Correct 271 ms 22136 KB Output is correct
24 Correct 242 ms 22264 KB Output is correct
25 Correct 97 ms 8312 KB Output is correct
26 Correct 93 ms 8184 KB Output is correct
27 Correct 269 ms 22136 KB Output is correct
28 Correct 239 ms 22264 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 0 ms 384 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 1280 KB Output is correct
37 Correct 243 ms 22268 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 10 ms 1152 KB Output is correct
41 Correct 246 ms 22136 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 117 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 384 KB Output is correct
49 Correct 63 ms 6008 KB Output is correct
50 Correct 243 ms 22136 KB Output is correct
51 Correct 243 ms 22264 KB Output is correct
52 Correct 256 ms 22140 KB Output is correct
53 Correct 99 ms 12280 KB Output is correct
54 Correct 95 ms 8184 KB Output is correct
55 Correct 240 ms 22264 KB Output is correct
56 Correct 256 ms 22136 KB Output is correct
57 Correct 100 ms 12280 KB Output is correct
58 Correct 1 ms 256 KB Output is correct
59 Correct 0 ms 384 KB Output is correct
60 Correct 0 ms 384 KB Output is correct
61 Correct 70 ms 5880 KB Output is correct
62 Correct 250 ms 22136 KB Output is correct
63 Correct 242 ms 22136 KB Output is correct
64 Correct 263 ms 22136 KB Output is correct
65 Correct 1 ms 256 KB Output is correct
66 Correct 61 ms 5840 KB Output is correct
67 Correct 244 ms 22152 KB Output is correct
68 Correct 242 ms 22136 KB Output is correct
69 Correct 262 ms 22172 KB Output is correct
70 Correct 0 ms 256 KB Output is correct
71 Correct 0 ms 384 KB Output is correct
72 Correct 0 ms 384 KB Output is correct
73 Correct 61 ms 5880 KB Output is correct
74 Correct 245 ms 22136 KB Output is correct
75 Correct 250 ms 22136 KB Output is correct
76 Correct 244 ms 22136 KB Output is correct
77 Correct 237 ms 22136 KB Output is correct
78 Correct 0 ms 384 KB Output is correct
79 Correct 0 ms 256 KB Output is correct
80 Correct 5 ms 640 KB Output is correct
81 Correct 114 ms 8184 KB Output is correct
82 Correct 1 ms 384 KB Output is correct
83 Correct 0 ms 384 KB Output is correct
84 Correct 0 ms 384 KB Output is correct
85 Correct 61 ms 5840 KB Output is correct
86 Correct 94 ms 8184 KB Output is correct
87 Correct 99 ms 8152 KB Output is correct
88 Correct 95 ms 8184 KB Output is correct
89 Correct 100 ms 12280 KB Output is correct
90 Correct 0 ms 256 KB Output is correct
91 Correct 0 ms 384 KB Output is correct
92 Correct 4 ms 640 KB Output is correct
93 Correct 98 ms 8184 KB Output is correct
94 Correct 1 ms 256 KB Output is correct
95 Correct 0 ms 256 KB Output is correct
96 Correct 1 ms 384 KB Output is correct
97 Correct 24 ms 2260 KB Output is correct
98 Correct 91 ms 8184 KB Output is correct
99 Correct 100 ms 8184 KB Output is correct
100 Correct 93 ms 8184 KB Output is correct
101 Correct 90 ms 8184 KB Output is correct
102 Correct 94 ms 8184 KB Output is correct
103 Correct 103 ms 8184 KB Output is correct
104 Correct 108 ms 8184 KB Output is correct
105 Correct 104 ms 8184 KB Output is correct