oj.uz

답안 #780083

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
780083 2023-07-12T06:33:22 Z Cookie Valley (BOI19_valley) C++14
100 / 100
 177 ms 55424 KB 
#include<bits/stdc++.h>
#include<fstream>
using namespace std;
ifstream fin("VNOICUP.INP");
ofstream fout("VNOICUP.OUT");
#define sz(a) (int)a.size()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
const ld PI = 3.14159265359;
using u128 = __uint128_t;
//const int x[4] = {1, -1, 0, 0};
//const int y[4] = {0, 0, 1, -1};
const ll mod = 998244353;
const int mxn = 3e5 + 5, mxq = 2e5 + 5, sq = 400, mxv = 2e7 + 5;
//const int base = (1 << 18);
const ll inf = 1e15, neg = -69420;

int n, q, s, e;
vt<pll>adj[mxn + 1];
ll dep[mxn + 1], tin[mxn + 1], tout[mxn + 1], tt = 0, dp[mxn + 1];
bool ok[mxn + 1];
ll up[mxn + 1][18], mn[mxn + 1][18], h[mxn + 1];
vt<pii>edge;
void dfs(int u, int pre, ll d){
    tin[u] = ++tt; dep[u] = d; 
    if(ok[u])dp[u] = d;
    else dp[u] = inf;
    for(auto [v, w]: adj[u]){
        if(v != pre){
            up[v][0] = u; h[v] = h[u] + 1;
            dfs(v, u, d + w); 
            dp[u] = min(dp[u], dp[v]);
        }
    }
    tout[u] = tt;
}
bool inside(int u, int r){
    return(tin[u] <= tin[r] && tout[r] <= tout[u]);
}
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> s >> q >> e;
    for(int i = 1; i <= n; i++){
        for(int j = 0; j < 17; j++){
            mn[i][j] = inf;
        }
    }
    forr(i, 1, n){
        int u, v, w; cin >> u >> v >> w;
        adj[u].pb({v, w}); adj[v].pb({u, w});
        edge.pb({u, v});
    }
    for(int i = 0; i < s; i++){
        int x; cin >> x; ok[x] = 1;
    }
    dfs(e, -1, 0);

    for(int i = 1; i <= n; i++){
        if(dp[i] != inf)dp[i] -= 2 * dep[i]; 
        mn[i][0] = dp[i];
    }
    for(int i = 1; i < 17; i++){
        for(int j = 1; j <= n; j++){
            up[j][i] = up[up[j][i - 1]][i - 1];
            mn[j][i] = min(mn[j][i - 1], mn[up[j][i - 1]][i - 1]);
        }
    }
    
    for(int i = 0; i < q; i++){
        int id, r; cin >> id >> r; --id;
        auto [u, v] = edge[id];
        if(dep[u] < dep[v])swap(u, v);
        // is r inside subtree of u
        if(!inside(u, r)){
            cout << "escaped" << "\n";
        }else{
            int dif = h[r] - h[u] + 1;
            ll res = inf, val = dep[r];
            for(int j = 0; j < 17; j++){
                if(dif & (1 << j)){
                    res = min(res, mn[r][j]); r = up[r][j];
                }
            }
            if(res >= inf)cout << "oo" << "\n";
            else cout << res + val << "\n";
        }
    }
    
    return(0);
}

Compilation message

valley.cpp: In function 'void dfs(int, int, long long int)':
valley.cpp:37:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   37 |     for(auto [v, w]: adj[u]){
      |              ^
valley.cpp: In function 'int main()':
valley.cpp:80:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   80 |         auto [u, v] = edge[id];
      |              ^

Subtask #1
9.0 / 9.0

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

Subtask #2
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7508 KB Output is correct
2 Correct 7 ms 7528 KB Output is correct
3 Correct 8 ms 7508 KB Output is correct
4 Correct 6 ms 7508 KB Output is correct
5 Correct 6 ms 7764 KB Output is correct
6 Correct 4 ms 7764 KB Output is correct
7 Correct 4 ms 7764 KB Output is correct
8 Correct 5 ms 7764 KB Output is correct
9 Correct 5 ms 7764 KB Output is correct
10 Correct 5 ms 7764 KB Output is correct
11 Correct 4 ms 7764 KB Output is correct
12 Correct 4 ms 7784 KB Output is correct
13 Correct 4 ms 7776 KB Output is correct
14 Correct 4 ms 7764 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 120 ms 49988 KB Output is correct
2 Correct 144 ms 49952 KB Output is correct
3 Correct 143 ms 50084 KB Output is correct
4 Correct 157 ms 52332 KB Output is correct
5 Correct 145 ms 52312 KB Output is correct
6 Correct 177 ms 54972 KB Output is correct

Subtask #4
41.0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7508 KB Output is correct
2 Correct 7 ms 7528 KB Output is correct
3 Correct 8 ms 7508 KB Output is correct
4 Correct 6 ms 7508 KB Output is correct
5 Correct 6 ms 7764 KB Output is correct
6 Correct 4 ms 7764 KB Output is correct
7 Correct 4 ms 7764 KB Output is correct
8 Correct 5 ms 7764 KB Output is correct
9 Correct 5 ms 7764 KB Output is correct
10 Correct 5 ms 7764 KB Output is correct
11 Correct 4 ms 7764 KB Output is correct
12 Correct 4 ms 7784 KB Output is correct
13 Correct 4 ms 7776 KB Output is correct
14 Correct 4 ms 7764 KB Output is correct
15 Correct 120 ms 49988 KB Output is correct
16 Correct 144 ms 49952 KB Output is correct
17 Correct 143 ms 50084 KB Output is correct
18 Correct 157 ms 52332 KB Output is correct
19 Correct 145 ms 52312 KB Output is correct
20 Correct 177 ms 54972 KB Output is correct
21 Correct 132 ms 49408 KB Output is correct
22 Correct 124 ms 49236 KB Output is correct
23 Correct 127 ms 49380 KB Output is correct
24 Correct 142 ms 51904 KB Output is correct
25 Correct 143 ms 55424 KB Output is correct
26 Correct 111 ms 49476 KB Output is correct
27 Correct 117 ms 49340 KB Output is correct
28 Correct 124 ms 49460 KB Output is correct
29 Correct 146 ms 51260 KB Output is correct
30 Correct 147 ms 53072 KB Output is correct
31 Correct 125 ms 49596 KB Output is correct
32 Correct 123 ms 49420 KB Output is correct
33 Correct 124 ms 49656 KB Output is correct
34 Correct 140 ms 51984 KB Output is correct
35 Correct 166 ms 55384 KB Output is correct
36 Correct 132 ms 51864 KB Output is correct