oj.uz

답안 #1046542

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1046542 2024-08-06T16:26:44 Z vanea 슈퍼트리 잇기 (IOI20_supertrees) C++14
100 / 100
 122 ms 22352 KB 
#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
using ll = long long;

const int mxN = 1e3+10;

vector<int> adj[mxN];

int p[mxN], root[mxN];

int get(int x) {
    return p[x] < 0 ? x : p[x] = get(p[x]);
}

void uni(int x, int y) {
    x = get(x); y = get(y);
    if(x == y) return ;
    if(p[x] > p[y]) swap(x, y);
    p[x] += p[y];
    p[y] = x;
}

bool same(int a, int b) {
    return get(a) == get(b);
}

int construct(vector<vector<int>> P) {
    int n = P.size();
    for(int i = 0; i < n; i++) {
        p[i] = -1;
        root[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] == 1 && !same(i, j)) {
                adj[i].push_back(j);
                adj[j].push_back(i);
                uni(i, j);
            }
        }
    }
    bool pos = true;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++) {
            if(P[i][j] == 1 && !same(i, j)) pos = false;
            else if(P[i][j] == 2 && same(i, j)) pos = false;
            else if(!P[i][j] && same(i, j)) pos = false;
        }
    }
    for(int i = 0; i < n; i++) {
        set<int> s;
        for(int j = 0; j < n; j++) {
            if(P[i][j] == 2 && !same(i, j)) {
                s.insert(get(j));
            }
        }
        if(s.empty()) continue;
        if(s.size() == 1) {
            pos = false;
            break;
        }
        vector<int> v; for(auto it : s) v.push_back(it);
        for(int i = 0; i+1 < v.size(); i++) {
            int a = root[get(v[i])], b = root[get(v[i+1])];
            adj[a].push_back(b);
            adj[b].push_back(a);
        }
        int x = root[get(i)];
        adj[x].push_back(root[v[0]]);
        adj[root[v[0]]].push_back(x);
        adj[x].push_back(root[v.back()]);
        adj[v.back()].push_back(x);
        for(int i = 0; i < v.size(); i++) {
            uni(x, v[i]);
        }
    }
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++) {
            if(!P[i][j] && same(i, j)) pos = false;
        }
    }
    if(!pos) return 0;
    vector<vector<int>> ans(n, vector<int>(n));
    for(int i = 0; i < n; i++) {
        for(auto it : adj[i]) {
            ans[i][it] = ans[it][i] = 1;
        }
    }
    build(ans);
    return 1;
}

