Submission #1092458

#	Time	Username	Problem	Language	Result	Execution time	Memory
1092458		huyngo	Werewolf (IOI18_werewolf)	C++17	49 / 100	386 ms	77332 KiB

werewolf

#include "werewolf.h"
#include <bits/stdc++.h>  
using namespace std;
using ll = long long;
using i64 = long long;
void __print(int x) { cerr << x; } void __print(long x) { cerr << x; } void __print(long long x) { cerr << x; } void __print(unsigned x) { cerr << x; } void __print(unsigned long x) { cerr << x; } void __print(unsigned long long x) { cerr << x; } void __print(float x) { cerr << x; } void __print(double x) { cerr << x; } void __print(long double x) { cerr << x; } void __print(char x) { cerr << '\'' << x << '\''; } void __print(const char* x) { cerr << '"' << x << '"'; } void __print(const string& x) { cerr << '"' << x << '"'; } void __print(bool x) { cerr << (x ? "true" : "false"); } template<typename T, typename V> void __print(const pair<T, V>& x) { cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}'; } template<typename T> void __print(const T& x) { int f = 0; cerr << '{'; for (auto& i : x) cerr << (f++ ? "," : ""), __print(i); cerr << "}"; } void _print() { cerr << "]\n"; } template <typename T, typename... V> void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << ", "; _print(v...); }
#define dbg(x...) cerr << "[" << #x << "] = ["; _print(x)
#define ln "\n"
#define fastIO() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define all(x) (x).begin(), (x).end()
#define rep(i,a,b) for(int i=a; i<=b; ++i)
#define ar array
int Bit(int mask, int b) { return (mask >> b) & 1; }
const ll base = 311, MOD = 998244353, M = 1e9 + 7, INF = 1e18;

std::vector<int> check_validity(int N, std::vector<int> X, std::vector<int> Y,
    std::vector<int> S, std::vector<int> E,
    std::vector<int> L, std::vector<int> R) {
    int Q = S.size();
    int M = X.size();
    std::vector<int> ANS(Q);

    vector<vector<int>> adj(N);
    rep(i, 0, M - 1) {
        adj[X[i]].push_back(Y[i]);
        adj[Y[i]].push_back(X[i]);
    }
    if (N <= 3000) {
        rep(i, 0, Q - 1) {
            vector<int> vis(N, 0);
            int ok = 0;
            auto dfs = [&](auto self, int u, int lb, int ub) -> void {
                if (u < lb || u > ub) return;
                vis[u] = (ub == 1e8 ? 1 : 2);
                for (int v : adj[u])
                    if (!vis[v]) {
                        if (lb <= v && v <= ub)
                            self(self, v, lb, ub);
                    }
                    else {
                        if (lb == -1 && vis[v] == 1 && v <= R[i])
                            ok = 1;
                    }
                };
            dfs(dfs, S[i], L[i], 1e8);
            if (E[i] <= R[i] && vis[E[i]] == 1)
                ok = true;
            dfs(dfs, E[i], -1, R[i]);
            ANS[i] = ok;
        }
        return ANS;
    }

    vector<int> pos(N);
    int dtime = -1;
    auto dfs = [&](auto self, int u, int p) -> void {
        pos[u] = ++dtime;
        for (int v : adj[u]) if (v != p)
            self(self, v, u);
        };
    rep(i, 0, N - 1) if (adj[i].size() == 1) {
        dfs(dfs, i, -1);
        break;
    }
    vector<int> a(N, 0);
    iota(all(a), 0);
    sort(all(a), [&](int i, int j) {
        return pos[i] < pos[j];
        });

    struct Info {
        int min = 1e9;
        int max = -1e9;
        Info operator + (const Info& p) {
            return Info{ std::min(min, p.min), std::max(max, p.max) };
        }
    };
    vector<vector<Info>> g(N, vector<Info>(21));
    for (int i = 0; i < N; ++i)
        g[i][0] = { a[i], a[i] };
    for (int j = 1; j < 21; ++j)
        for (int i = 0; i + (1 << j) <= N; ++i)
            g[i][j] = g[i][j - 1] + g[i + (1 << (j - 1))][j - 1];

    auto get = [&](int l, int r) -> Info {
        int k = log2(r - l + 1);
        return g[l][k] + g[r - (1 << k) + 1][k];
        };

    rep(i, 0, Q - 1) {
        if (S[i] < L[i] || E[i] > R[i]) continue;
        if (pos[S[i]] < pos[E[i]]) {
            // min(pos[si], mid) >= L
            // max(mid, pos[ei]) <= R
            int lo = pos[S[i]], hi = pos[E[i]], md;
            int x = lo;
            while (lo <= hi) {
                md = (lo + hi) / 2;
                if (get(pos[S[i]], md).min >= L[i]) {
                    lo = md + 1;
                    x = max(x, md);
                }
                else
                    hi = md - 1;
            }
            ANS[i] = get(x, pos[E[i]]).max <= R[i];
        }
        else {
            // min(mid, pos[si]) >= L
            // max(pos[ei], mid) <= R
            int lo = pos[E[i]], hi = pos[S[i]], md;
            int x = hi;
            while (lo <= hi) {
                md = (lo + hi) / 2;
                if (get(md, pos[S[i]]).min >= L[i]) {
                    hi = md - 1;
                    x = min(x, md);
                }
                else
                    lo = md + 1;
            }
            ANS[i] = get(pos[E[i]], x).max <= R[i];
        }
    }
    return ANS;
}

• Subtask 1: 7 / 7
• Subtask 2: 8 / 8
• Subtask 3: 34 / 34
• Subtask 4: 0 / 51