oj.uz

Submission #954744

# Submission time Handle Problem Language Result Execution time Memory
954744 2024-03-28T13:30:58 Z Flan312 Valley (BOI19_valley) C++17
100 / 100
 168 ms 37408 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define eb emplace_back
#define task ""
#define fast ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define nx freopen (task".inp","r",stdin), freopen (task".out","w",stdout);
#define fi first
#define se second
#define pii pair <int, int>
#define tii tuple <int, int, int>
using namespace std;
const int nmax = 1e5 + 2;
const ll oo = 1e18;
int n, s, q, e;
int h[nmax], up[nmax][17], in[nmax], out[nmax], cnt = 0;
bool shop[nmax];
vector <pii> adj[nmax];
pii edge[nmax];
ll dist[nmax], dp[nmax];
void dfs(int u)
{
    if (!shop[u]) dp[u] = oo;
    in[u] = ++cnt;
    for (auto &[v, w] : adj[u])
    {
        if (v == up[u][0]) continue;
        h[v] = h[u] + 1;
        dist[v] = dist[u] + w;
        up[v][0] = u;
        for (int j = 1; (1 << j) <= n; ++j)
            up[v][j] = up[up[v][j - 1]][j - 1];
        dfs(v);
        dp[u] = min(dp[u], dp[v] + w);
    }
    out[u] = cnt;
}
ll mi[nmax][17];
void dfs2(int u)
{
    for (auto &[v, w] : adj[u])
    {
        if (v == up[u][0]) continue;
        mi[v][0] = dp[v] - dist[v];
        for (int j = 1; (1 << j) <= n; ++j)
            mi[v][j] = min(mi[v][j - 1], mi[up[v][j - 1]][j - 1]);
        dfs2(v);
    }
}
ll get(int u, int k)
{
    ll res = oo;
    for (int j = 0; (1 << j) <= k; ++j)
        if (k >> j & 1)
        {
            res = min(res, mi[u][j]);
            u = up[u][j];
        }
    return res;
}
bool is_ancestor(int u, int v)
{
    return in[u] <= in[v] && in[v] <= out[u];
}
int main()
{
    if (ifstream(task".inp")) nx
    fast
    cin >> n >> s >> q >> e;
    for (int u, v, w, i = 1; i < n; ++i)
    {
        cin >> u >> v >> w;
        adj[u].eb(v, w);
        adj[v].eb(u, w);
        edge[i] = {u, v};
    }
    for (int c, i = 1; i <= s; ++i)
        cin >> c, shop[c] = 1;
    dfs(e);
    dfs2(e);
    while(q--)
    {
        int id, cur_node;
        cin >> id >> cur_node;
        auto [u, v] = edge[id];
        if (in[u] > in[v]) swap(u, v);
        if (!is_ancestor(v, cur_node))
        {
            cout << "escaped\n";
            continue;
        }
        if (dp[v] == oo) cout << "oo\n";
        else cout << get(cur_node, h[cur_node] - h[v] + 1) + dist[cur_node] << '\n';
    }
}

Compilation message

valley.cpp: In function 'int main()':
valley.cpp:7:20: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    7 | #define nx freopen (task".inp","r",stdin), freopen (task".out","w",stdout);
      |            ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
valley.cpp:67:31: note: in expansion of macro 'nx'
   67 |     if (ifstream(task".inp")) nx
      |                               ^~
valley.cpp:7:52: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    7 | #define nx freopen (task".inp","r",stdin), freopen (task".out","w",stdout);
      |                                            ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
valley.cpp:67:31: note: in expansion of macro 'nx'
   67 |     if (ifstream(task".inp")) nx
      |                               ^~

Subtask #1
9.0 / 9.0

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

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6744 KB Output is correct
2 Correct 3 ms 6748 KB Output is correct
3 Correct 3 ms 6748 KB Output is correct
4 Correct 3 ms 4700 KB Output is correct
5 Correct 2 ms 6748 KB Output is correct
6 Correct 2 ms 6748 KB Output is correct
7 Correct 2 ms 6744 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct
9 Correct 2 ms 4700 KB Output is correct
10 Correct 2 ms 6748 KB Output is correct
11 Correct 2 ms 4696 KB Output is correct
12 Correct 2 ms 4700 KB Output is correct
13 Correct 2 ms 4696 KB Output is correct
14 Correct 2 ms 6748 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 32868 KB Output is correct
2 Correct 137 ms 32600 KB Output is correct
3 Correct 133 ms 32356 KB Output is correct
4 Correct 147 ms 34388 KB Output is correct
5 Correct 168 ms 34332 KB Output is correct
6 Correct 152 ms 36176 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6744 KB Output is correct
2 Correct 3 ms 6748 KB Output is correct
3 Correct 3 ms 6748 KB Output is correct
4 Correct 3 ms 4700 KB Output is correct
5 Correct 2 ms 6748 KB Output is correct
6 Correct 2 ms 6748 KB Output is correct
7 Correct 2 ms 6744 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct
9 Correct 2 ms 4700 KB Output is correct
10 Correct 2 ms 6748 KB Output is correct
11 Correct 2 ms 4696 KB Output is correct
12 Correct 2 ms 4700 KB Output is correct
13 Correct 2 ms 4696 KB Output is correct
14 Correct 2 ms 6748 KB Output is correct
15 Correct 113 ms 32868 KB Output is correct
16 Correct 137 ms 32600 KB Output is correct
17 Correct 133 ms 32356 KB Output is correct
18 Correct 147 ms 34388 KB Output is correct
19 Correct 168 ms 34332 KB Output is correct
20 Correct 152 ms 36176 KB Output is correct
21 Correct 104 ms 32592 KB Output is correct
22 Correct 130 ms 32256 KB Output is correct
23 Correct 110 ms 32332 KB Output is correct
24 Correct 130 ms 34388 KB Output is correct
25 Correct 159 ms 37160 KB Output is correct
26 Correct 98 ms 32596 KB Output is correct
27 Correct 126 ms 32336 KB Output is correct
28 Correct 125 ms 32280 KB Output is correct
29 Correct 129 ms 33680 KB Output is correct
30 Correct 153 ms 35100 KB Output is correct
31 Correct 98 ms 32672 KB Output is correct
32 Correct 117 ms 32360 KB Output is correct
33 Correct 119 ms 32344 KB Output is correct
34 Correct 141 ms 34200 KB Output is correct
35 Correct 165 ms 37408 KB Output is correct
36 Correct 126 ms 34896 KB Output is correct