oj.uz

답안 #391808

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
391808 2021-04-20T01:59:46 Z JerryLiu06 Valley (BOI19_valley) C++11
100 / 100
 277 ms 45120 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<int, ll> pil;
 
#define pb push_back
 
#define f first
#define s second
 
int N, S, Q, E; int U[100010], V[100010]; vector<pil> adj[100010]; bool isShop[100010];
 
int timer, in[100010], out[100010], depth[100010]; ll dist[100010], DP[100010]; 
 
int liftVert[100010][21]; ll liftDP[100010][21]; const ll INF = 1e18 + 10;
 
bool isAnc(int A, int B) { return in[A] <= in[B] && out[B] <= out[A]; }
 
void DFS1(int X, int P) {
    in[X] = timer++; if (isShop[X]) DP[X] = dist[X]; else DP[X] = INF; 
    
    for (pil NXT : adj[X]) if (NXT.f != P) { 
        depth[NXT.f] = depth[X] + 1; dist[NXT.f] = dist[X] + NXT.s; DFS1(NXT.f, X); 
        
        DP[X] = min(DP[X], DP[NXT.f]);
    }
    liftVert[X][0] = P; out[X] = timer - 1;
}
 
int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);
 
    cin >> N >> S >> Q >> E;
 
    for (int i = 1; i <= N - 1; i++) { 
        int A, B; ll W; cin >> A >> B >> W;
 
        U[i] = A, V[i] = B; adj[A].pb({B, W}); adj[B].pb({A, W}); 
    }
    for (int i = 0; i < S; i++) { int X; cin >> X; isShop[X] = true; }
 
    DFS1(E, 0); for (int i = 1; i <= N; i++) DP[i] -= 2 * dist[i], liftDP[i][0] = DP[i];
    
    for (int i = 0; i <= 20; i++) liftDP[0][i] = INF;
    
    for (int j = 1; j <= 20; j++) for (int i = 1; i <= N; i++) {
        
        liftVert[i][j] = liftVert[liftVert[i][j - 1]][j - 1];
        liftDP[i][j] = min(liftDP[i][j - 1], liftDP[liftVert[i][j - 1]][j - 1]);
    }
    for (int i = 0; i < Q; i++) { 
        int I, X; cin >> I >> X; int LOW = (depth[U[I]] > depth[V[I]]) ? U[I] : V[I];
        
        if (!isAnc(LOW, X)) { cout << "escaped" << "\n"; continue; }
 
        if (DP[LOW] + 2 * dist[LOW] == INF) { cout << "oo" << "\n"; continue; }
 
        int LEN = depth[X] - depth[LOW]; ll ans = INF; int Y = X;
 
        for (int j = 20; j >= 0; j--) if (LEN & (1 << j)) { ans = min(ans, liftDP[Y][j]); Y = liftVert[Y][j]; }
 
        cout << min(ans, DP[LOW]) + dist[X] << "\n"; 
    }
}

Subtask #1
9.0 / 9.0

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

Subtask #2
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 2764 KB Output is correct
2 Correct 5 ms 2832 KB Output is correct
3 Correct 5 ms 2764 KB Output is correct
4 Correct 5 ms 2764 KB Output is correct
5 Correct 3 ms 2976 KB Output is correct
6 Correct 3 ms 3020 KB Output is correct
7 Correct 3 ms 3076 KB Output is correct
8 Correct 4 ms 3020 KB Output is correct
9 Correct 3 ms 3020 KB Output is correct
10 Correct 3 ms 3020 KB Output is correct
11 Correct 3 ms 3020 KB Output is correct
12 Correct 3 ms 3020 KB Output is correct
13 Correct 3 ms 3020 KB Output is correct
14 Correct 3 ms 3024 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 195 ms 36868 KB Output is correct
2 Correct 215 ms 40368 KB Output is correct
3 Correct 220 ms 40556 KB Output is correct
4 Correct 233 ms 42424 KB Output is correct
5 Correct 244 ms 42504 KB Output is correct
6 Correct 277 ms 44716 KB Output is correct

Subtask #4
41.0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 2764 KB Output is correct
2 Correct 5 ms 2832 KB Output is correct
3 Correct 5 ms 2764 KB Output is correct
4 Correct 5 ms 2764 KB Output is correct
5 Correct 3 ms 2976 KB Output is correct
6 Correct 3 ms 3020 KB Output is correct
7 Correct 3 ms 3076 KB Output is correct
8 Correct 4 ms 3020 KB Output is correct
9 Correct 3 ms 3020 KB Output is correct
10 Correct 3 ms 3020 KB Output is correct
11 Correct 3 ms 3020 KB Output is correct
12 Correct 3 ms 3020 KB Output is correct
13 Correct 3 ms 3020 KB Output is correct
14 Correct 3 ms 3024 KB Output is correct
15 Correct 195 ms 36868 KB Output is correct
16 Correct 215 ms 40368 KB Output is correct
17 Correct 220 ms 40556 KB Output is correct
18 Correct 233 ms 42424 KB Output is correct
19 Correct 244 ms 42504 KB Output is correct
20 Correct 277 ms 44716 KB Output is correct
21 Correct 162 ms 39932 KB Output is correct
22 Correct 197 ms 39712 KB Output is correct
23 Correct 175 ms 40004 KB Output is correct
24 Correct 184 ms 42032 KB Output is correct
25 Correct 257 ms 45120 KB Output is correct
26 Correct 165 ms 40004 KB Output is correct
27 Correct 191 ms 39840 KB Output is correct
28 Correct 179 ms 40004 KB Output is correct
29 Correct 230 ms 41588 KB Output is correct
30 Correct 255 ms 43192 KB Output is correct
31 Correct 175 ms 40192 KB Output is correct
32 Correct 200 ms 39916 KB Output is correct
33 Correct 192 ms 40272 KB Output is correct
34 Correct 209 ms 42048 KB Output is correct
35 Correct 266 ms 45104 KB Output is correct
36 Correct 237 ms 42044 KB Output is correct