oj.uz

Submission #560016

# Submission time Handle Problem Language Result Execution time Memory
560016 2022-05-11T03:01:28 Z Notred132 Valley (BOI19_valley) C++17
100 / 100
 221 ms 36780 KB 
#include <iostream>
#include <vector>

#define fi first
#define se second

using namespace std;
const long long maxw = 1e18;
const int maxn = 1e5 + 5;
int n, s, q, e;
int in[maxn], out[maxn];
vector <pair <int, int>> adj[maxn];
int cnt;
long long d[maxn];
int deg[maxn];
long long f[maxn][18], g[maxn];
bool dd[maxn];
int p1[maxn][18];

struct TEdge {
    int u, v, w;
};

 TEdge edg[maxn];

 void DFS(int u, int p) {
    in[u] = ++cnt;
    if(dd[u]) g[u] = 0;
    for(pair <int, int> i : adj[u]) {
        if(i.fi == p) continue;
        int v = i.fi;
        int w = i.se;
        d[v] = d[u] + w;
        deg[v] = deg[u] + 1;
        p1[v][0] = u;
        for(int j = 1; (1 << j) <= deg[v]; ++j) p1[v][j] = p1[p1[v][j - 1]][j - 1];
        DFS(i.fi, u);
        g[u] = min(g[u], g[v] + w);
    }
//    f[u][0] = g[u] - d[u];
//    for(int j = 1; (1 << j) <= deg[u] + 1; ++j) f[u][j] = min(f[u][j - 1], f[p1[u][j - 1]][j - 1]);
    out[u] = ++cnt;
 }

 void DFS1(int u, int p) {
    for(auto i : adj[u]) {
        if(i.fi == p) continue;
        int v = i.fi;
        int w = i.se;
        if(g[v] == 1e18) f[v][0] = 1e18;
        else f[v][0] = g[v] - d[v];
        for(int j = 1; (1 << j) <= deg[v] + 1; ++j) f[v][j] = min(f[v][j - 1], f[p1[v][j - 1]][j - 1]);
        DFS1(v, u);
    }
 }

long long solve(int u, int v) {
    int tmp = deg[v] - deg[u] + 1;
    long long res = 1e18;
    int tmp1 = 0;
    while(tmp) {
        if(tmp % 2) {
            res = min(res, f[v][tmp1]);
            v = p1[v][tmp1];
        }
        ++tmp1;
        tmp /= 2;
    }
    return res;
}



int main()
{
    ios_base::sync_with_stdio(NULL); cin.tie(nullptr);
    cin >> n >> s >> q >> e;
    for(int i = 1; i < n; ++i) {
        cin >> edg[i].u >> edg[i].v >> edg[i].w;
        adj[edg[i].u].push_back({edg[i].v, edg[i].w});
        adj[edg[i].v].push_back({edg[i].u, edg[i].w});
    }
    for(int i = 1; i <= s; ++i) {
        int u;
        cin >> u;
        dd[u] = 1;
    }
    fill(g + 1, g + n + 1, 1e18);
    DFS(e, 0);
    DFS1(e, 0);
    while(q--) {
        int id, c;
        cin >> id >> c;
        int u = edg[id].u;
        int v = edg[id].v;
        if(p1[v][0] == u) swap(u, v);
        if(in[u] > in[c] || out[u] < out[c]) {
            cout << "escaped" << '\n';
            continue;
        }
        long long ans = solve(u, c);
        if(ans == 1e18) cout << "oo" << '\n';
        else cout << ans + d[c] << '\n';
    }
    return 0;
}

Compilation message

valley.cpp: In function 'void DFS1(int, int)':
valley.cpp:49:13: warning: unused variable 'w' [-Wunused-variable]
   49 |         int w = i.se;
      |             ^

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2772 KB Output is correct
2 Correct 3 ms 2772 KB Output is correct
3 Correct 4 ms 2772 KB Output is correct
4 Correct 4 ms 2772 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2772 KB Output is correct
2 Correct 3 ms 2772 KB Output is correct
3 Correct 4 ms 2772 KB Output is correct
4 Correct 4 ms 2772 KB Output is correct
5 Correct 2 ms 2900 KB Output is correct
6 Correct 2 ms 2900 KB Output is correct
7 Correct 3 ms 3028 KB Output is correct
8 Correct 3 ms 2900 KB Output is correct
9 Correct 3 ms 2900 KB Output is correct
10 Correct 3 ms 3028 KB Output is correct
11 Correct 2 ms 2900 KB Output is correct
12 Correct 2 ms 2900 KB Output is correct
13 Correct 2 ms 3028 KB Output is correct
14 Correct 2 ms 3028 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 32364 KB Output is correct
2 Correct 145 ms 31984 KB Output is correct
3 Correct 174 ms 31896 KB Output is correct
4 Correct 171 ms 33676 KB Output is correct
5 Correct 187 ms 33760 KB Output is correct
6 Correct 180 ms 35728 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2772 KB Output is correct
2 Correct 3 ms 2772 KB Output is correct
3 Correct 4 ms 2772 KB Output is correct
4 Correct 4 ms 2772 KB Output is correct
5 Correct 2 ms 2900 KB Output is correct
6 Correct 2 ms 2900 KB Output is correct
7 Correct 3 ms 3028 KB Output is correct
8 Correct 3 ms 2900 KB Output is correct
9 Correct 3 ms 2900 KB Output is correct
10 Correct 3 ms 3028 KB Output is correct
11 Correct 2 ms 2900 KB Output is correct
12 Correct 2 ms 2900 KB Output is correct
13 Correct 2 ms 3028 KB Output is correct
14 Correct 2 ms 3028 KB Output is correct
15 Correct 116 ms 32364 KB Output is correct
16 Correct 145 ms 31984 KB Output is correct
17 Correct 174 ms 31896 KB Output is correct
18 Correct 171 ms 33676 KB Output is correct
19 Correct 187 ms 33760 KB Output is correct
20 Correct 180 ms 35728 KB Output is correct
21 Correct 116 ms 32304 KB Output is correct
22 Correct 163 ms 31968 KB Output is correct
23 Correct 134 ms 31904 KB Output is correct
24 Correct 159 ms 33892 KB Output is correct
25 Correct 170 ms 36780 KB Output is correct
26 Correct 121 ms 32396 KB Output is correct
27 Correct 117 ms 32052 KB Output is correct
28 Correct 143 ms 31992 KB Output is correct
29 Correct 157 ms 33424 KB Output is correct
30 Correct 221 ms 34808 KB Output is correct
31 Correct 110 ms 32368 KB Output is correct
32 Correct 124 ms 32064 KB Output is correct
33 Correct 170 ms 32072 KB Output is correct
34 Correct 172 ms 33820 KB Output is correct
35 Correct 195 ms 36704 KB Output is correct
36 Correct 174 ms 34588 KB Output is correct