oj.uz

Submission #628361

# Submission time Handle Problem Language Result Execution time Memory
628361 2022-08-13T10:53:15 Z boris_mihov Connecting Supertrees (IOI20_supertrees) C++17
40 / 100
 225 ms 30024 KB 
#include "supertrees.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#include <stack>

typedef long long llong;
const int MAXN = 1000 + 10;

int n;
int p[MAXN];
int d[MAXN];
std::vector < std::vector <int> > ans;
std::vector <int> byPaths[MAXN][3];

inline int find(int x)
{
    if (p[x] == x) return x;
    return p[x] = find(p[x]);
}

inline void connect(int x, int y)
{
    x = find(x);
    y = find(y);
    if (x == y) return;
    if (d[x] > d[y]) std::swap(x, y);
    if (d[x] == d[y]) ++d[y];
    p[x] = y;
}

inline bool areConnected(int x, int y)
{
    return find(x) == find(y);
}

int cycle[MAXN], cycleCnt;
int construct(std::vector < std::vector <int> > wantedPaths) 
{
    n = wantedPaths.size();
    ans.resize(n);

    for (int i = 1 ; i <= n ; ++i)
    {
        ans[i-1].resize(n, 0);
        for (int j = 1 ; j <= n ; ++j)
        {
            if (i == j) continue;
            if (wantedPaths[i - 1][j - 1] == 3) return 0;
            byPaths[i][wantedPaths[i - 1][j - 1]].push_back(j);
        }
    }

    std::iota(p + 1, p + 1 + n, 1);
    std::fill(d + 1, d + 1 + n, 1);
    for (int i = 1 ; i <= n ; ++i)
    {
        int last = i;
        int alreadyConnected = 0;
        if (byPaths[i][2].size() == 1) return 0;
        for (const int &j : byPaths[i][2])
        {
            if (areConnected(i, j)) 
            {
                if (alreadyConnected == 1) return 0;
                cycle[i] = cycle[j];
                alreadyConnected = 2;
                continue;
            }

            if (alreadyConnected == 2 || cycle[j] != 0) return 0;
            if (cycle[i] == 0) cycle[i] = ++cycleCnt;
            ans[last - 1][j - 1] = 1;
            ans[j - 1][last - 1] = 1;
            alreadyConnected = 1;
            cycle[j] = cycle[i];
            connect(i, j);
            last = j;
        }

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

        for (const int &j : byPaths[i][1])
        {
            if (areConnected(i, j)) continue;
            ans[i - 1][j - 1] = 1;
            ans[j - 1][i - 1] = 1;
            connect(i, j);
        }
    }

    for (int i = 1 ; i <= n ; ++i)
    {
        for (int j = 1 ; j <= n ; ++j)
        {
            if (i == j) continue;
            if (cycle[i] != cycle[j] && cycle[i] != 0 && cycle[j] != 0 && areConnected(i, j)) return 0;
            if (wantedPaths[i - 1][j - 1] == 0 && areConnected(i, j)) return 0;
            if (wantedPaths[i - 1][j - 1] == 1 && (!areConnected(i, j) || !(cycle[i] == 0 && cycle[j] == 0))) return 0;
            if (wantedPaths[i - 1][j - 1] == 2 && (!areConnected(i, j) || (cycle[i] == 0 && cycle[j] == 0))) return 0;
        }
    }

    build(ans);
	return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 8 ms 1364 KB Output is correct
7 Correct 189 ms 26044 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 8 ms 1364 KB Output is correct
7 Correct 189 ms 26044 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 7 ms 1432 KB Output is correct
13 Correct 174 ms 26060 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 5 ms 980 KB Output is correct
17 Correct 88 ms 16980 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 45 ms 6872 KB Output is correct
21 Correct 188 ms 26752 KB Output is correct
22 Correct 183 ms 26192 KB Output is correct
23 Correct 192 ms 26068 KB Output is correct
24 Correct 178 ms 26116 KB Output is correct
25 Correct 78 ms 16864 KB Output is correct
26 Correct 81 ms 16216 KB Output is correct
27 Correct 192 ms 28160 KB Output is correct
28 Correct 225 ms 26076 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 352 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 7 ms 1540 KB Output is correct
9 Correct 171 ms 28096 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 9 ms 1520 KB Output is correct
13 Correct 188 ms 28060 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 4 ms 1108 KB Output is correct
17 Correct 92 ms 19020 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 376 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 51 ms 7336 KB Output is correct
22 Correct 182 ms 28692 KB Output is correct
23 Correct 207 ms 28076 KB Output is correct
24 Correct 194 ms 30024 KB Output is correct
25 Correct 87 ms 18120 KB Output is correct
26 Correct 82 ms 18816 KB Output is correct
27 Correct 213 ms 28072 KB Output is correct
28 Correct 212 ms 28104 KB Output is correct
29 Correct 73 ms 18160 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 48 ms 6820 KB Output is correct
5 Correct 178 ms 26776 KB Output is correct
6 Correct 181 ms 26192 KB Output is correct
7 Correct 194 ms 26076 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 63 ms 6892 KB Output is correct
10 Correct 179 ms 26700 KB Output is correct
11 Correct 188 ms 26180 KB Output is correct
12 Correct 198 ms 28116 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Incorrect 1 ms 340 KB Answer gives possible 0 while actual possible 1
16 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 8 ms 1364 KB Output is correct
7 Correct 189 ms 26044 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 7 ms 1432 KB Output is correct
13 Correct 174 ms 26060 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 5 ms 980 KB Output is correct
17 Correct 88 ms 16980 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 45 ms 6872 KB Output is correct
21 Correct 188 ms 26752 KB Output is correct
22 Correct 183 ms 26192 KB Output is correct
23 Correct 192 ms 26068 KB Output is correct
24 Correct 178 ms 26116 KB Output is correct
25 Correct 78 ms 16864 KB Output is correct
26 Correct 81 ms 16216 KB Output is correct
27 Correct 192 ms 28160 KB Output is correct
28 Correct 225 ms 26076 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 352 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 7 ms 1540 KB Output is correct
37 Correct 171 ms 28096 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 9 ms 1520 KB Output is correct
41 Correct 188 ms 28060 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 4 ms 1108 KB Output is correct
45 Correct 92 ms 19020 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 1 ms 376 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 51 ms 7336 KB Output is correct
50 Correct 182 ms 28692 KB Output is correct
51 Correct 207 ms 28076 KB Output is correct
52 Correct 194 ms 30024 KB Output is correct
53 Correct 87 ms 18120 KB Output is correct
54 Correct 82 ms 18816 KB Output is correct
55 Correct 213 ms 28072 KB Output is correct
56 Correct 212 ms 28104 KB Output is correct
57 Correct 73 ms 18160 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 4 ms 1108 KB Output is correct
61 Correct 82 ms 20172 KB Output is correct
62 Correct 0 ms 340 KB Output is correct
63 Correct 1 ms 384 KB Output is correct
64 Correct 1 ms 340 KB Output is correct
65 Incorrect 20 ms 4812 KB Answer gives possible 0 while actual possible 1
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 8 ms 1364 KB Output is correct
7 Correct 189 ms 26044 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 7 ms 1432 KB Output is correct
13 Correct 174 ms 26060 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 5 ms 980 KB Output is correct
17 Correct 88 ms 16980 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 45 ms 6872 KB Output is correct
21 Correct 188 ms 26752 KB Output is correct
22 Correct 183 ms 26192 KB Output is correct
23 Correct 192 ms 26068 KB Output is correct
24 Correct 178 ms 26116 KB Output is correct
25 Correct 78 ms 16864 KB Output is correct
26 Correct 81 ms 16216 KB Output is correct
27 Correct 192 ms 28160 KB Output is correct
28 Correct 225 ms 26076 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 352 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 7 ms 1540 KB Output is correct
37 Correct 171 ms 28096 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 9 ms 1520 KB Output is correct
41 Correct 188 ms 28060 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 4 ms 1108 KB Output is correct
45 Correct 92 ms 19020 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 1 ms 376 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 51 ms 7336 KB Output is correct
50 Correct 182 ms 28692 KB Output is correct
51 Correct 207 ms 28076 KB Output is correct
52 Correct 194 ms 30024 KB Output is correct
53 Correct 87 ms 18120 KB Output is correct
54 Correct 82 ms 18816 KB Output is correct
55 Correct 213 ms 28072 KB Output is correct
56 Correct 212 ms 28104 KB Output is correct
57 Correct 73 ms 18160 KB Output is correct
58 Correct 0 ms 340 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 0 ms 340 KB Output is correct
61 Correct 48 ms 6820 KB Output is correct
62 Correct 178 ms 26776 KB Output is correct
63 Correct 181 ms 26192 KB Output is correct
64 Correct 194 ms 26076 KB Output is correct
65 Correct 0 ms 340 KB Output is correct
66 Correct 63 ms 6892 KB Output is correct
67 Correct 179 ms 26700 KB Output is correct
68 Correct 188 ms 26180 KB Output is correct
69 Correct 198 ms 28116 KB Output is correct
70 Correct 0 ms 340 KB Output is correct
71 Correct 0 ms 340 KB Output is correct
72 Incorrect 1 ms 340 KB Answer gives possible 0 while actual possible 1
73 Halted 0 ms 0 KB -