Compilation message

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

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 1328 KB Output is correct
7 Correct 102 ms 22080 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 1328 KB Output is correct
7 Correct 102 ms 22080 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 4 ms 1132 KB Output is correct
13 Correct 98 ms 22096 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 600 KB Output is correct
17 Correct 65 ms 8380 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 26 ms 5724 KB Output is correct
21 Correct 102 ms 22096 KB Output is correct
22 Correct 102 ms 22096 KB Output is correct
23 Correct 106 ms 22096 KB Output is correct
24 Correct 98 ms 22096 KB Output is correct
25 Correct 57 ms 8276 KB Output is correct
26 Correct 47 ms 8236 KB Output is correct
27 Correct 122 ms 22068 KB Output is correct
28 Correct 96 ms 22068 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 4 ms 1116 KB Output is correct
9 Correct 95 ms 22044 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 4 ms 1288 KB Output is correct
13 Correct 100 ms 22164 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 58 ms 8244 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 25 ms 5872 KB Output is correct
22 Correct 100 ms 22200 KB Output is correct
23 Correct 99 ms 22352 KB Output is correct
24 Correct 103 ms 22064 KB Output is correct
25 Correct 43 ms 8276 KB Output is correct
26 Correct 47 ms 8280 KB Output is correct
27 Correct 100 ms 22064 KB Output is correct
28 Correct 104 ms 22096 KB Output is correct
29 Correct 43 ms 8228 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 25 ms 5848 KB Output is correct
5 Correct 104 ms 22100 KB Output is correct
6 Correct 98 ms 22096 KB Output is correct
7 Correct 104 ms 22100 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 30 ms 5800 KB Output is correct
10 Correct 114 ms 22096 KB Output is correct
11 Correct 109 ms 22100 KB Output is correct
12 Correct 109 ms 22048 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 24 ms 5864 KB Output is correct
17 Correct 101 ms 22068 KB Output is correct
18 Correct 102 ms 22096 KB Output is correct
19 Correct 100 ms 22072 KB Output is correct
20 Correct 96 ms 22164 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 1328 KB Output is correct
7 Correct 102 ms 22080 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 4 ms 1132 KB Output is correct
13 Correct 98 ms 22096 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 600 KB Output is correct
17 Correct 65 ms 8380 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 26 ms 5724 KB Output is correct
21 Correct 102 ms 22096 KB Output is correct
22 Correct 102 ms 22096 KB Output is correct
23 Correct 106 ms 22096 KB Output is correct
24 Correct 98 ms 22096 KB Output is correct
25 Correct 57 ms 8276 KB Output is correct
26 Correct 47 ms 8236 KB Output is correct
27 Correct 122 ms 22068 KB Output is correct
28 Correct 96 ms 22068 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 4 ms 1116 KB Output is correct
37 Correct 95 ms 22044 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 4 ms 1288 KB Output is correct
41 Correct 100 ms 22164 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 604 KB Output is correct
45 Correct 58 ms 8244 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 25 ms 5872 KB Output is correct
50 Correct 100 ms 22200 KB Output is correct
51 Correct 99 ms 22352 KB Output is correct
52 Correct 103 ms 22064 KB Output is correct
53 Correct 43 ms 8276 KB Output is correct
54 Correct 47 ms 8280 KB Output is correct
55 Correct 100 ms 22064 KB Output is correct
56 Correct 104 ms 22096 KB Output is correct
57 Correct 43 ms 8228 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 0 ms 344 KB Output is correct
60 Correct 3 ms 600 KB Output is correct
61 Correct 66 ms 8244 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 25 ms 5912 KB Output is correct
66 Correct 52 ms 8276 KB Output is correct
67 Correct 52 ms 8376 KB Output is correct
68 Correct 59 ms 8236 KB Output is correct
69 Correct 42 ms 8272 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 1328 KB Output is correct
7 Correct 102 ms 22080 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 4 ms 1132 KB Output is correct
13 Correct 98 ms 22096 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 600 KB Output is correct
17 Correct 65 ms 8380 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 26 ms 5724 KB Output is correct
21 Correct 102 ms 22096 KB Output is correct
22 Correct 102 ms 22096 KB Output is correct
23 Correct 106 ms 22096 KB Output is correct
24 Correct 98 ms 22096 KB Output is correct
25 Correct 57 ms 8276 KB Output is correct
26 Correct 47 ms 8236 KB Output is correct
27 Correct 122 ms 22068 KB Output is correct
28 Correct 96 ms 22068 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 4 ms 1116 KB Output is correct
37 Correct 95 ms 22044 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 4 ms 1288 KB Output is correct
41 Correct 100 ms 22164 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 604 KB Output is correct
45 Correct 58 ms 8244 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 25 ms 5872 KB Output is correct
50 Correct 100 ms 22200 KB Output is correct
51 Correct 99 ms 22352 KB Output is correct
52 Correct 103 ms 22064 KB Output is correct
53 Correct 43 ms 8276 KB Output is correct
54 Correct 47 ms 8280 KB Output is correct
55 Correct 100 ms 22064 KB Output is correct
56 Correct 104 ms 22096 KB Output is correct
57 Correct 43 ms 8228 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 0 ms 344 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 25 ms 5848 KB Output is correct
62 Correct 104 ms 22100 KB Output is correct
63 Correct 98 ms 22096 KB Output is correct
64 Correct 104 ms 22100 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 30 ms 5800 KB Output is correct
67 Correct 114 ms 22096 KB Output is correct
68 Correct 109 ms 22100 KB Output is correct
69 Correct 109 ms 22048 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 24 ms 5864 KB Output is correct
74 Correct 101 ms 22068 KB Output is correct
75 Correct 102 ms 22096 KB Output is correct
76 Correct 100 ms 22072 KB Output is correct
77 Correct 96 ms 22164 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 0 ms 344 KB Output is correct
80 Correct 3 ms 600 KB Output is correct
81 Correct 66 ms 8244 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 25 ms 5912 KB Output is correct
86 Correct 52 ms 8276 KB Output is correct
87 Correct 52 ms 8376 KB Output is correct
88 Correct 59 ms 8236 KB Output is correct
89 Correct 42 ms 8272 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 0 ms 348 KB Output is correct
92 Correct 2 ms 604 KB Output is correct
93 Correct 46 ms 8240 KB Output is correct
94 Correct 0 ms 348 KB Output is correct
95 Correct 0 ms 348 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Correct 11 ms 2396 KB Output is correct
98 Correct 43 ms 8244 KB Output is correct
99 Correct 42 ms 8244 KB Output is correct
100 Correct 41 ms 8244 KB Output is correct
101 Correct 39 ms 8256 KB Output is correct
102 Correct 39 ms 8528 KB Output is correct
103 Correct 39 ms 8228 KB Output is correct
104 Correct 39 ms 8276 KB Output is correct
105 Correct 45 ms 8240 KB Output is correct