oj.uz

Submission #482882

# Submission time Handle Problem Language Result Execution time Memory
482882 2021-10-26T16:31:11 Z jalsol Connecting Supertrees (IOI20_supertrees) C++17
19 / 100
 206 ms 30204 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);

    Rep (i, n) {
        Rep (j, n) {
            if (!req[i][j]) continue;
            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 (sz == 2) return 0;

        Rep (j, sz - 1) {
            ans[comp[j]][comp[j + 1]] = ans[comp[j + 1]][comp[j]] = 1;
        }
        if (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?

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -

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 0 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 1112 KB Output is correct
9 Correct 164 ms 22092 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 8 ms 1528 KB Output is correct
13 Correct 195 ms 30204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 4 ms 1100 KB Output is correct
17 Correct 100 ms 18200 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 42 ms 6084 KB Output is correct
22 Correct 168 ms 23492 KB Output is correct
23 Correct 206 ms 22464 KB Output is correct
24 Correct 196 ms 28608 KB Output is correct
25 Correct 68 ms 12404 KB Output is correct
26 Correct 81 ms 13536 KB Output is correct
27 Correct 160 ms 22408 KB Output is correct
28 Correct 189 ms 26400 KB Output is correct
29 Correct 66 ms 12460 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 Incorrect 0 ms 204 KB Too many ways to get from 1 to 4, should be 1 found no less than 2
4 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 Incorrect 1 ms 204 KB Answer gives possible 0 while actual possible 1
3 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 Incorrect 1 ms 204 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -