oj.uz

Submission #545862

# Submission time Handle Problem Language Result Execution time Memory
545862 2022-04-05T15:29:41 Z Stickfish Valley (BOI19_valley) C++17
100 / 100
 394 ms 43416 KB 
#include <iostream>
#include <vector>
#include <bitset>
using namespace std;
using ll = long long;

const int MAXN = 1e5 + 123;
const ll INF = 1e18 + 177013;
const ll LESSINF = 1e14 + 177013;
vector<pair<int, ll>> edg[MAXN];
vector<pair<int, int>> qrs[MAXN];
bitset<MAXN> shop;
int tin[MAXN];
int tout[MAXN];
ll depth[MAXN];
vector<int> rtin;
int rt[MAXN];

void dfs(int v) {
    tin[v] = rtin.size();
    rtin.push_back(v);
    for (auto [u, w] : edg[v]) {
        if (u == rt[v])
            continue;
        rt[u] = v;
        depth[u] = depth[v] + w;
        dfs(u);
    }
    tout[v] = rtin.size();
}

struct stree {
    void resize(int n) {
        sz = n;
        t.resize(n * 2 - 1);
        mod.resize(n * 2 - 1);
    }

    void add(int l, int r, ll x) {
        add(0, 0, sz, l, r, x);
    }

    ll get(int l, int r) {
        return get(0, 0, sz, l, r);
    }
 private:
     int sz;
     vector<ll> t;
     vector<ll> mod;

     void add(int ind, int lnd, int rnd, int l, int r, ll x) {
         if (lnd >= l && rnd <= r) {
             t[ind] += x;
             mod[ind] += x;
             return;
         }
         if (lnd >= r || rnd <= l)
             return;
         int mnd = (lnd + rnd) / 2;
         int chd = ind + (mnd - lnd) * 2;
         add(ind + 1, lnd, mnd, l, r, x);
         add(chd, mnd, rnd, l, r, x);
         t[ind] = min(t[ind + 1], t[chd]) + mod[ind];
     }

     ll get(int ind, int lnd, int rnd, int l, int r) {
         if (lnd >= l && rnd <= r) {
             return t[ind];
         }
         if (lnd >= r || rnd <= l)
             return INF;
         int mnd = (lnd + rnd) / 2;
         int chd = ind + (mnd - lnd) * 2;
         return min(get(ind + 1, lnd, mnd, l, r), get(chd, mnd, rnd, l, r)) + mod[ind];
     }
};

bool in_subtree(int u, int paru) {
    return tin[paru] < tin[u] && tin[u] < tout[paru];
}

void ans_qrs(int v, stree& tr, vector<ll>& anss) {
    //cout << v << ": ";
    //for (int i = 0; i < rtin.size(); ++i) {
        //if (shop[rtin[i]])
            //cout << "(" << rtin[i] << ' ' << tr.get(i, i + 1) << ") ";
    //}
    //cout << endl;
    for (auto [u, qi] : qrs[v]) {
        if (u == v) {
            anss[qi] = tr.get(tin[v], tout[v]);
        } else if (in_subtree(u, v)) {
            anss[qi] = min(tr.get(0, tin[u]), tr.get(tout[u], rtin.size()));
        } else if (in_subtree(v, u)) {
            anss[qi] = tr.get(tin[u], tout[u]);
        } else {
            anss[qi] = min(tr.get(0, tin[u]), tr.get(tout[u], rtin.size()));
        }
        //cout << "{" << qi << ' ' << anss[qi] << "} ";
    }
    for (auto [u, w] : edg[v]) {
        if (rt[v] == u)
            continue;
        tr.add(0, rtin.size(), w);
        tr.add(tin[u], tout[u], -w * 2); 
        ans_qrs(u, tr, anss);
        tr.add(0, rtin.size(), -w);
        tr.add(tin[u], tout[u], w * 2); 
    }
}

signed main() {
    int n, s, q, e;
    cin >> n >> s >> q >> e;
    vector<pair<int, int>> roads(n - 1);
    --e;
    for (int i = 0; i < n - 1; ++i) {
        int u, v, w;
        cin >> u >> v >> w;
        --u, --v;
        edg[u].push_back({v, w});
        edg[v].push_back({u, w});
        roads[i] = {u, v};
    }
    for (int i = 0; i < s; ++i) {
        int c;
        cin >> c;
        shop[c - 1] = 1;
    }
    dfs(0);
    for (auto& [ru, rv] : roads) {
        if (rt[rv] == ru)
            swap(rv, ru);
    }
    vector<ll> ans(q);
    for (int qi = 0; qi < q; ++qi) {
        int ri, v;
        cin >> ri >> v;
        --ri, --v;
        int u = roads[ri].first;
        if (e == v) {
            ans[qi] = -1;
        } else if (in_subtree(e, v)) {
            if ((e == u || in_subtree(e, u)) && in_subtree(u, v))
                ans[qi] = -2;
            else
                ans[qi] = -1;
        } else {
            bool sube = in_subtree(e, u) || e == u;
            bool subv = in_subtree(v, u) || v == u;
            if (sube ^ subv)
                ans[qi] = -2;
            else
                ans[qi] = -1;
        }
        //cout << "(" << u << ' ' << v << ' ' << e << ": " << ans[qi] << ") ";
        if (ans[qi] == -2) {
            qrs[v].push_back({roads[ri].first, qi});
        }
    }
    stree tr;
    tr.resize(n);
    for (int i = 0; i < n; ++i) {
        if (shop[rtin[i]])
            tr.add(i, i + 1, depth[rtin[i]]);
        else
            tr.add(i, i + 1, INF);
    }
    ans_qrs(0, tr, ans);
    for (int i = 0; i < q; ++i) {
        if (ans[i] == -1) {
            cout << "escaped\n";
        } else if (ans[i] > LESSINF) {
            cout << "oo\n";
        } else {
            cout << ans[i] << '\n';
        }
    }
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5204 KB Output is correct
2 Correct 8 ms 5204 KB Output is correct
3 Correct 8 ms 5204 KB Output is correct
4 Correct 7 ms 5204 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5204 KB Output is correct
2 Correct 8 ms 5204 KB Output is correct
3 Correct 8 ms 5204 KB Output is correct
4 Correct 7 ms 5204 KB Output is correct
5 Correct 5 ms 5076 KB Output is correct
6 Correct 6 ms 5160 KB Output is correct
7 Correct 5 ms 5204 KB Output is correct
8 Correct 7 ms 5076 KB Output is correct
9 Correct 5 ms 5076 KB Output is correct
10 Correct 7 ms 5204 KB Output is correct
11 Correct 6 ms 5076 KB Output is correct
12 Correct 5 ms 5076 KB Output is correct
13 Correct 6 ms 5204 KB Output is correct
14 Correct 6 ms 5204 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 352 ms 19040 KB Output is correct
2 Correct 337 ms 18904 KB Output is correct
3 Correct 328 ms 19124 KB Output is correct
4 Correct 344 ms 27008 KB Output is correct
5 Correct 315 ms 24924 KB Output is correct
6 Correct 394 ms 43416 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5204 KB Output is correct
2 Correct 8 ms 5204 KB Output is correct
3 Correct 8 ms 5204 KB Output is correct
4 Correct 7 ms 5204 KB Output is correct
5 Correct 5 ms 5076 KB Output is correct
6 Correct 6 ms 5160 KB Output is correct
7 Correct 5 ms 5204 KB Output is correct
8 Correct 7 ms 5076 KB Output is correct
9 Correct 5 ms 5076 KB Output is correct
10 Correct 7 ms 5204 KB Output is correct
11 Correct 6 ms 5076 KB Output is correct
12 Correct 5 ms 5076 KB Output is correct
13 Correct 6 ms 5204 KB Output is correct
14 Correct 6 ms 5204 KB Output is correct
15 Correct 352 ms 19040 KB Output is correct
16 Correct 337 ms 18904 KB Output is correct
17 Correct 328 ms 19124 KB Output is correct
18 Correct 344 ms 27008 KB Output is correct
19 Correct 315 ms 24924 KB Output is correct
20 Correct 394 ms 43416 KB Output is correct
21 Correct 306 ms 19372 KB Output is correct
22 Correct 307 ms 19080 KB Output is correct
23 Correct 325 ms 19280 KB Output is correct
24 Correct 311 ms 24724 KB Output is correct
25 Correct 307 ms 38248 KB Output is correct
26 Correct 275 ms 19364 KB Output is correct
27 Correct 299 ms 19164 KB Output is correct
28 Correct 306 ms 19300 KB Output is correct
29 Correct 325 ms 26624 KB Output is correct
30 Correct 305 ms 33496 KB Output is correct
31 Correct 306 ms 19352 KB Output is correct
32 Correct 271 ms 19256 KB Output is correct
33 Correct 295 ms 19428 KB Output is correct
34 Correct 312 ms 25100 KB Output is correct
35 Correct 310 ms 35736 KB Output is correct
36 Correct 272 ms 27528 KB Output is correct