oj.uz

Submission #414759

# Submission time Handle Problem Language Result Execution time Memory
414759 2021-05-31T07:10:55 Z two_sides Joker (BOI20_joker) C++17
0 / 100
 252 ms 18552 KB 
#include <bits/stdc++.h>

using namespace std;

#define fi first
#define se second

struct DSU {
    vector <int> par, siz;
    vector <int> tim, ver;

    DSU(int N): par(N, 0), siz(N, 1) {}

    int root(int u) {
        while (par[u]) u = par[u];
        return u;
    }

    void join(int u, int v) {
        u = root(u); v = root(v);
        if (u == v) return;
        if (siz[u] < siz[v]) swap(u, v);
        par[v] = u; siz[u] += siz[v]; 
        ver.push_back(v);
    } 

    void push(int u, int v) {
        tim.push_back(ver.size());
        join(2 * u - 1, 2 * v);
        join(2 * u, 2 * v - 1);
    }

    void pop() {
        while (ver.size() > tim.back()) {
            int v = ver.back();
            ver.pop_back();
            siz[par[v]] -= siz[v];
            par[v] = 0;
        }
        tim.pop_back();
    }

    bool check(int u, int v) {
        return root(2 * u) == root(2 * v);
    }
};

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int N, M, Q;
    cin >> N >> M >> Q;
    DSU dsu(N * 2);
    vector <pair <int, int>> E(M);
    for (int i = 0; i < M; i++)
        cin >> E[i].fi >> E[i].se;
    vector <pair <int, int>> buc, tmp[2];
    auto pop = [&]() {
        if (buc.back().se) {
            while (buc.size()) {
                auto p = buc.back();
                buc.pop_back(); dsu.pop();
                tmp[p.se].push_back(p);
                if (tmp[0].size() == tmp[1].size())
                    break;
            }
            if (tmp[0].empty()) {
                for (auto &p : tmp[1]) {
                    dsu.push(E[p.fi].fi, E[p.fi].se);
                    p.se = 0;
                }
                swap(tmp[1], buc);
            } else {
                while (tmp[1].size()) {
                    auto p = tmp[1].back();
                    tmp[1].pop_back();
                    buc.push_back(p);
                    dsu.push(E[p.fi].fi, E[p.fi].se);
                }
                while (tmp[0].size()) {
                    auto p = tmp[0].back();
                    tmp[0].pop_back();
                    buc.push_back(p);
                    dsu.push(E[p.fi].fi, E[p.fi].se);
                }
            }
        }
        dsu.pop(); buc.pop_back();
    };
    auto push = [&](int i) {
        buc.emplace_back(i, 1);
        dsu.push(E[i].fi, E[i].se);
    };
    vector <int> lim(2 * N);
    for (int i = 0, j = 0; i < 2 * M; i++) {
        int u, v; tie(u, v) = E[i % M];
        while (dsu.check(u, v)) {
            pop(); j++;
        }
        lim[i] = j; push(i % M);
    }
    while (Q--) {
        int l, r; cin >> l >> r;
        if (lim[l + M - 2] <= r)
            cout << "NO\n";
        else cout << "YES\n";
    }
}

Compilation message

Joker.cpp: In member function 'void DSU::pop()':
Joker.cpp:34:27: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} [-Wsign-compare]
   34 |         while (ver.size() > tim.back()) {
      |                ~~~~~~~~~~~^~~~~~~~~~~~

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Incorrect 1 ms 204 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Incorrect 1 ms 204 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Runtime error 252 ms 18552 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Incorrect 1 ms 204 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Incorrect 1 ms 204 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Incorrect 1 ms 204 KB Output isn't correct
7 Halted 0 ms 0 KB -