oj.uz

답안 #430776

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
430776 2021-06-17T04:47:11 Z SirCovidThe19th Valley (BOI19_valley) C++14
100 / 100
 581 ms 43720 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pii pair<int, int>
#define inf LLONG_MAX
#define f first
#define s second

const int mx = 1e5+5, ml = 17;

int n, sh, q, e, tin[mx], tout[mx], cnt; 
ll d[mx], dp[mx], up[ml][mx], best[ml][mx]; bool shop[mx];
pii edges[mx]; vector<pii> adj[mx]; 

ll dfs1(int node){
    tin[node] = cnt++; ll ret = ((shop[node]) ? d[node] : inf); 
    for (int l = 1; l < ml; l++) up[l][node] = up[l-1][up[l-1][node]];
    for (pii nxt : adj[node])
        if (nxt.f != up[0][node])
            d[nxt.f] = d[node]+nxt.s, up[0][nxt.f] = node, ret = min(ret, dfs1(nxt.f));
    tout[node] = cnt-1; dp[node] = ((ret == inf) ? ret : ret-d[node]*2); return ret;
}

int main() {
    cin >> n >> sh >> q >> e;
    for (int i = 1; i < n; i++){
        int a, b, w; cin >> a >> b >> w;
        adj[a].push_back({b, w});
        adj[b].push_back({a, w});
        edges[i] = {a, b};
    }for (int i = 0; i < sh; i++) { int a; cin >> a; shop[a] = 1; }
    memset(best, 0x3f, sizeof(best)); dfs1(e);
    for (int i = 1; i <= n; i++) best[0][i] = dp[up[0][i]]; 
    for (int l = 1; l < ml; l++)
        for (int i = 1; i <= n; i++)
            best[l][i] = min(best[l-1][i], best[l-1][up[l-1][i]]);
    while (q--){
        int i, r; cin >> i >> r; ll ans = dp[r]; int curr = r;
        int root = ((up[0][edges[i].f] == edges[i].s) ? edges[i].f : edges[i].s);
        if (!(tin[root] <= tin[r] and tout[root] >= tout[r])) cout<<"escaped"<<endl;
        else if (dp[root] == inf) cout<<"oo"<<endl; 
        else{
            for (int l = ml-1; l >= 0; l--) 
                if (d[up[l][curr]] >= d[root]) 
                    ans = min(ans, best[l][curr]), curr = up[l][curr];
            cout<<ans+d[r]<<endl;
        }
    }
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 16136 KB Output is correct
2 Correct 29 ms 16172 KB Output is correct
3 Correct 30 ms 16172 KB Output is correct
4 Correct 28 ms 16188 KB Output is correct

Subtask #2
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 16136 KB Output is correct
2 Correct 29 ms 16172 KB Output is correct
3 Correct 30 ms 16172 KB Output is correct
4 Correct 28 ms 16188 KB Output is correct
5 Correct 11 ms 16204 KB Output is correct
6 Correct 10 ms 16232 KB Output is correct
7 Correct 12 ms 16204 KB Output is correct
8 Correct 11 ms 16280 KB Output is correct
9 Correct 11 ms 16304 KB Output is correct
10 Correct 11 ms 16268 KB Output is correct
11 Correct 12 ms 16204 KB Output is correct
12 Correct 12 ms 16216 KB Output is correct
13 Correct 12 ms 16228 KB Output is correct
14 Correct 12 ms 16204 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 494 ms 40800 KB Output is correct
2 Correct 503 ms 40644 KB Output is correct
3 Correct 507 ms 40416 KB Output is correct
4 Correct 539 ms 41844 KB Output is correct
5 Correct 503 ms 41932 KB Output is correct
6 Correct 581 ms 43452 KB Output is correct

Subtask #4
41.0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 16136 KB Output is correct
2 Correct 29 ms 16172 KB Output is correct
3 Correct 30 ms 16172 KB Output is correct
4 Correct 28 ms 16188 KB Output is correct
5 Correct 11 ms 16204 KB Output is correct
6 Correct 10 ms 16232 KB Output is correct
7 Correct 12 ms 16204 KB Output is correct
8 Correct 11 ms 16280 KB Output is correct
9 Correct 11 ms 16304 KB Output is correct
10 Correct 11 ms 16268 KB Output is correct
11 Correct 12 ms 16204 KB Output is correct
12 Correct 12 ms 16216 KB Output is correct
13 Correct 12 ms 16228 KB Output is correct
14 Correct 12 ms 16204 KB Output is correct
15 Correct 494 ms 40800 KB Output is correct
16 Correct 503 ms 40644 KB Output is correct
17 Correct 507 ms 40416 KB Output is correct
18 Correct 539 ms 41844 KB Output is correct
19 Correct 503 ms 41932 KB Output is correct
20 Correct 581 ms 43452 KB Output is correct
21 Correct 447 ms 40184 KB Output is correct
22 Correct 442 ms 39876 KB Output is correct
23 Correct 467 ms 39856 KB Output is correct
24 Correct 483 ms 41428 KB Output is correct
25 Correct 517 ms 43712 KB Output is correct
26 Correct 423 ms 40280 KB Output is correct
27 Correct 464 ms 39972 KB Output is correct
28 Correct 465 ms 39976 KB Output is correct
29 Correct 500 ms 41040 KB Output is correct
30 Correct 552 ms 42336 KB Output is correct
31 Correct 497 ms 40388 KB Output is correct
32 Correct 444 ms 40136 KB Output is correct
33 Correct 476 ms 40124 KB Output is correct
34 Correct 512 ms 41540 KB Output is correct
35 Correct 531 ms 43720 KB Output is correct
36 Correct 517 ms 41696 KB Output is correct