oj.uz

Submission #508326

# Submission time Handle Problem Language Result Execution time Memory
508326 2022-01-13T08:44:04 Z KoD Logičari (COCI21_logicari) C++17
110 / 110
 103 ms 15904 KB 
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)

using std::vector;
using std::array;
using std::pair;
using std::tuple;

template <class F> struct RecLambda : private F {
    explicit RecLambda(F&& f) : F(std::forward<F>(f)) {}
    template <class... Args> decltype(auto) operator()(Args&&... args) const {
        return F::operator()(*this, std::forward<Args>(args)...);
    }
};

constexpr int inf = std::numeric_limits<int>::max() / 4;

void setmin(int& x, const int y) {
    if (x > y) {
        x = y;
    }
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int N;
    std::cin >> N;
    vector<vector<int>> graph(N);
    vector<int> deg(N);
    for (int i = 0; i < N; ++i) {
        int a, b;
        std::cin >> a >> b;
        a -= 1, b -= 1;
        graph[a].push_back(b);
        graph[b].push_back(a);
        deg[a] += 1, deg[b] += 1;
    }
    std::queue<int> que;
    for (int i = 0; i < N; ++i) {
        if (deg[i] == 1) {
            que.push(i);
        }
    }
    vector<vector<int>> child(N);
    while (!que.empty()) {
        const int u = que.front();
        que.pop();
        for (const int v : graph[u]) {
            if (deg[v] >= 2) {
                child[v].push_back(u);
            }
            deg[v] -= 1;
            if (deg[v] == 1) {
                que.push(v);
            }
        }
    }
    vector<int> cycle;
    for (int i = 0; i < N; ++i) {
        if (deg[i] >= 2) {
            RecLambda([&](auto&& dfs, const int u) -> void {
                deg[u] = 0;
                cycle.push_back(u);
                for (const int v : graph[u]) {
                    if (deg[v] >= 2) {
                        dfs(v);
                    }
                }
            })(i);
        }
    }
    vector<array<array<int, 2>, 2>> tree;
    for (const int r : cycle) {
        tree.push_back(RecLambda([&](auto&& dfs, const int u) -> array<array<int, 2>, 2> {
            array<array<int, 2>, 2> dp = {};
            rep(i, 2) rep(j, 2) dp[i][j] = inf;
            dp[0][0] = 0, dp[1][0] = 1;
            for (const int v : child[u]) {
                const auto add = dfs(v);
                array<array<int, 2>, 2> next = {};
                rep(i, 2) rep(j, 2) next[i][j] = inf;
                rep(i, 2) rep(j, 2) rep(k, 2) {
                    if (j and k) continue;
                    setmin(next[i][j or k], dp[i][j] + add[k][!i]);
                }
                dp = std::move(next);
            }
            return dp;
        })(r));
    }
    const int n = tree.size();
    int ans = inf;
    rep(x, 2) rep(y, 2) rep(z, 2) rep(w, 2) {
        if (y and z) continue;
        if (x and w) continue;
        array<array<int, 2>, 2> dp = {};
        rep(i, 2) rep(j, 2) dp[i][j] = inf;
        dp[z][x or w] = tree[0][x][y] + tree[1][z][w];
        for (int u = 2; u < n; ++u) {
            array<array<int, 2>, 2> next = {};
            rep(i, 2) rep(j, 2) next[i][j] = inf;
            rep(i, 2) rep(j, 2) rep(k, 2) rep(l, 2) {
                if (j == k) continue;
                if (i and l) continue;
                setmin(next[k][l or i], dp[i][j] + tree[u][k][l]);
            }
            dp = std::move(next);
        }
        rep(i, 2) rep(j, 2) {
            if (j == x) continue;
            if (i + y + z != 1) continue;
            setmin(ans, dp[i][j]);
        }
    }
    std::cout << (ans == inf ? -1 : ans) << '\n';
    return 0;
}

Subtask #1
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 308 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 103 ms 14364 KB Output is correct
6 Correct 76 ms 14276 KB Output is correct
7 Correct 76 ms 14524 KB Output is correct
8 Correct 81 ms 14292 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 0 ms 312 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 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 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 0 ms 312 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 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 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 308 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 460 KB Output is correct
24 Correct 1 ms 332 KB Output is correct

Subtask #4
50.0 / 50.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 308 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 103 ms 14364 KB Output is correct
6 Correct 76 ms 14276 KB Output is correct
7 Correct 76 ms 14524 KB Output is correct
8 Correct 81 ms 14292 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 308 KB Output is correct
12 Correct 0 ms 312 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 0 ms 308 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 60 ms 9368 KB Output is correct
34 Correct 52 ms 9588 KB Output is correct
35 Correct 55 ms 9228 KB Output is correct
36 Correct 54 ms 9224 KB Output is correct
37 Correct 12 ms 2612 KB Output is correct
38 Correct 52 ms 9304 KB Output is correct
39 Correct 3 ms 1100 KB Output is correct
40 Correct 57 ms 9104 KB Output is correct
41 Correct 35 ms 10256 KB Output is correct
42 Correct 38 ms 10216 KB Output is correct
43 Correct 88 ms 15904 KB Output is correct
44 Correct 95 ms 12656 KB Output is correct