oj.uz

Submission #675051

# Submission time Handle Problem Language Result Execution time Memory
675051 2022-12-26T21:47:40 Z Trent Valley (BOI19_valley) C++17
100 / 100
 457 ms 51376 KB 
#include "bits/stdc++.h"
#include <cstring>
#include <fstream>

using namespace std;

#define ll long long
#define forR(i, x) for(int i = 0; i < x; ++i)
#define REP(i, a, b) for(int i = (a); i < (b); ++i)
#define open(s) freopen(((string) s + ".in").c_str(), "r", stdin); freopen(((string) s + ".out").c_str(), "w", stdout)
#define all(i) i.begin(), i.end()
#define boost() cin.sync_with_stdio(0); cin.tie()
typedef pair<int, int> pii;

const int MN = 1e5 + 10, ME = 18;
const ll INF = MN * (1e9 + 10);
int anc[MN][ME], dep[MN];
ll dis[MN][ME], up[MN][ME];
bool shop[MN];
vector<pii> adj[MN];

void fill(int c, int p, int w, int d){
    anc[c][0] = p;
    up[c][0] = w;
    dep[c] = d;
    REP(e, 1, ME) {
        anc[c][e] = anc[c][e-1] == -1 ? -1 : anc[anc[c][e-1]][e-1];
        up[c][e] = anc[c][e-1] == -1 ? -1 : up[c][e-1] + up[anc[c][e-1]][e-1];
    }
    for(auto [i, w] : adj[c]) if(i != p) fill(i, c, w, d + 1);
}
int jmp(int c, int d){
    for(int e = ME - 1; e >= 0; --e) if((1 << e) <= d){
        c = anc[c][e];
        d -= (1 << e);
    }
    return c;
}
void dfs(int c, int p){
    dis[c][0] = shop[c] ? 0 : INF;
    for(auto [i, w] : adj[c]) if(i != p){
        dfs(i, c);
        dis[c][0] = min(dis[c][0], w + dis[i][0]);
    }
}

signed main() {
    int n, s, q, e; cin >> n >> s >> q >> e;
    vector<pii> edges;
    forR(g, n - 1){
        int a, b, w; cin >> a >> b >> w;
        edges.push_back({a, b});
        adj[a].push_back({b, w}); adj[b].push_back({a, w});
    }
    forR(g, s){
        int c; cin >> c;
        shop[c] = true;
    }
    fill(e, -1, 0, 0);
    dfs(e, -1);
    for(pii& i : edges) if(dep[i.first] > dep[i.second]) swap(i.first, i.second);
    REP(e, 1, ME) REP(i, 1, n + 1){
        dis[i][e] = anc[i][e] == -1 ? -1 : min(dis[i][e-1], up[i][e-1] + dis[anc[i][e-1]][e-1]);
    }
    forR(g, q){
        int i, r; cin >> i >> r;
        pii ed = edges[i - 1];
        if(dep[ed.second] <= dep[r] && ed.second == jmp(r, dep[r] - dep[ed.second]) && ed.first == anc[ed.second][0]){
            int amt = dep[r] - dep[ed.second] + 1;
            ll mi = INF;
            ll used = 0;
            int cur = r;
            for(int e = ME - 1; e >= 0; --e) if((1 << e) <= amt){
                mi = min(mi, used + dis[cur][e]);
                used += up[cur][e]; cur = anc[cur][e];
                amt -= (1 << e);
            }
            if(mi == INF) cout << "oo\n";
            else cout << mi << '\n';
        } else cout << "escaped\n";
    }
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 2772 KB Output is correct
2 Correct 18 ms 2772 KB Output is correct
3 Correct 17 ms 2772 KB Output is correct
4 Correct 17 ms 2792 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 2772 KB Output is correct
2 Correct 18 ms 2772 KB Output is correct
3 Correct 17 ms 2772 KB Output is correct
4 Correct 17 ms 2792 KB Output is correct
5 Correct 5 ms 3052 KB Output is correct
6 Correct 4 ms 3028 KB Output is correct
7 Correct 4 ms 3060 KB Output is correct
8 Correct 4 ms 3156 KB Output is correct
9 Correct 4 ms 3060 KB Output is correct
10 Correct 4 ms 3028 KB Output is correct
11 Correct 5 ms 3028 KB Output is correct
12 Correct 4 ms 3028 KB Output is correct
13 Correct 5 ms 3028 KB Output is correct
14 Correct 4 ms 3056 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 389 ms 43840 KB Output is correct
2 Correct 399 ms 47168 KB Output is correct
3 Correct 407 ms 47160 KB Output is correct
4 Correct 454 ms 49056 KB Output is correct
5 Correct 405 ms 48972 KB Output is correct
6 Correct 457 ms 50916 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 2772 KB Output is correct
2 Correct 18 ms 2772 KB Output is correct
3 Correct 17 ms 2772 KB Output is correct
4 Correct 17 ms 2792 KB Output is correct
5 Correct 5 ms 3052 KB Output is correct
6 Correct 4 ms 3028 KB Output is correct
7 Correct 4 ms 3060 KB Output is correct
8 Correct 4 ms 3156 KB Output is correct
9 Correct 4 ms 3060 KB Output is correct
10 Correct 4 ms 3028 KB Output is correct
11 Correct 5 ms 3028 KB Output is correct
12 Correct 4 ms 3028 KB Output is correct
13 Correct 5 ms 3028 KB Output is correct
14 Correct 4 ms 3056 KB Output is correct
15 Correct 389 ms 43840 KB Output is correct
16 Correct 399 ms 47168 KB Output is correct
17 Correct 407 ms 47160 KB Output is correct
18 Correct 454 ms 49056 KB Output is correct
19 Correct 405 ms 48972 KB Output is correct
20 Correct 457 ms 50916 KB Output is correct
21 Correct 345 ms 46916 KB Output is correct
22 Correct 358 ms 46556 KB Output is correct
23 Correct 364 ms 46556 KB Output is correct
24 Correct 399 ms 48556 KB Output is correct
25 Correct 407 ms 51376 KB Output is correct
26 Correct 350 ms 47016 KB Output is correct
27 Correct 364 ms 46596 KB Output is correct
28 Correct 379 ms 46572 KB Output is correct
29 Correct 396 ms 48040 KB Output is correct
30 Correct 438 ms 49424 KB Output is correct
31 Correct 349 ms 47088 KB Output is correct
32 Correct 359 ms 46776 KB Output is correct
33 Correct 372 ms 46720 KB Output is correct
34 Correct 405 ms 48512 KB Output is correct
35 Correct 420 ms 51356 KB Output is correct
36 Correct 392 ms 48756 KB Output is correct