oj.uz

Submission #642030

# Submission time Handle Problem Language Result Execution time Memory
642030 2022-09-18T10:10:30 Z piOOE Simurgh (IOI17_simurgh) C++17
51 / 100
 872 ms 1628 KB 
#include <bits/stdc++.h>
#include "simurgh.h"

using namespace std;

void my_assert(bool f) {
    if (!f) {
        cerr << "228\n";
        int x = 1337;
        while (!f) {
            x *= 2;
            cerr << "yay";
        }
    }
}

struct dsu {
    vector<int> p;

    dsu(int n = 0) {
        p.resize(n);
        iota(p.begin(), p.end(), 0);
    }

    int get(int x) {
        while (x != p[x]) x = p[x] = p[p[x]];
        return x;
    }

    bool same(int x, int y) {
        return get(x) == get(y);
    }

    bool unite(int x, int y) {
        x = get(x), y = get(y);
        if (x == y) {
            return false;
        }
        p[y] = x;
        return true;
    }
};


vector<int> find_roads(int n, std::vector<int> u, std::vector<int> v) {
    vector<pair<int, int>> par(n);
    vector<int> tin(n), tout(n);
    int T = 0, ans_st = 0;

    auto calc = [&](vector<int> st) {
        T = 0;
        ans_st = count_common_roads(st);
        vector<vector<pair<int, int>>> g(n);
        for (int i = 0; i < n - 1; ++i) {
            g[u[st[i]]].emplace_back(v[st[i]], i);
            g[v[st[i]]].emplace_back(u[st[i]], i);
        }
        function<void(int)> dfs = [&](int v) {
            tin[v] = T++;
            for (auto [to, i]: g[v]) {
                if (to != par[v].first) {
                    par[to] = {v, i};
                    dfs(to);
                }
            }
            tout[v] = T;
        };
        dfs(0);
    };

    int m = u.size();

    dsu d(n);
    vector<int> st;
    vector<bool> in_st(m);
    for (int i = 0; i < m; ++i) {
        in_st[i] = d.unite(u[i], v[i]);
        if (in_st[i]) {
            st.push_back(i);
        }
    }


    auto isp = [&](int x, int y) {
        return tin[x] <= tin[y] && tout[x] >= tout[y];
    };

    auto path = [&](int x, int y) -> vector<int> {
        int y_ = y, x_ = x;
        vector<int> ans;
        while (!isp(x, y_)) {
            ans.push_back(par[x].second);
            x = par[x].first;
        }
        while (!isp(y, x_)) {
            ans.push_back(par[y].second);
            y = par[y].first;
        }
        return ans;
    };

    calc(st);

    vector<bool> sure(m);

    for (int i = 0; i < m; ++i) {
        if (find(st.begin(), st.end(), i) == st.end()) {
            vector<int> now = path(u[i], v[i]);
            vector<int> vis;
            bool yay = false;
            for (int j: now) {
                if (!sure[st[j]]) {
                    auto q = st;
                    q.erase(q.begin() + j);
                    q.push_back(i);
                    int val = count_common_roads(q);
                    if (val > ans_st) {
                        st = q;
                        sure[i] = true;
                        calc(st);
                        yay = true;
                        break;
                    } else if (val < ans_st) {
                        sure[st[j]] = true;
                        break;
                    } else {
                        vis.push_back(st[j]);
                    }
                }
            }
            if (yay) {
                for (int j : vis) {
                    sure[j] = true;
                }
            } else {
                if (!vis.empty()) {
                    for (int j : vis) {
                        auto it = find(st.begin(), st.end(), j);
                        if (it != st.end()) {
                            st.erase(it);
                        }
                    }
                    dsu s(n);
                    for (int j : st) {
                        assert(s.unite(u[j], v[j]));
                    }
                    for (int j = i + 1; j < m; ++j) {
                        if (s.unite(u[j], v[j])) {
                            st.push_back(j);
                        }
                    }
                    calc(st);
                }
            }
        }
    }
    return st;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB correct
2 Correct 1 ms 212 KB correct
3 Correct 1 ms 212 KB correct
4 Correct 0 ms 212 KB correct
5 Correct 0 ms 212 KB correct
6 Correct 0 ms 212 KB correct
7 Correct 0 ms 212 KB correct
8 Correct 1 ms 212 KB correct
9 Correct 1 ms 212 KB correct
10 Correct 0 ms 212 KB correct
11 Correct 0 ms 212 KB correct
12 Correct 1 ms 212 KB correct
13 Correct 0 ms 212 KB correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB correct
2 Correct 1 ms 212 KB correct
3 Correct 1 ms 212 KB correct
4 Correct 0 ms 212 KB correct
5 Correct 0 ms 212 KB correct
6 Correct 0 ms 212 KB correct
7 Correct 0 ms 212 KB correct
8 Correct 1 ms 212 KB correct
9 Correct 1 ms 212 KB correct
10 Correct 0 ms 212 KB correct
11 Correct 0 ms 212 KB correct
12 Correct 1 ms 212 KB correct
13 Correct 0 ms 212 KB correct
14 Correct 5 ms 212 KB correct
15 Correct 5 ms 324 KB correct
16 Correct 5 ms 212 KB correct
17 Correct 5 ms 212 KB correct
18 Correct 2 ms 212 KB correct
19 Correct 5 ms 212 KB correct
20 Correct 4 ms 212 KB correct
21 Correct 4 ms 212 KB correct
22 Correct 1 ms 216 KB correct
23 Correct 1 ms 212 KB correct
24 Correct 1 ms 212 KB correct
25 Correct 0 ms 212 KB correct
26 Correct 1 ms 212 KB correct
27 Correct 1 ms 212 KB correct
28 Correct 0 ms 212 KB correct
29 Correct 0 ms 212 KB correct
30 Correct 1 ms 212 KB correct
31 Correct 1 ms 212 KB correct
32 Correct 1 ms 212 KB correct
33 Correct 1 ms 212 KB correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB correct
2 Correct 1 ms 212 KB correct
3 Correct 1 ms 212 KB correct
4 Correct 0 ms 212 KB correct
5 Correct 0 ms 212 KB correct
6 Correct 0 ms 212 KB correct
7 Correct 0 ms 212 KB correct
8 Correct 1 ms 212 KB correct
9 Correct 1 ms 212 KB correct
10 Correct 0 ms 212 KB correct
11 Correct 0 ms 212 KB correct
12 Correct 1 ms 212 KB correct
13 Correct 0 ms 212 KB correct
14 Correct 5 ms 212 KB correct
15 Correct 5 ms 324 KB correct
16 Correct 5 ms 212 KB correct
17 Correct 5 ms 212 KB correct
18 Correct 2 ms 212 KB correct
19 Correct 5 ms 212 KB correct
20 Correct 4 ms 212 KB correct
21 Correct 4 ms 212 KB correct
22 Correct 1 ms 216 KB correct
23 Correct 1 ms 212 KB correct
24 Correct 1 ms 212 KB correct
25 Correct 0 ms 212 KB correct
26 Correct 1 ms 212 KB correct
27 Correct 1 ms 212 KB correct
28 Correct 0 ms 212 KB correct
29 Correct 0 ms 212 KB correct
30 Correct 1 ms 212 KB correct
31 Correct 1 ms 212 KB correct
32 Correct 1 ms 212 KB correct
33 Correct 1 ms 212 KB correct
34 Correct 759 ms 760 KB correct
35 Correct 701 ms 944 KB correct
36 Correct 401 ms 748 KB correct
37 Correct 16 ms 304 KB correct
38 Correct 704 ms 964 KB correct
39 Correct 639 ms 864 KB correct
40 Correct 421 ms 748 KB correct
41 Correct 872 ms 980 KB correct
42 Correct 855 ms 980 KB correct
43 Correct 9 ms 596 KB correct
44 Correct 7 ms 564 KB correct
45 Correct 9 ms 596 KB correct
46 Correct 8 ms 576 KB correct
47 Correct 5 ms 340 KB correct
48 Correct 2 ms 300 KB correct
49 Correct 2 ms 304 KB correct
50 Correct 5 ms 340 KB correct
51 Correct 8 ms 644 KB correct
52 Correct 8 ms 600 KB correct
53 Correct 7 ms 468 KB correct
54 Correct 9 ms 672 KB correct
55 Correct 10 ms 596 KB correct
56 Correct 9 ms 652 KB correct
57 Correct 10 ms 596 KB correct

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB correct
2 Correct 0 ms 212 KB correct
3 Incorrect 702 ms 1628 KB WA in grader: NO
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB correct
2 Correct 1 ms 212 KB correct
3 Correct 1 ms 212 KB correct
4 Correct 0 ms 212 KB correct
5 Correct 0 ms 212 KB correct
6 Correct 0 ms 212 KB correct
7 Correct 0 ms 212 KB correct
8 Correct 1 ms 212 KB correct
9 Correct 1 ms 212 KB correct
10 Correct 0 ms 212 KB correct
11 Correct 0 ms 212 KB correct
12 Correct 1 ms 212 KB correct
13 Correct 0 ms 212 KB correct
14 Correct 5 ms 212 KB correct
15 Correct 5 ms 324 KB correct
16 Correct 5 ms 212 KB correct
17 Correct 5 ms 212 KB correct
18 Correct 2 ms 212 KB correct
19 Correct 5 ms 212 KB correct
20 Correct 4 ms 212 KB correct
21 Correct 4 ms 212 KB correct
22 Correct 1 ms 216 KB correct
23 Correct 1 ms 212 KB correct
24 Correct 1 ms 212 KB correct
25 Correct 0 ms 212 KB correct
26 Correct 1 ms 212 KB correct
27 Correct 1 ms 212 KB correct
28 Correct 0 ms 212 KB correct
29 Correct 0 ms 212 KB correct
30 Correct 1 ms 212 KB correct
31 Correct 1 ms 212 KB correct
32 Correct 1 ms 212 KB correct
33 Correct 1 ms 212 KB correct
34 Correct 759 ms 760 KB correct
35 Correct 701 ms 944 KB correct
36 Correct 401 ms 748 KB correct
37 Correct 16 ms 304 KB correct
38 Correct 704 ms 964 KB correct
39 Correct 639 ms 864 KB correct
40 Correct 421 ms 748 KB correct
41 Correct 872 ms 980 KB correct
42 Correct 855 ms 980 KB correct
43 Correct 9 ms 596 KB correct
44 Correct 7 ms 564 KB correct
45 Correct 9 ms 596 KB correct
46 Correct 8 ms 576 KB correct
47 Correct 5 ms 340 KB correct
48 Correct 2 ms 300 KB correct
49 Correct 2 ms 304 KB correct
50 Correct 5 ms 340 KB correct
51 Correct 8 ms 644 KB correct
52 Correct 8 ms 600 KB correct
53 Correct 7 ms 468 KB correct
54 Correct 9 ms 672 KB correct
55 Correct 10 ms 596 KB correct
56 Correct 9 ms 652 KB correct
57 Correct 10 ms 596 KB correct
58 Correct 0 ms 212 KB correct
59 Correct 0 ms 212 KB correct
60 Incorrect 702 ms 1628 KB WA in grader: NO
61 Halted 0 ms 0 KB -