oj.uz

답안 #1046510

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

const int mxN = 1e3+10;

int p[mxN], root[mxN];

vector<int> adj[mxN];

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

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

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

Compilation message

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

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 1372 KB Output is correct
7 Correct 98 ms 22068 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 1372 KB Output is correct
7 Correct 98 ms 22068 KB Output is correct
8 Correct 0 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 1116 KB Output is correct
13 Correct 95 ms 22160 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 792 KB Output is correct
17 Correct 58 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 27 ms 5812 KB Output is correct
21 Correct 108 ms 22064 KB Output is correct
22 Correct 99 ms 22072 KB Output is correct
23 Correct 107 ms 22096 KB Output is correct
24 Correct 95 ms 22180 KB Output is correct
25 Correct 45 ms 8276 KB Output is correct
26 Correct 43 ms 8272 KB Output is correct
27 Correct 105 ms 22096 KB Output is correct
28 Correct 95 ms 22068 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 100 ms 21976 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 4 ms 1116 KB Output is correct
13 Correct 102 ms 22064 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 3 ms 600 KB Output is correct
17 Correct 65 ms 8488 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 25 ms 5724 KB Output is correct
22 Correct 100 ms 22068 KB Output is correct
23 Correct 96 ms 22060 KB Output is correct
24 Correct 106 ms 22096 KB Output is correct
25 Correct 40 ms 8272 KB Output is correct
26 Correct 43 ms 8272 KB Output is correct
27 Correct 104 ms 22064 KB Output is correct
28 Correct 105 ms 22044 KB Output is correct
29 Correct 40 ms 8284 KB Output is correct

Subtask #4
35.0 / 35.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 26 ms 5796 KB Output is correct
5 Correct 108 ms 22320 KB Output is correct
6 Correct 99 ms 22096 KB Output is correct
7 Correct 106 ms 22064 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 25 ms 5824 KB Output is correct
10 Correct 103 ms 22104 KB Output is correct
11 Correct 99 ms 22096 KB Output is correct
12 Correct 107 ms 22096 KB Output is correct
13 Correct 1 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 25 ms 5724 KB Output is correct
17 Correct 102 ms 22100 KB Output is correct
18 Correct 106 ms 22156 KB Output is correct
19 Correct 105 ms 22096 KB Output is correct
20 Correct 96 ms 22096 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 1372 KB Output is correct
7 Correct 98 ms 22068 KB Output is correct
8 Correct 0 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 1116 KB Output is correct
13 Correct 95 ms 22160 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 792 KB Output is correct
17 Correct 58 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 27 ms 5812 KB Output is correct
21 Correct 108 ms 22064 KB Output is correct
22 Correct 99 ms 22072 KB Output is correct
23 Correct 107 ms 22096 KB Output is correct
24 Correct 95 ms 22180 KB Output is correct
25 Correct 45 ms 8276 KB Output is correct
26 Correct 43 ms 8272 KB Output is correct
27 Correct 105 ms 22096 KB Output is correct
28 Correct 95 ms 22068 KB Output is correct
29 Correct 0 ms 344 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 100 ms 21976 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 4 ms 1116 KB Output is correct
41 Correct 102 ms 22064 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 3 ms 600 KB Output is correct
45 Correct 65 ms 8488 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 1 ms 344 KB Output is correct
49 Correct 25 ms 5724 KB Output is correct
50 Correct 100 ms 22068 KB Output is correct
51 Correct 96 ms 22060 KB Output is correct
52 Correct 106 ms 22096 KB Output is correct
53 Correct 40 ms 8272 KB Output is correct
54 Correct 43 ms 8272 KB Output is correct
55 Correct 104 ms 22064 KB Output is correct
56 Correct 105 ms 22044 KB Output is correct
57 Correct 40 ms 8284 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 2 ms 604 KB Output is correct
61 Correct 62 ms 8380 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 26 ms 5788 KB Output is correct
66 Correct 48 ms 12112 KB Output is correct
67 Correct 45 ms 8240 KB Output is correct
68 Correct 51 ms 8276 KB Output is correct
69 Correct 41 ms 8272 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 1372 KB Output is correct
7 Correct 98 ms 22068 KB Output is correct
8 Correct 0 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 1116 KB Output is correct
13 Correct 95 ms 22160 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 792 KB Output is correct
17 Correct 58 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 27 ms 5812 KB Output is correct
21 Correct 108 ms 22064 KB Output is correct
22 Correct 99 ms 22072 KB Output is correct
23 Correct 107 ms 22096 KB Output is correct
24 Correct 95 ms 22180 KB Output is correct
25 Correct 45 ms 8276 KB Output is correct
26 Correct 43 ms 8272 KB Output is correct
27 Correct 105 ms 22096 KB Output is correct
28 Correct 95 ms 22068 KB Output is correct
29 Correct 0 ms 344 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 100 ms 21976 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 4 ms 1116 KB Output is correct
41 Correct 102 ms 22064 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 3 ms 600 KB Output is correct
45 Correct 65 ms 8488 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 1 ms 344 KB Output is correct
49 Correct 25 ms 5724 KB Output is correct
50 Correct 100 ms 22068 KB Output is correct
51 Correct 96 ms 22060 KB Output is correct
52 Correct 106 ms 22096 KB Output is correct
53 Correct 40 ms 8272 KB Output is correct
54 Correct 43 ms 8272 KB Output is correct
55 Correct 104 ms 22064 KB Output is correct
56 Correct 105 ms 22044 KB Output is correct
57 Correct 40 ms 8284 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 26 ms 5796 KB Output is correct
62 Correct 108 ms 22320 KB Output is correct
63 Correct 99 ms 22096 KB Output is correct
64 Correct 106 ms 22064 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 25 ms 5824 KB Output is correct
67 Correct 103 ms 22104 KB Output is correct
68 Correct 99 ms 22096 KB Output is correct
69 Correct 107 ms 22096 KB Output is correct
70 Correct 1 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 25 ms 5724 KB Output is correct
74 Correct 102 ms 22100 KB Output is correct
75 Correct 106 ms 22156 KB Output is correct
76 Correct 105 ms 22096 KB Output is correct
77 Correct 96 ms 22096 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 2 ms 604 KB Output is correct
81 Correct 62 ms 8380 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 26 ms 5788 KB Output is correct
86 Correct 48 ms 12112 KB Output is correct
87 Correct 45 ms 8240 KB Output is correct
88 Correct 51 ms 8276 KB Output is correct
89 Correct 41 ms 8272 KB Output is correct
90 Correct 1 ms 348 KB Output is correct
91 Correct 0 ms 348 KB Output is correct
92 Correct 2 ms 604 KB Output is correct
93 Correct 41 ms 8192 KB Output is correct
94 Correct 0 ms 348 KB Output is correct
95 Correct 1 ms 348 KB Output is correct
96 Correct 0 ms 344 KB Output is correct
97 Correct 14 ms 2224 KB Output is correct
98 Correct 40 ms 8272 KB Output is correct
99 Correct 39 ms 8284 KB Output is correct
100 Correct 38 ms 8276 KB Output is correct
101 Correct 67 ms 8228 KB Output is correct
102 Correct 38 ms 8244 KB Output is correct
103 Correct 40 ms 8248 KB Output is correct
104 Correct 52 ms 8272 KB Output is correct
105 Correct 57 ms 8240 KB Output is correct