oj.uz

답안 #647588

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
647588 2022-10-03T09:00:21 Z berr Valley (BOI19_valley) C++17
100 / 100
 285 ms 64840 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
vector<array<int, 2>> edge, adj[(int)(1e5+37)];
vector<int> dis((int)(1e5+37), 2e18), ee((int)1e5+7), depth((int)1e5+37);
int par[(int)1e5+37][26], mi[(int)1e5+37][26];
int tin[(int)1e5+37], tout[(int)1e5+37], cnt, val[(int)1e5+37];

void dfs(int v, int p, int gh, int de)
{
   // cout<<v<<cnt<<"\n";
    par[v][0]=p;
    ee[v]=gh;
    depth[v]=de;
    tin[v]=cnt;
    cnt++;
    for(auto i: adj[v])
    {
        int u=i[0], z=i[1];
        if(u==p) continue;
        dfs(u, v, gh+z, de+1);

        dis[v]=min(dis[v], dis[u]+z);
    }
  //  cout<<"o7"<<v<<cnt<<"\n";

    tout[v]=cnt;
    cnt++;
}

bool is_ancestor(int x, int y)
{
    if(tin[x]<=tin[y]&&tout[x]>=tout[y]) return 1;
    return 0;
}

int32_t main()
{
    ios_base::sync_with_stdio(false); cin.tie(0);
    int n, s, q, e; cin>>n>>s>>q>>e;

    for(int i=0; i<n-1; i++)
    {
        int x, y, z; cin>>x>>y>>z;
        adj[x].push_back({y, z});
        adj[y].push_back({x, z});
        edge.push_back({x, y});

    }

    for(int i=0; i<=n; i++)
    {
        par[i][0]=i;
    }
    for(int i=0; i<s; i++)
    {

        int z; cin>>z;
        dis[z]=0;
    }
    for(int i=26; i>=0; i--)
    {
        for(int l=0; l<=n; l++)
        {
            mi[l][i]=2e18;
        }
    }
    dfs(e, e, 0, 0);

    for(int i=0; i<edge.size(); i++)
    {
        if(depth[edge[i][0]]<depth[edge[i][1]])
        {
            swap(edge[i][0], edge[i][1]);
        }
    }

    for(int l=1; l<26; l++)
    {
        for(int i=0; i<=n; i++)
        {
            par[i][l]=par[par[i][l-1]][l-1];
        }
    }

    for(int i=1; i<=n; i++)
    {
        val[i]=dis[i]-ee[i];
    }

    for(int l=0; l<=n; l++)
    {
        mi[l][0]=val[par[l][0]];
    }

    for(int l=1; l<26; l++)
    {
        for(int i=0; i<=n; i++)
        {
            mi[i][l]=min(mi[i][l-1], mi[par[i][l-1]][l-1]);
        }
    }

    while(q--)
    {
        int ed, pos; cin>>ed>>pos;
        ed--;
        if(!is_ancestor(edge[ed][0], pos)) cout<<"escaped\n";

        else
        {
            int x=edge[ed][0];
            int y=pos;
            int ans=val[pos];

            for(int j=25; j>=0; j--)
            {
                if(is_ancestor(x, par[pos][j]))
                {
                    ans=min(mi[pos][j], ans);
                    pos=par[pos][j];
                }
            }
            ans=min(ans, val[x]);
                        ans+=ee[y];

            if(ans<=1e18) cout<<ans<<"\n";
            else cout<<"oo\n";
        }
    }



}

Compilation message

valley.cpp: In function 'int32_t main()':
valley.cpp:70:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::array<long long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |     for(int i=0; i<edge.size(); i++)
      |                  ~^~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5196 KB Output is correct
2 Correct 5 ms 5280 KB Output is correct
3 Correct 5 ms 5264 KB Output is correct
4 Correct 5 ms 5204 KB Output is correct

Subtask #2
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5196 KB Output is correct
2 Correct 5 ms 5280 KB Output is correct
3 Correct 5 ms 5264 KB Output is correct
4 Correct 5 ms 5204 KB Output is correct
5 Correct 4 ms 5568 KB Output is correct
6 Correct 4 ms 5500 KB Output is correct
7 Correct 4 ms 5588 KB Output is correct
8 Correct 5 ms 5588 KB Output is correct
9 Correct 5 ms 5588 KB Output is correct
10 Correct 4 ms 5596 KB Output is correct
11 Correct 4 ms 5500 KB Output is correct
12 Correct 4 ms 5588 KB Output is correct
13 Correct 4 ms 5532 KB Output is correct
14 Correct 4 ms 5640 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 228 ms 59244 KB Output is correct
2 Correct 241 ms 59128 KB Output is correct
3 Correct 285 ms 59284 KB Output is correct
4 Correct 255 ms 61624 KB Output is correct
5 Correct 266 ms 61684 KB Output is correct
6 Correct 256 ms 64196 KB Output is correct

Subtask #4
41.0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5196 KB Output is correct
2 Correct 5 ms 5280 KB Output is correct
3 Correct 5 ms 5264 KB Output is correct
4 Correct 5 ms 5204 KB Output is correct
5 Correct 4 ms 5568 KB Output is correct
6 Correct 4 ms 5500 KB Output is correct
7 Correct 4 ms 5588 KB Output is correct
8 Correct 5 ms 5588 KB Output is correct
9 Correct 5 ms 5588 KB Output is correct
10 Correct 4 ms 5596 KB Output is correct
11 Correct 4 ms 5500 KB Output is correct
12 Correct 4 ms 5588 KB Output is correct
13 Correct 4 ms 5532 KB Output is correct
14 Correct 4 ms 5640 KB Output is correct
15 Correct 228 ms 59244 KB Output is correct
16 Correct 241 ms 59128 KB Output is correct
17 Correct 285 ms 59284 KB Output is correct
18 Correct 255 ms 61624 KB Output is correct
19 Correct 266 ms 61684 KB Output is correct
20 Correct 256 ms 64196 KB Output is correct
21 Correct 193 ms 58908 KB Output is correct
22 Correct 213 ms 58580 KB Output is correct
23 Correct 220 ms 58808 KB Output is correct
24 Correct 231 ms 61460 KB Output is correct
25 Correct 236 ms 64840 KB Output is correct
26 Correct 207 ms 58700 KB Output is correct
27 Correct 207 ms 58612 KB Output is correct
28 Correct 229 ms 58844 KB Output is correct
29 Correct 255 ms 60564 KB Output is correct
30 Correct 269 ms 62436 KB Output is correct
31 Correct 226 ms 58804 KB Output is correct
32 Correct 209 ms 58728 KB Output is correct
33 Correct 240 ms 58980 KB Output is correct
34 Correct 283 ms 61272 KB Output is correct
35 Correct 257 ms 64700 KB Output is correct
36 Correct 254 ms 61216 KB Output is correct