oj.uz

답안 #1061870

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1061870 2024-08-16T14:35:58 Z ArthuroWich 슈퍼트리 잇기 (IOI20_supertrees) C++17
100 / 100
 140 ms 28028 KB 
#include "supertrees.h"
#include<bits/stdc++.h>
using namespace std;
vector<vector<int>> adj;
int n, vis[1005], used[1005], co = 0;
void dfs(int i) {
    if (vis[i] > 0) {
        return;
    }
    vis[i] = co;
    for (int j = 0; j < n; j++) {
        if (i == j || adj[i][j] == 0) {
            continue;
        }
        dfs(j);
    }
}
int construct(vector<vector<int>> p) {
    n = p.size();
    adj = p;
    vector<vector<int>> ans(n, vector<int>(n, 0));
    for (int i = 0; i < n; i++) {
        if (vis[i] > 0) {
            continue;
        }
        co++;
        dfs(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] == 0) {
                if (vis[i] == vis[j]) {
                    return 0;
                }
            } else {
                if (vis[i] != vis[j]) {
                    return 0;
                }
            }
        }
    }
    for (int i = 1; i <= co; i++) {
        vector<int> root;
        for (int j = 0; j < n; j++) {
            if (vis[j] == i && !used[j]) {
                root.push_back(j);
                used[j] = 1;
                for (int k = 0; k < n; k++) {
                    if (k == j) {
                        continue;
                    }
                    if (p[j][k] == 1) {
                        used[k] = 1;
                        ans[j][k] = 1;
                        ans[k][j] = 1;
                    }
                }
            }
        }
        if (root.size() == 1) {
            continue;
        }
        if (root.size() < 3) {
            return 0;
        }
        for (int j = 1; j < root.size(); j++) {
            ans[root[j]][root[j-1]] = 1;
            ans[root[j-1]][root[j]] = 1;
        }
        ans[root.front()][root.back()] = 1;
        ans[root.back()][root.front()] = 1;
    }
    build(ans);
    return 1;
}

