oj.uz

답안 #655082

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
655082 2022-11-03T00:47:37 Z benjaminkleyn 슈퍼트리 잇기 (IOI20_supertrees) C++17
100 / 100
 191 ms 22208 KB 
#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
typedef long long ll;

int par[1000];

int find(int u)
{
    if (par[u] == u)
        return u;
    return par[u] = find(par[u]);
}

void unite(int u, int v)
{
    u = find(u), v = find(v);
    par[v] = u;
}

vector<int> comp[1000];

int construct(vector<vector<int>> p) {
	int n = p.size();

    iota(par, par + n, 0);

    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
        {
            if (p[i][j] > 0)
                unite(i, j);
            if (p[i][j] == 3)
                return 0;
        }

    for (int i = 0; i < n; i++)
        comp[find(i)].push_back(i);

	vector<vector<int>> answer(n, vector<int>(n));
    for (int k = 0; k < n; k++)
        if (find(k) == k && comp[k].size() >= 2)
        {
            vector<set<int>> trees;
            vector<int> cycle;
            vector<bool> done(n);
            for (int i : comp[k])
            {
                if (done[i]) continue;
                done[i] = true;

                set<int> tree;
                tree.insert(i);
                for (int j : comp[k]) 
                    if (p[i][j] == 1 && !done[j])
                    {
                        done[j] = true;
                        answer[i][j] = 1;
                        answer[j][i] = 1;
                        tree.insert(j);
                    }
                trees.push_back(tree);
                cycle.push_back(i);
            }

            for (set<int> tree : trees)
                for (int i : tree)
                {
                    for (int j : comp[k]) 
                        if (tree.find(j) == tree.end() && p[i][j] != 2)
                            return 0;

                    for (int j : tree)
                        if (p[i][j] != 1)
                            return 0;
                }

            for (int i : cycle)
                for (int j : cycle)
                    if (i != j && p[i][j] != 2)
                        return 0;

            if (cycle.size() == 2) 
                return 0;
            if (cycle.size() == 1)
                continue;

            cycle.push_back(comp[k][0]);

            for (int i = 0; i < cycle.size() - 1; i++)
            {
                answer[cycle[i]][cycle[i+1]] = 1;
                answer[cycle[i+1]][cycle[i]] = 1;
            }
        }

    build(answer);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:37:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   37 |     for (int i = 0; i < n; i++)
      |     ^~~
supertrees.cpp:40:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   40 |  vector<vector<int>> answer(n, vector<int>(n));
      |  ^~~~~~
supertrees.cpp:90:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |             for (int i = 0; i < cycle.size() - 1; i++)
      |                             ~~^~~~~~~~~~~~~~~~~~

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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1108 KB Output is correct
7 Correct 191 ms 22044 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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1108 KB Output is correct
7 Correct 191 ms 22044 KB Output is correct
8 Correct 1 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 162 ms 22048 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 724 KB Output is correct
17 Correct 90 ms 12192 KB Output is correct
18 Correct 1 ms 216 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 42 ms 5804 KB Output is correct
21 Correct 167 ms 21968 KB Output is correct
22 Correct 167 ms 22188 KB Output is correct
23 Correct 186 ms 22044 KB Output is correct
24 Correct 170 ms 22172 KB Output is correct
25 Correct 69 ms 12064 KB Output is correct
26 Correct 65 ms 12076 KB Output is correct
27 Correct 191 ms 22048 KB Output is correct
28 Correct 161 ms 22092 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 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 7 ms 1108 KB Output is correct
9 Correct 163 ms 22016 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 1184 KB Output is correct
13 Correct 172 ms 22052 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 724 KB Output is correct
17 Correct 82 ms 12200 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 42 ms 5800 KB Output is correct
22 Correct 178 ms 22172 KB Output is correct
23 Correct 161 ms 22092 KB Output is correct
24 Correct 171 ms 22056 KB Output is correct
25 Correct 64 ms 12192 KB Output is correct
26 Correct 67 ms 12196 KB Output is correct
27 Correct 160 ms 22060 KB Output is correct
28 Correct 171 ms 22080 KB Output is correct
29 Correct 64 ms 12192 KB Output is correct

Subtask #4
35.0 / 35.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 41 ms 5756 KB Output is correct
5 Correct 165 ms 21980 KB Output is correct
6 Correct 163 ms 22044 KB Output is correct
7 Correct 183 ms 22044 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 41 ms 5796 KB Output is correct
10 Correct 161 ms 22056 KB Output is correct
11 Correct 160 ms 21964 KB Output is correct
12 Correct 171 ms 22080 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 40 ms 5792 KB Output is correct
17 Correct 161 ms 21964 KB Output is correct
18 Correct 167 ms 22060 KB Output is correct
19 Correct 158 ms 22048 KB Output is correct
20 Correct 161 ms 22208 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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1108 KB Output is correct
7 Correct 191 ms 22044 KB Output is correct
8 Correct 1 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 162 ms 22048 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 724 KB Output is correct
17 Correct 90 ms 12192 KB Output is correct
18 Correct 1 ms 216 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 42 ms 5804 KB Output is correct
21 Correct 167 ms 21968 KB Output is correct
22 Correct 167 ms 22188 KB Output is correct
23 Correct 186 ms 22044 KB Output is correct
24 Correct 170 ms 22172 KB Output is correct
25 Correct 69 ms 12064 KB Output is correct
26 Correct 65 ms 12076 KB Output is correct
27 Correct 191 ms 22048 KB Output is correct
28 Correct 161 ms 22092 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 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 7 ms 1108 KB Output is correct
37 Correct 163 ms 22016 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 7 ms 1184 KB Output is correct
41 Correct 172 ms 22052 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 4 ms 724 KB Output is correct
45 Correct 82 ms 12200 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 42 ms 5800 KB Output is correct
50 Correct 178 ms 22172 KB Output is correct
51 Correct 161 ms 22092 KB Output is correct
52 Correct 171 ms 22056 KB Output is correct
53 Correct 64 ms 12192 KB Output is correct
54 Correct 67 ms 12196 KB Output is correct
55 Correct 160 ms 22060 KB Output is correct
56 Correct 171 ms 22080 KB Output is correct
57 Correct 64 ms 12192 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 4 ms 724 KB Output is correct
61 Correct 79 ms 12320 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 0 ms 212 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 41 ms 5836 KB Output is correct
66 Correct 76 ms 14108 KB Output is correct
67 Correct 70 ms 14096 KB Output is correct
68 Correct 67 ms 14096 KB Output is correct
69 Correct 65 ms 14096 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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1108 KB Output is correct
7 Correct 191 ms 22044 KB Output is correct
8 Correct 1 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 162 ms 22048 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 724 KB Output is correct
17 Correct 90 ms 12192 KB Output is correct
18 Correct 1 ms 216 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 42 ms 5804 KB Output is correct
21 Correct 167 ms 21968 KB Output is correct
22 Correct 167 ms 22188 KB Output is correct
23 Correct 186 ms 22044 KB Output is correct
24 Correct 170 ms 22172 KB Output is correct
25 Correct 69 ms 12064 KB Output is correct
26 Correct 65 ms 12076 KB Output is correct
27 Correct 191 ms 22048 KB Output is correct
28 Correct 161 ms 22092 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 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 7 ms 1108 KB Output is correct
37 Correct 163 ms 22016 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 7 ms 1184 KB Output is correct
41 Correct 172 ms 22052 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 4 ms 724 KB Output is correct
45 Correct 82 ms 12200 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 42 ms 5800 KB Output is correct
50 Correct 178 ms 22172 KB Output is correct
51 Correct 161 ms 22092 KB Output is correct
52 Correct 171 ms 22056 KB Output is correct
53 Correct 64 ms 12192 KB Output is correct
54 Correct 67 ms 12196 KB Output is correct
55 Correct 160 ms 22060 KB Output is correct
56 Correct 171 ms 22080 KB Output is correct
57 Correct 64 ms 12192 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 41 ms 5756 KB Output is correct
62 Correct 165 ms 21980 KB Output is correct
63 Correct 163 ms 22044 KB Output is correct
64 Correct 183 ms 22044 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 41 ms 5796 KB Output is correct
67 Correct 161 ms 22056 KB Output is correct
68 Correct 160 ms 21964 KB Output is correct
69 Correct 171 ms 22080 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Correct 40 ms 5792 KB Output is correct
74 Correct 161 ms 21964 KB Output is correct
75 Correct 167 ms 22060 KB Output is correct
76 Correct 158 ms 22048 KB Output is correct
77 Correct 161 ms 22208 KB Output is correct
78 Correct 0 ms 212 KB Output is correct
79 Correct 0 ms 212 KB Output is correct
80 Correct 4 ms 724 KB Output is correct
81 Correct 79 ms 12320 KB Output is correct
82 Correct 1 ms 212 KB Output is correct
83 Correct 0 ms 212 KB Output is correct
84 Correct 0 ms 212 KB Output is correct
85 Correct 41 ms 5836 KB Output is correct
86 Correct 76 ms 14108 KB Output is correct
87 Correct 70 ms 14096 KB Output is correct
88 Correct 67 ms 14096 KB Output is correct
89 Correct 65 ms 14096 KB Output is correct
90 Correct 0 ms 212 KB Output is correct
91 Correct 1 ms 320 KB Output is correct
92 Correct 4 ms 724 KB Output is correct
93 Correct 80 ms 10128 KB Output is correct
94 Correct 1 ms 212 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 0 ms 212 KB Output is correct
97 Correct 17 ms 2716 KB Output is correct
98 Correct 66 ms 10132 KB Output is correct
99 Correct 65 ms 10144 KB Output is correct
100 Correct 64 ms 10148 KB Output is correct
101 Correct 66 ms 10128 KB Output is correct
102 Correct 64 ms 10140 KB Output is correct
103 Correct 65 ms 10140 KB Output is correct
104 Correct 64 ms 10060 KB Output is correct
105 Correct 74 ms 10052 KB Output is correct