oj.uz

Submission #425483

# Submission time Handle Problem Language Result Execution time Memory
425483 2021-06-13T05:18:51 Z KoD Werewolf (IOI18_werewolf) C++17
49 / 100
 809 ms 57736 KB 
#include <bits/stdc++.h>
#include "werewolf.h"

template <class T> using Vec = std::vector<T>;

struct RMQ {
    Vec<Vec<int>> mintable;
    Vec<Vec<int>> maxtable;
    RMQ(const Vec<int>& vec) {
        const int n = (int) vec.size();
        int k = 0;
        while ((1 << k) <= n) {
            k += 1;
        }
        mintable.resize(k);
        maxtable.resize(k);
        mintable[0] = vec;
        maxtable[0] = vec;
        for (int h = 0; h < k - 1; ++h) {
            const int len = n - (1 << (h + 1)) + 1;
            mintable[h + 1].resize(len);
            maxtable[h + 1].resize(len);
            for (int i = 0; i < len; ++i) {
                mintable[h + 1][i] = std::min(mintable[h][i], mintable[h][i + (1 << h)]);
                maxtable[h + 1][i] = std::max(maxtable[h][i], maxtable[h][i + (1 << h)]);
            }
        }
    }
    int min(const int l, const int r) const {
        if (l == r) {
            return std::numeric_limits<int>::max();
        }
        const int h = 31 - __builtin_clz(r - l);
        return std::min(mintable[h][l], mintable[h][r - (1 << h)]);
    }
    int max(const int l, const int r) const {
        if (l == r) {
            return std::numeric_limits<int>::min();
        }
        const int h = 31 - __builtin_clz(r - l);
        return std::max(maxtable[h][l], maxtable[h][r - (1 << h)]);
    }
};

template <class Func> int binary_search(int ok, int ng, const Func& f) {
    while (std::abs(ok - ng) > 1) {
        const int md = (ok + ng) / 2;
        (f(md) ? ok : ng) = md;
    }
    return ok;
}

Vec<int> check_validity(int N, Vec<int> X, Vec<int> Y, Vec<int> S, Vec<int> E, Vec<int> L, Vec<int> R) {
    const int M = (int) X.size();
    const int Q = (int) S.size();
    Vec<Vec<int>> graph(N);
    for (int i = 0; i < M; ++i) {
        graph[X[i]].push_back(Y[i]);
        graph[Y[i]].push_back(X[i]);
    }
    if (N <= 3000 and M <= 6000 and Q <= 3000) {
        Vec<int> ret(Q);
        for (int i = 0; i < Q; ++i) {
            Vec<char> state(N);
            Vec<int> que;
            que.reserve(N);
            {
                const auto push = [&](const int u) {
                    if (u >= L[i] and !(state[u] & 1)) {
                        state[u] |= 1;
                        que.push_back(u);
                    }
                };
                push(S[i]);
                while (!que.empty()) {
                    const auto u = que.back();
                    que.pop_back();
                    for (const auto v : graph[u]) {
                        push(v);
                    }
                }
            }
            {
                const auto push = [&](const int u) {
                    if (u <= R[i] and !(state[u] & 2)) {
                        state[u] |= 2;
                        que.push_back(u);
                    }
                };
                push(E[i]);
                while (!que.empty()) {
                    const auto u = que.back();
                    que.pop_back();
                    for (const auto v : graph[u]) {
                        push(v);
                    }
                }
            }
            ret[i] = std::any_of(state.begin(), state.end(), [&](const int x) { return x == 3; });
        }
        return ret;
    } else {
        Vec<int> line;
        line.reserve(N);
        {
            int u = 0;
            while ((int) graph[u].size() != 1) {
                u += 1;
            }
            Vec<char> done(N);
            while (!done[u]) {
                line.push_back(u);
                done[u] = true;
                for (const auto v : graph[u]) {
                    if (!done[v]) {
                        u = v;
                        break;
                    }
                }
            }
        }
        Vec<int> idx(N);
        for (int i = 0; i < N; ++i) {
            idx[line[i]] = i;
        }
        RMQ rmq(line);
        Vec<int> ret(Q);
        for (int i = 0; i < Q; ++i) {
            const int u = S[i];
            const int v = E[i];
            if (idx[u] < idx[v]) {
                const auto right = binary_search(idx[u], N, [&](const int r) {
                    return rmq.min(idx[u], r + 1) >= L[i];
                });
                const auto left = binary_search(idx[v], -1, [&](const int l) {
                    return rmq.max(l, idx[v] + 1) <= R[i];
                });      
                ret[i] = right >= left;          
            } else {
                const auto left = binary_search(idx[u], -1, [&](const int l) {
                    return rmq.min(l, idx[u] + 1) >= L[i];
                });
                const auto right = binary_search(idx[v], N, [&](const int r) {
                    return rmq.max(idx[v], r + 1) <= R[i];
                });      
                ret[i] = right >= left;                    
            }
        }
        return ret;
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 2 ms 288 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 2 ms 288 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 259 ms 716 KB Output is correct
11 Correct 147 ms 716 KB Output is correct
12 Correct 18 ms 708 KB Output is correct
13 Correct 287 ms 720 KB Output is correct
14 Correct 188 ms 696 KB Output is correct
15 Correct 220 ms 824 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 809 ms 49708 KB Output is correct
2 Correct 462 ms 57600 KB Output is correct
3 Correct 457 ms 57656 KB Output is correct
4 Correct 553 ms 57728 KB Output is correct
5 Correct 666 ms 57524 KB Output is correct
6 Correct 587 ms 57572 KB Output is correct
7 Correct 654 ms 57592 KB Output is correct
8 Correct 406 ms 57652 KB Output is correct
9 Correct 360 ms 57648 KB Output is correct
10 Correct 356 ms 57600 KB Output is correct
11 Correct 438 ms 57620 KB Output is correct
12 Correct 377 ms 57664 KB Output is correct
13 Correct 553 ms 57692 KB Output is correct
14 Correct 470 ms 57728 KB Output is correct
15 Correct 457 ms 57736 KB Output is correct
16 Correct 457 ms 57660 KB Output is correct
17 Correct 602 ms 57640 KB Output is correct

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 2 ms 288 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 259 ms 716 KB Output is correct
11 Correct 147 ms 716 KB Output is correct
12 Correct 18 ms 708 KB Output is correct
13 Correct 287 ms 720 KB Output is correct
14 Correct 188 ms 696 KB Output is correct
15 Correct 220 ms 824 KB Output is correct
16 Correct 809 ms 49708 KB Output is correct
17 Correct 462 ms 57600 KB Output is correct
18 Correct 457 ms 57656 KB Output is correct
19 Correct 553 ms 57728 KB Output is correct
20 Correct 666 ms 57524 KB Output is correct
21 Correct 587 ms 57572 KB Output is correct
22 Correct 654 ms 57592 KB Output is correct
23 Correct 406 ms 57652 KB Output is correct
24 Correct 360 ms 57648 KB Output is correct
25 Correct 356 ms 57600 KB Output is correct
26 Correct 438 ms 57620 KB Output is correct
27 Correct 377 ms 57664 KB Output is correct
28 Correct 553 ms 57692 KB Output is correct
29 Correct 470 ms 57728 KB Output is correct
30 Correct 457 ms 57736 KB Output is correct
31 Correct 457 ms 57660 KB Output is correct
32 Correct 602 ms 57640 KB Output is correct
33 Runtime error 231 ms 53916 KB Execution killed with signal 11
34 Halted 0 ms 0 KB -