Compilation message

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

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1368 KB Output is correct
7 Correct 112 ms 25936 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 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1368 KB Output is correct
7 Correct 112 ms 25936 KB Output is correct
8 Correct 0 ms 600 KB Output is correct
9 Correct 1 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 5 ms 1364 KB Output is correct
13 Correct 114 ms 25936 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 63 ms 16140 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 31 ms 6740 KB Output is correct
21 Correct 124 ms 25940 KB Output is correct
22 Correct 118 ms 25936 KB Output is correct
23 Correct 121 ms 25940 KB Output is correct
24 Correct 117 ms 25936 KB Output is correct
25 Correct 51 ms 16208 KB Output is correct
26 Correct 52 ms 16152 KB Output is correct
27 Correct 124 ms 25936 KB Output is correct
28 Correct 117 ms 25936 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 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 5 ms 1424 KB Output is correct
9 Correct 114 ms 26136 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 121 ms 26140 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 3 ms 856 KB Output is correct
17 Correct 84 ms 16136 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 29 ms 6748 KB Output is correct
22 Correct 121 ms 28024 KB Output is correct
23 Correct 124 ms 27916 KB Output is correct
24 Correct 129 ms 28028 KB Output is correct
25 Correct 60 ms 18000 KB Output is correct
26 Correct 52 ms 18000 KB Output is correct
27 Correct 118 ms 27916 KB Output is correct
28 Correct 140 ms 27984 KB Output is correct
29 Correct 51 ms 18000 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 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 32 ms 6796 KB Output is correct
5 Correct 136 ms 25940 KB Output is correct
6 Correct 121 ms 25936 KB Output is correct
7 Correct 123 ms 25936 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 30 ms 6732 KB Output is correct
10 Correct 117 ms 25936 KB Output is correct
11 Correct 121 ms 25940 KB Output is correct
12 Correct 125 ms 25944 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 30 ms 6748 KB Output is correct
17 Correct 120 ms 25936 KB Output is correct
18 Correct 116 ms 25936 KB Output is correct
19 Correct 117 ms 25956 KB Output is correct
20 Correct 118 ms 25940 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 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1368 KB Output is correct
7 Correct 112 ms 25936 KB Output is correct
8 Correct 0 ms 600 KB Output is correct
9 Correct 1 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 5 ms 1364 KB Output is correct
13 Correct 114 ms 25936 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 63 ms 16140 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 31 ms 6740 KB Output is correct
21 Correct 124 ms 25940 KB Output is correct
22 Correct 118 ms 25936 KB Output is correct
23 Correct 121 ms 25940 KB Output is correct
24 Correct 117 ms 25936 KB Output is correct
25 Correct 51 ms 16208 KB Output is correct
26 Correct 52 ms 16152 KB Output is correct
27 Correct 124 ms 25936 KB Output is correct
28 Correct 117 ms 25936 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 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 5 ms 1424 KB Output is correct
37 Correct 114 ms 26136 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 5 ms 1372 KB Output is correct
41 Correct 121 ms 26140 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 3 ms 856 KB Output is correct
45 Correct 84 ms 16136 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 29 ms 6748 KB Output is correct
50 Correct 121 ms 28024 KB Output is correct
51 Correct 124 ms 27916 KB Output is correct
52 Correct 129 ms 28028 KB Output is correct
53 Correct 60 ms 18000 KB Output is correct
54 Correct 52 ms 18000 KB Output is correct
55 Correct 118 ms 27916 KB Output is correct
56 Correct 140 ms 27984 KB Output is correct
57 Correct 51 ms 18000 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 0 ms 344 KB Output is correct
60 Correct 4 ms 1116 KB Output is correct
61 Correct 58 ms 18184 KB Output is correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 1 ms 344 KB Output is correct
64 Correct 0 ms 440 KB Output is correct
65 Correct 31 ms 7324 KB Output is correct
66 Correct 51 ms 18176 KB Output is correct
67 Correct 51 ms 18000 KB Output is correct
68 Correct 50 ms 18004 KB Output is correct
69 Correct 59 ms 18004 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 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1368 KB Output is correct
7 Correct 112 ms 25936 KB Output is correct
8 Correct 0 ms 600 KB Output is correct
9 Correct 1 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 5 ms 1364 KB Output is correct
13 Correct 114 ms 25936 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 63 ms 16140 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 31 ms 6740 KB Output is correct
21 Correct 124 ms 25940 KB Output is correct
22 Correct 118 ms 25936 KB Output is correct
23 Correct 121 ms 25940 KB Output is correct
24 Correct 117 ms 25936 KB Output is correct
25 Correct 51 ms 16208 KB Output is correct
26 Correct 52 ms 16152 KB Output is correct
27 Correct 124 ms 25936 KB Output is correct
28 Correct 117 ms 25936 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 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 5 ms 1424 KB Output is correct
37 Correct 114 ms 26136 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 5 ms 1372 KB Output is correct
41 Correct 121 ms 26140 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 3 ms 856 KB Output is correct
45 Correct 84 ms 16136 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 29 ms 6748 KB Output is correct
50 Correct 121 ms 28024 KB Output is correct
51 Correct 124 ms 27916 KB Output is correct
52 Correct 129 ms 28028 KB Output is correct
53 Correct 60 ms 18000 KB Output is correct
54 Correct 52 ms 18000 KB Output is correct
55 Correct 118 ms 27916 KB Output is correct
56 Correct 140 ms 27984 KB Output is correct
57 Correct 51 ms 18000 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 32 ms 6796 KB Output is correct
62 Correct 136 ms 25940 KB Output is correct
63 Correct 121 ms 25936 KB Output is correct
64 Correct 123 ms 25936 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 30 ms 6732 KB Output is correct
67 Correct 117 ms 25936 KB Output is correct
68 Correct 121 ms 25940 KB Output is correct
69 Correct 125 ms 25944 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 1 ms 348 KB Output is correct
73 Correct 30 ms 6748 KB Output is correct
74 Correct 120 ms 25936 KB Output is correct
75 Correct 116 ms 25936 KB Output is correct
76 Correct 117 ms 25956 KB Output is correct
77 Correct 118 ms 25940 KB Output is correct
78 Correct 1 ms 348 KB Output is correct
79 Correct 0 ms 344 KB Output is correct
80 Correct 4 ms 1116 KB Output is correct
81 Correct 58 ms 18184 KB Output is correct
82 Correct 0 ms 344 KB Output is correct
83 Correct 1 ms 344 KB Output is correct
84 Correct 0 ms 440 KB Output is correct
85 Correct 31 ms 7324 KB Output is correct
86 Correct 51 ms 18176 KB Output is correct
87 Correct 51 ms 18000 KB Output is correct
88 Correct 50 ms 18004 KB Output is correct
89 Correct 59 ms 18004 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 0 ms 348 KB Output is correct
92 Correct 3 ms 1112 KB Output is correct
93 Correct 55 ms 18188 KB Output is correct
94 Correct 0 ms 344 KB Output is correct
95 Correct 0 ms 348 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Correct 17 ms 4876 KB Output is correct
98 Correct 61 ms 18176 KB Output is correct
99 Correct 50 ms 18004 KB Output is correct
100 Correct 85 ms 18000 KB Output is correct
101 Correct 52 ms 18000 KB Output is correct
102 Correct 54 ms 18000 KB Output is correct
103 Correct 54 ms 18000 KB Output is correct
104 Correct 49 ms 18004 KB Output is correct
105 Correct 60 ms 18000 KB Output is correct