oj.uz

Submission #342963

# Submission time Handle Problem Language Result Execution time Memory
342963 2021-01-03T09:35:02 Z spike1236 Valley (BOI19_valley) C++14
100 / 100
 295 ms 50156 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ll long long
#define ld long double
#define all(_v) _v.begin(), _v.end()
#define sz(_v) (int)_v.size()
#define pii pair <int, int>
#define pll pair <ll, ll>
#define veci vector <int>
#define vecll vector <ll>


const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
const double PI = 3.1415926535897932384626433832795;
const double eps = 1e-9;
const int MOD1 = 1e9 + 7;
const int MOD2 = 998244353;

const int MAXN = 1e5 + 10;
int n, s, q;
int root, tmr;
int tin[MAXN], tout[MAXN];
set <pii> g[MAXN];
pii EDGE[MAXN];
int is_shop[MAXN];
pii query[MAXN];
ll dp[MAXN][20];
ll rtsum[MAXN];
int up[MAXN][20];

void dfs_sz(int v = root, int p = 0, ll sum = 0) {
    tin[v] = ++tmr;
    up[v][0] = p;
    rtsum[v] = sum;
    if(is_shop[v]) dp[v][0] = sum;
    else dp[v][0] = 1e18;
    for(auto to : g[v]) {
        if(to.f != p) {
            dfs_sz(to.f, v, sum + to.s);
            dp[v][0] = min(dp[v][0], dp[to.f][0]);
        }
    }
    tout[v] = ++tmr;
}

bool upper(int v, int u) {
    return (tin[v] <= tin[u] && tout[v] >= tout[u]);
}

ll get(int v, int u) {
    ll res = 1e18;
    ll d = rtsum[v];
    for(int i = 18; i >= 0; --i)
        if(up[v][i] && !upper(up[v][i], u))
            res = min(res, dp[v][i] + d), v = up[v][i];
    return min(res, dp[v][0] + d);
}

void solve() {
    cin >> n >> s >> q >> root;
    for(int i = 1; i < n; ++i) {
        int u, v, cost;
        cin >> u >> v >> cost;
        g[u].insert(mp(v, cost));
        g[v].insert(mp(u, cost));
        EDGE[i] = mp(u, v);
    }
    for(int i = 1; i <= s; ++i) {
        int x;
        cin >> x;
        is_shop[x] = 1;
    }
    for(int i = 1; i <= q; ++i)
        cin >> query[i].f >> query[i].s;
    dfs_sz();
    for(int i = 1; i <= n; ++i) dp[i][0] -= 2 * rtsum[i];
    for(int i = 1; i < 19; ++i)
        for(int v = 1; v <= n; ++v)
            if(up[v][i - 1])
                up[v][i] = up[up[v][i - 1]][i - 1], dp[v][i] = min(dp[v][i - 1], dp[up[v][i - 1]][i - 1]);
    for(int i = 1; i <= q; ++i) {
        int blv = EDGE[query[i].f].f, blu = EDGE[query[i].f].s, v = query[i].s;
        if(!upper(blv, blu)) swap(blv, blu);
        if(upper(blu, v)) {
            ll res = get(v, blv);
            if(res >= (ll)1e16) cout << "oo\n";
            else cout << res << '\n';
        } else cout << "escaped\n";
    }
}


int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    ///cin >> T;
    while(T--) solve(), cout << '\n';
    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5360 KB Output is correct
2 Correct 6 ms 5356 KB Output is correct
3 Correct 6 ms 5356 KB Output is correct
4 Correct 7 ms 5356 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5360 KB Output is correct
2 Correct 6 ms 5356 KB Output is correct
3 Correct 6 ms 5356 KB Output is correct
4 Correct 7 ms 5356 KB Output is correct
5 Correct 5 ms 5484 KB Output is correct
6 Correct 4 ms 5484 KB Output is correct
7 Correct 5 ms 5484 KB Output is correct
8 Correct 4 ms 5484 KB Output is correct
9 Correct 5 ms 5484 KB Output is correct
10 Correct 6 ms 5500 KB Output is correct
11 Correct 5 ms 5484 KB Output is correct
12 Correct 5 ms 5484 KB Output is correct
13 Correct 5 ms 5484 KB Output is correct
14 Correct 5 ms 5504 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 247 ms 42476 KB Output is correct
2 Correct 243 ms 44780 KB Output is correct
3 Correct 232 ms 44908 KB Output is correct
4 Correct 264 ms 46700 KB Output is correct
5 Correct 237 ms 46828 KB Output is correct
6 Correct 295 ms 48876 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5360 KB Output is correct
2 Correct 6 ms 5356 KB Output is correct
3 Correct 6 ms 5356 KB Output is correct
4 Correct 7 ms 5356 KB Output is correct
5 Correct 5 ms 5484 KB Output is correct
6 Correct 4 ms 5484 KB Output is correct
7 Correct 5 ms 5484 KB Output is correct
8 Correct 4 ms 5484 KB Output is correct
9 Correct 5 ms 5484 KB Output is correct
10 Correct 6 ms 5500 KB Output is correct
11 Correct 5 ms 5484 KB Output is correct
12 Correct 5 ms 5484 KB Output is correct
13 Correct 5 ms 5484 KB Output is correct
14 Correct 5 ms 5504 KB Output is correct
15 Correct 247 ms 42476 KB Output is correct
16 Correct 243 ms 44780 KB Output is correct
17 Correct 232 ms 44908 KB Output is correct
18 Correct 264 ms 46700 KB Output is correct
19 Correct 237 ms 46828 KB Output is correct
20 Correct 295 ms 48876 KB Output is correct
21 Correct 214 ms 44652 KB Output is correct
22 Correct 207 ms 44908 KB Output is correct
23 Correct 220 ms 44908 KB Output is correct
24 Correct 258 ms 47084 KB Output is correct
25 Correct 269 ms 49900 KB Output is correct
26 Correct 202 ms 45164 KB Output is correct
27 Correct 211 ms 45164 KB Output is correct
28 Correct 220 ms 45420 KB Output is correct
29 Correct 261 ms 46572 KB Output is correct
30 Correct 284 ms 48236 KB Output is correct
31 Correct 206 ms 45292 KB Output is correct
32 Correct 211 ms 45420 KB Output is correct
33 Correct 235 ms 45420 KB Output is correct
34 Correct 256 ms 47352 KB Output is correct
35 Correct 259 ms 50156 KB Output is correct
36 Correct 247 ms 47212 KB Output is correct