oj.uz

Submission #482883

# Submission time Handle Problem Language Result Execution time Memory
482883 2021-10-26T16:33:59 Z jalsol Connecting Supertrees (IOI20_supertrees) C++17
40 / 100
 195 ms 30276 KB 
#ifdef LOCAL
#include "local.h"
#else
#include <bits/stdc++.h>
#define debug(...)
#define DB(...)
#endif

using namespace std;

const bool __initialization = []() {
    cin.tie(nullptr)->sync_with_stdio(false);
    cout << setprecision(12) << fixed;
    return true;
}();

using ll = long long;
using ld = long double;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

#define For(i, l, r) for (int i = (l); i <= (r); ++i)
#define Ford(i, r, l) for (int i = (r); i >= (l); --i)
#define Rep(i, n) For (i, 0, (n) - 1)
#define Repd(i, n) Ford (i, (n) - 1, 0)
#define Fe(...) for (auto __VA_ARGS__)

template <class C> inline int isz(const C& c) { return static_cast<int>(c.size()); }
template <class T> inline bool chmin(T& a, const T& b) { return (a > b) ? a = b, true : false; }
template <class T> inline bool chmax(T& a, const T& b) { return (a < b) ? a = b, true : false; }

constexpr ld eps = 1e-9;
constexpr int inf = 1e9;
constexpr ll linf = 1e18;

// =============================================================================

#include "supertrees.h"

constexpr int maxn = 3e5 + 5;

int construct(vector<vector<int>> req) {
    int n = req.size();
    vector<vector<int>> ans(n, vector<int>(n));
    vector<vector<int>> g(n);

    bool cycle = false;

    Rep (i, n) {
        Rep (j, n) {
            if (!req[i][j]) continue;

            cycle |= (req[i][j] == 2);
            g[i].push_back(j);
            g[j].push_back(i);
        }
    }

    vector<int> comp;
    vector<bool> vis(n);

    auto Dfs = [&](auto self, int u) -> void {
        vis[u] = true;
        comp.push_back(u);

        Fe (v : g[u]) {
            if (!vis[v]) {
                self(self, v);
            }
        }
    };

    Rep (i, n) {
        if (vis[i]) continue;

        Dfs(Dfs, i);

        int sz = isz(comp);
        if (cycle && sz == 2) return 0;

        Rep (j, sz - 1) {
            ans[comp[j]][comp[j + 1]] = ans[comp[j + 1]][comp[j]] = 1;
        }
        if (cycle && sz > 2) {
            ans[comp[0]][comp[sz - 1]] = ans[comp[sz - 1]][comp[0]] = 1;
        }

        Rep (j, sz) {
            Rep (k, sz) {
                if (!req[comp[j]][comp[k]]) {
                    return 0;
                }
            }
        }

        comp.clear();
    }

    build(ans);
    return 1;
}

