oj.uz

답안 #444789

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
444789 2021-07-15T10:00:33 Z prvocislo Valley (BOI19_valley) C++17
100 / 100
 209 ms 52540 KB 
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

const int maxn = 1e5 + 5, logn = 17; const ll inf = 1e18;
struct edge { int v, i; ll w; };
vector<edge> g[maxn];
int p[logn][maxn]; ll sum[logn][maxn], mini[logn][maxn];
vector<ll> v(maxn, inf); vector<int> tin(maxn, -1), tout(maxn, -1), d(maxn, 0), ev(maxn);
int n, s, q, e, timer = 0;
bool in_subtree(int u, int v) { return tin[u] <= tin[v] && tout[v] <= tout[u]; } // je v v podstrome u?
void dfs(int u)
{
    tin[u] = timer++;
    for (const edge &i : g[u]) if (tin[i.v] == -1) 
    {
        d[i.v] = d[u]+1;
        dfs(i.v); ev[i.i] = i.v;
        p[0][i.v] = u, sum[0][i.v] = i.w;
        v[u] = min(v[u], v[i.v] + i.w);
    }
    tout[u] = timer-1;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> s >> q >> e; e--;
    for (int i = 0; i < logn; i++) for (int j = 0; j < n; j++) p[i][j] = e, mini[i][j] = inf;
    for (int i = 0, a, b, w; i < n-1; i++)
    {
        cin >> a >> b >> w;
        g[--a].push_back({--b, i, w}), g[b].push_back({a, i, w});
    }
    for (int i = 0, x; i < s; i++) cin >> x, v[--x] = 0;
    dfs(e);
    for (int i = 0; i < n; i++) mini[0][i] = v[p[0][i]] + sum[0][i];
    for (int i = 1; i < logn; i++) for (int j = 0; j < n; j++)
    {
        p[i][j] = p[i-1][p[i-1][j]];
        sum[i][j] = sum[i-1][j] + sum[i-1][p[i-1][j]];
        mini[i][j] = min(mini[i-1][j], sum[i-1][j]+mini[i-1][p[i-1][j]]);
    }
    while (q--)
    {
        int i, vr; cin >> i >> vr; i--, vr--;
        int root = ev[i];
        if (!in_subtree(root, vr))
        {
            cout << "escaped\n";
            continue;
        }
        if (v[root] == inf)
        {
            cout << "oo\n";
            continue;
        }
        ll ans = v[vr], s = 0;
        for (int i = logn - 1; i >= 0; i--) if ((d[vr] - d[root]) & (1 << i))
        {
            ans = min(ans, s + mini[i][vr]);
            s += sum[i][vr], vr = p[i][vr];
        }
        cout << ans << "\n";
    }
    return 0;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5452 KB Output is correct
2 Correct 6 ms 5452 KB Output is correct
3 Correct 6 ms 5452 KB Output is correct
4 Correct 6 ms 5452 KB Output is correct

Subtask #2
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5452 KB Output is correct
2 Correct 6 ms 5452 KB Output is correct
3 Correct 6 ms 5452 KB Output is correct
4 Correct 6 ms 5452 KB Output is correct
5 Correct 4 ms 5708 KB Output is correct
6 Correct 4 ms 5700 KB Output is correct
7 Correct 4 ms 5708 KB Output is correct
8 Correct 4 ms 5708 KB Output is correct
9 Correct 4 ms 5580 KB Output is correct
10 Correct 4 ms 5692 KB Output is correct
11 Correct 6 ms 5580 KB Output is correct
12 Correct 4 ms 5708 KB Output is correct
13 Correct 4 ms 5684 KB Output is correct
14 Correct 4 ms 5708 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 134 ms 47812 KB Output is correct
2 Correct 151 ms 47768 KB Output is correct
3 Correct 164 ms 47896 KB Output is correct
4 Correct 182 ms 49748 KB Output is correct
5 Correct 172 ms 49904 KB Output is correct
6 Correct 209 ms 52036 KB Output is correct

Subtask #4
41.0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5452 KB Output is correct
2 Correct 6 ms 5452 KB Output is correct
3 Correct 6 ms 5452 KB Output is correct
4 Correct 6 ms 5452 KB Output is correct
5 Correct 4 ms 5708 KB Output is correct
6 Correct 4 ms 5700 KB Output is correct
7 Correct 4 ms 5708 KB Output is correct
8 Correct 4 ms 5708 KB Output is correct
9 Correct 4 ms 5580 KB Output is correct
10 Correct 4 ms 5692 KB Output is correct
11 Correct 6 ms 5580 KB Output is correct
12 Correct 4 ms 5708 KB Output is correct
13 Correct 4 ms 5684 KB Output is correct
14 Correct 4 ms 5708 KB Output is correct
15 Correct 134 ms 47812 KB Output is correct
16 Correct 151 ms 47768 KB Output is correct
17 Correct 164 ms 47896 KB Output is correct
18 Correct 182 ms 49748 KB Output is correct
19 Correct 172 ms 49904 KB Output is correct
20 Correct 209 ms 52036 KB Output is correct
21 Correct 122 ms 47428 KB Output is correct
22 Correct 130 ms 47188 KB Output is correct
23 Correct 140 ms 47404 KB Output is correct
24 Correct 151 ms 49600 KB Output is correct
25 Correct 174 ms 52540 KB Output is correct
26 Correct 123 ms 47400 KB Output is correct
27 Correct 126 ms 47172 KB Output is correct
28 Correct 138 ms 47444 KB Output is correct
29 Correct 164 ms 48828 KB Output is correct
30 Correct 192 ms 50512 KB Output is correct
31 Correct 131 ms 47556 KB Output is correct
32 Correct 141 ms 47316 KB Output is correct
33 Correct 148 ms 47556 KB Output is correct
34 Correct 189 ms 49628 KB Output is correct
35 Correct 177 ms 52420 KB Output is correct
36 Correct 178 ms 49516 KB Output is correct