oj.uz

Submission #555758

# Submission time Handle Problem Language Result Execution time Memory
555758 2022-05-01T13:12:16 Z status_coding Valley (BOI19_valley) C++14
100 / 100
 325 ms 27004 KB 
#include <bits/stdc++.h>

using namespace std;

long long n, nr, q, t, e;

vector<pair<int, int>> edges;

bool isShop[100005];

long long d[100005];
long long dp[100005];

int in[100005], out[100005];

vector<pair<long long, long long>> v[100005];

vector<pair<int, int>> qv[100005];

long long ans[100005];


vector<long long> seg;

void upd(int stt, int drt, int st, int dr, int p, long long val)
{
    if(stt == st && drt == dr)
    {
        seg[p] = min(seg[p], val);
        return;
    }

    int mij = (st + dr)/2;

    if(drt <= mij)
        upd(stt, drt, st, mij, 2*p, val);
    else if(stt > mij)
        upd(stt, drt, mij+1, dr, 2*p+1, val);
    else
    {
        upd(stt, mij, st, mij, 2*p, val);
        upd(mij+1, drt, mij+1, dr, 2*p+1, val);
    }

}

long long query(int i, int st, int dr, int p)
{
    if(st == dr)
        return seg[p];

    int mij = (st+dr)/2;

    if(i <= mij)
        return min(seg[p], query(i, st, mij, 2*p));
    else
        return min(seg[p], query(i, mij+1, dr, 2*p+1));
}

void dfs(int p, int par)
{
    t++;
    in[p] = t;

    if(isShop[p])
        dp[p] = 0;
    else
        dp[p] = 1e18;

    for(auto it : v[p])
    {
        if(it.first == par)
            continue;

        d[it.first] = d[p] + it.second;
        dfs(it.first, p);

        dp[p] = min(dp[p], dp[it.first] + it.second);
    }

    out[p] = t;
}

void calc(int p, int par)
{
    for(auto it : v[p])
    {
        if(it.first == par)
            continue;

        calc(it.first, p);
    }

    upd(in[p], out[p], 1, n, 1, dp[p] - d[p]);

    for(auto it : qv[p])
    {
        int pozQ = it.first;
        int idQ = it.second;

        if(in[p] <= in[pozQ] && in[pozQ] <= out[p])
            ans[idQ] = query(in[pozQ], 1, n, 1) + d[pozQ];

        else
            ans[idQ] = -1;
    }
}

int main()
{
    cin>>n>>nr>>q>>e;

    seg.resize(4*n+4);
    fill(seg.begin(), seg.end(), 1e18);

    edges.push_back({0, 0});
    for(int i=1;i<n;i++)
    {
        long long x, y, w;
        cin>>x>>y>>w;

        v[x].push_back({y, w});
        v[y].push_back({x, w});

        edges.push_back({x, y});
    }

    for(int i=1;i<=nr;i++)
    {
        int x;
        cin>>x;

        isShop[x] = true;
    }

    dfs(e, 0);

    for(int i=1; i<=n; i++)
        upd(in[i], in[i], 1, n, 1, dp[i] - d[i]);

    for(int i=1;i<=q;i++)
    {
        int id, p;
        cin>>id>>p;

        int x = edges[id].first;
        int y = edges[id].second;

        if(d[x] > d[y])
            swap(x, y);

        qv[y].push_back({p, i});
    }

    calc(e, 0);

    for(int i=1;i<=q;i++)
    {
        if(ans[i] == -1)
            cout<<"escaped\n";
        else
        {
            if(ans[i] == 1e18)
                cout<<"oo\n";
            else
                cout<<ans[i]<<'\n';
        }

    }
    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5332 KB Output is correct
2 Correct 7 ms 5280 KB Output is correct
3 Correct 7 ms 5328 KB Output is correct
4 Correct 7 ms 5368 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5332 KB Output is correct
2 Correct 7 ms 5280 KB Output is correct
3 Correct 7 ms 5328 KB Output is correct
4 Correct 7 ms 5368 KB Output is correct
5 Correct 5 ms 5204 KB Output is correct
6 Correct 5 ms 5204 KB Output is correct
7 Correct 4 ms 5204 KB Output is correct
8 Correct 5 ms 5204 KB Output is correct
9 Correct 5 ms 5192 KB Output is correct
10 Correct 5 ms 5160 KB Output is correct
11 Correct 5 ms 5152 KB Output is correct
12 Correct 5 ms 5204 KB Output is correct
13 Correct 5 ms 5116 KB Output is correct
14 Correct 5 ms 5152 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 325 ms 21656 KB Output is correct
2 Correct 280 ms 21436 KB Output is correct
3 Correct 320 ms 21460 KB Output is correct
4 Correct 300 ms 23636 KB Output is correct
5 Correct 311 ms 23404 KB Output is correct
6 Correct 297 ms 25964 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5332 KB Output is correct
2 Correct 7 ms 5280 KB Output is correct
3 Correct 7 ms 5328 KB Output is correct
4 Correct 7 ms 5368 KB Output is correct
5 Correct 5 ms 5204 KB Output is correct
6 Correct 5 ms 5204 KB Output is correct
7 Correct 4 ms 5204 KB Output is correct
8 Correct 5 ms 5204 KB Output is correct
9 Correct 5 ms 5192 KB Output is correct
10 Correct 5 ms 5160 KB Output is correct
11 Correct 5 ms 5152 KB Output is correct
12 Correct 5 ms 5204 KB Output is correct
13 Correct 5 ms 5116 KB Output is correct
14 Correct 5 ms 5152 KB Output is correct
15 Correct 325 ms 21656 KB Output is correct
16 Correct 280 ms 21436 KB Output is correct
17 Correct 320 ms 21460 KB Output is correct
18 Correct 300 ms 23636 KB Output is correct
19 Correct 311 ms 23404 KB Output is correct
20 Correct 297 ms 25964 KB Output is correct
21 Correct 269 ms 21616 KB Output is correct
22 Correct 249 ms 21516 KB Output is correct
23 Correct 325 ms 21448 KB Output is correct
24 Correct 280 ms 23952 KB Output is correct
25 Correct 296 ms 27004 KB Output is correct
26 Correct 246 ms 21792 KB Output is correct
27 Correct 274 ms 21592 KB Output is correct
28 Correct 263 ms 21568 KB Output is correct
29 Correct 313 ms 23224 KB Output is correct
30 Correct 266 ms 24652 KB Output is correct
31 Correct 265 ms 21708 KB Output is correct
32 Correct 274 ms 21572 KB Output is correct
33 Correct 285 ms 21696 KB Output is correct
34 Correct 275 ms 23940 KB Output is correct
35 Correct 275 ms 26772 KB Output is correct
36 Correct 242 ms 24428 KB Output is correct