// does oj.uz allow IOI-style scoring?
// no

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 8 ms 1624 KB Output is correct
7 Correct 191 ms 30276 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 8 ms 1624 KB Output is correct
7 Correct 191 ms 30276 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 7 ms 1176 KB Output is correct
13 Correct 170 ms 22240 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 972 KB Output is correct
17 Correct 98 ms 18048 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 42 ms 5996 KB Output is correct
21 Correct 179 ms 23160 KB Output is correct
22 Correct 161 ms 22152 KB Output is correct
23 Correct 193 ms 26244 KB Output is correct
24 Correct 160 ms 22144 KB Output is correct
25 Correct 83 ms 13356 KB Output is correct
26 Correct 72 ms 12288 KB Output is correct
27 Correct 186 ms 28316 KB Output is correct
28 Correct 163 ms 22124 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 9 ms 1100 KB Output is correct
9 Correct 163 ms 22092 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 9 ms 1612 KB Output is correct
13 Correct 192 ms 30228 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 972 KB Output is correct
17 Correct 99 ms 17808 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 41 ms 5784 KB Output is correct
22 Correct 167 ms 23092 KB Output is correct
23 Correct 164 ms 22160 KB Output is correct
24 Correct 192 ms 28232 KB Output is correct
25 Correct 67 ms 12192 KB Output is correct
26 Correct 74 ms 13212 KB Output is correct
27 Correct 166 ms 22180 KB Output is correct
28 Correct 195 ms 26180 KB Output is correct
29 Correct 67 ms 12156 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 44 ms 5832 KB Output is correct
5 Correct 170 ms 23072 KB Output is correct
6 Correct 183 ms 22044 KB Output is correct
7 Correct 186 ms 26144 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 53 ms 5816 KB Output is correct
10 Correct 166 ms 23164 KB Output is correct
11 Correct 160 ms 22084 KB Output is correct
12 Correct 193 ms 28308 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Incorrect 0 ms 204 KB Too many ways to get from 4 to 8, should be 1 found no less than 2
15 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 8 ms 1624 KB Output is correct
7 Correct 191 ms 30276 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 7 ms 1176 KB Output is correct
13 Correct 170 ms 22240 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 972 KB Output is correct
17 Correct 98 ms 18048 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 42 ms 5996 KB Output is correct
21 Correct 179 ms 23160 KB Output is correct
22 Correct 161 ms 22152 KB Output is correct
23 Correct 193 ms 26244 KB Output is correct
24 Correct 160 ms 22144 KB Output is correct
25 Correct 83 ms 13356 KB Output is correct
26 Correct 72 ms 12288 KB Output is correct
27 Correct 186 ms 28316 KB Output is correct
28 Correct 163 ms 22124 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 9 ms 1100 KB Output is correct
37 Correct 163 ms 22092 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 9 ms 1612 KB Output is correct
41 Correct 192 ms 30228 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 5 ms 972 KB Output is correct
45 Correct 99 ms 17808 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 41 ms 5784 KB Output is correct
50 Correct 167 ms 23092 KB Output is correct
51 Correct 164 ms 22160 KB Output is correct
52 Correct 192 ms 28232 KB Output is correct
53 Correct 67 ms 12192 KB Output is correct
54 Correct 74 ms 13212 KB Output is correct
55 Correct 166 ms 22180 KB Output is correct
56 Correct 195 ms 26180 KB Output is correct
57 Correct 67 ms 12156 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 5 ms 1316 KB Output is correct
61 Correct 108 ms 21188 KB Output is correct
62 Correct 0 ms 204 KB Output is correct
63 Incorrect 1 ms 204 KB Too many ways to get from 0 to 9, should be 1 found no less than 2
64 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 8 ms 1624 KB Output is correct
7 Correct 191 ms 30276 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 7 ms 1176 KB Output is correct
13 Correct 170 ms 22240 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 972 KB Output is correct
17 Correct 98 ms 18048 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 42 ms 5996 KB Output is correct
21 Correct 179 ms 23160 KB Output is correct
22 Correct 161 ms 22152 KB Output is correct
23 Correct 193 ms 26244 KB Output is correct
24 Correct 160 ms 22144 KB Output is correct
25 Correct 83 ms 13356 KB Output is correct
26 Correct 72 ms 12288 KB Output is correct
27 Correct 186 ms 28316 KB Output is correct
28 Correct 163 ms 22124 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 9 ms 1100 KB Output is correct
37 Correct 163 ms 22092 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 9 ms 1612 KB Output is correct
41 Correct 192 ms 30228 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 5 ms 972 KB Output is correct
45 Correct 99 ms 17808 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 41 ms 5784 KB Output is correct
50 Correct 167 ms 23092 KB Output is correct
51 Correct 164 ms 22160 KB Output is correct
52 Correct 192 ms 28232 KB Output is correct
53 Correct 67 ms 12192 KB Output is correct
54 Correct 74 ms 13212 KB Output is correct
55 Correct 166 ms 22180 KB Output is correct
56 Correct 195 ms 26180 KB Output is correct
57 Correct 67 ms 12156 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 0 ms 204 KB Output is correct
61 Correct 44 ms 5832 KB Output is correct
62 Correct 170 ms 23072 KB Output is correct
63 Correct 183 ms 22044 KB Output is correct
64 Correct 186 ms 26144 KB Output is correct
65 Correct 0 ms 204 KB Output is correct
66 Correct 53 ms 5816 KB Output is correct
67 Correct 166 ms 23164 KB Output is correct
68 Correct 160 ms 22084 KB Output is correct
69 Correct 193 ms 28308 KB Output is correct
70 Correct 0 ms 204 KB Output is correct
71 Incorrect 0 ms 204 KB Too many ways to get from 4 to 8, should be 1 found no less than 2
72 Halted 0 ms 0 KB -