oj.uz

Submission #493646

# Submission time Handle Problem Language Result Execution time Memory
493646 2021-12-12T13:21:10 Z Fysty Valley (BOI19_valley) C++14
100 / 100
 237 ms 50628 KB 
#include <bits/stdc++.h>
#include <random>
#include <chrono>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T> void _do(T x){cerr<<x<<"\n";}
template<typename T,typename ...U> void _do(T x,U ...y){cerr<<x<<", ";_do(y...);}
#define dbg(...) cerr<<#__VA_ARGS__<<" = ";_do(__VA_ARGS__);

const int MOD1=1e9+7;
const int MOD2=998244353;
const ll INF=3e18;
const ld PI=3.14159265358979323846;
ll gcd(ll a,ll b){if(b==0) return a; return gcd(b,a%b);}
ll fpow(ll a,ll b,ll m)
{
    if(!b) return 1;
    ll ans=fpow(a*a%m,b/2,m);
    return (b%2?ans*a%m:ans);
}
ll inv(ll a,ll m) {return fpow(a,m-2,m);}

#define MottoHayaku ios::sync_with_stdio(false);cin.tie(0);
//#define int ll
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define repk(i,m,n) for(int i=m;i<n;i++)
#define F first
#define S second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define uni(c) c.resize(distance(c.begin(),unique(c.begin(),c.end())))
#define unisort(c) sort(c.begin(),c.end()),uni(c)
const int N=1e5+1;
ll dep[N],dist[N],tmp[N],in[N],out[N],an[18][N],mn[18][N],t=0;
bool is[N];
vector<pll> ed[N];
void dfs(ll n,ll p)
{
    in[n]=t++;
    dep[n]=(p==0?0:dep[p]+1);
    if(is[n]) tmp[n]=dist[n];
    for(pll u:ed[n])
    {
        if(u.F==p) continue;
        dist[u.F]=dist[n]+u.S;
        dfs(u.F,n);
        an[0][u.F]=n;
        tmp[n]=min(tmp[n],tmp[u.F]);
    }
    out[n]=t++;
}
bool isan(ll u,ll v){return (in[u]<=in[v]&&out[v]<=out[u]);}
signed main()
{
    MottoHayaku
    ll n,s,q,a;
    cin>>n>>s>>q>>a;
    vector<pll> e;
    rep1(i,n) tmp[i]=INF;
    rep(i,n-1)
    {
        ll u,v,w;
        cin>>u>>v>>w;
        e.pb({u,v});
        ed[u].pb({v,w});
        ed[v].pb({u,w});
    }
    rep(i,s)
    {
        ll c;
        cin>>c;
        is[c]=1;
    }
    an[0][a]=a;
    dfs(a,0);
    rep1(i,n) mn[0][i]=min(tmp[i]-dist[i]*2,tmp[an[0][i]]-dist[an[0][i]]*2);
    rep1(i,17)
    {
        rep1(j,n)
        {
            an[i][j]=an[i-1][an[i-1][j]];
            mn[i][j]=min(mn[i-1][j],mn[i-1][an[i-1][j]]);
        }
    }
    while(q--)
    {
        ll id,x;
        cin>>id>>x;
        id--;
        pll p=e[id];
        if(dep[p.F]<dep[p.S]) swap(p.F,p.S);
        if(!isan(p.F,x)) cout<<"escaped\n";
        else
        {
            if(tmp[p.F]==INF)
            {
                cout<<"oo\n";
                continue;
            }
            if(p.F==x)
            {
                cout<<tmp[x]-dist[x]<<"\n";
                continue;
            }
            ll k=dist[x],cur=INF;
            for(int i=17;i>=0;i--)
            {
                if(isan(an[i][x],p.F)) continue;
                cur=min(cur,mn[i][x]);
                x=an[i][x];
            }
            cur=min(cur,mn[0][x]);
            cout<<k+cur<<"\n";
        }
    }
}

Subtask #1
9.0 / 9.0

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

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2892 KB Output is correct
2 Correct 4 ms 3020 KB Output is correct
3 Correct 3 ms 3020 KB Output is correct
4 Correct 4 ms 3000 KB Output is correct
5 Correct 3 ms 3312 KB Output is correct
6 Correct 2 ms 3204 KB Output is correct
7 Correct 3 ms 3276 KB Output is correct
8 Correct 2 ms 3276 KB Output is correct
9 Correct 2 ms 3276 KB Output is correct
10 Correct 4 ms 3276 KB Output is correct
11 Correct 3 ms 3200 KB Output is correct
12 Correct 3 ms 3196 KB Output is correct
13 Correct 4 ms 3276 KB Output is correct
14 Correct 2 ms 3276 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 42268 KB Output is correct
2 Correct 147 ms 42004 KB Output is correct
3 Correct 140 ms 42176 KB Output is correct
4 Correct 197 ms 44148 KB Output is correct
5 Correct 142 ms 44180 KB Output is correct
6 Correct 186 ms 46388 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2892 KB Output is correct
2 Correct 4 ms 3020 KB Output is correct
3 Correct 3 ms 3020 KB Output is correct
4 Correct 4 ms 3000 KB Output is correct
5 Correct 3 ms 3312 KB Output is correct
6 Correct 2 ms 3204 KB Output is correct
7 Correct 3 ms 3276 KB Output is correct
8 Correct 2 ms 3276 KB Output is correct
9 Correct 2 ms 3276 KB Output is correct
10 Correct 4 ms 3276 KB Output is correct
11 Correct 3 ms 3200 KB Output is correct
12 Correct 3 ms 3196 KB Output is correct
13 Correct 4 ms 3276 KB Output is correct
14 Correct 2 ms 3276 KB Output is correct
15 Correct 116 ms 42268 KB Output is correct
16 Correct 147 ms 42004 KB Output is correct
17 Correct 140 ms 42176 KB Output is correct
18 Correct 197 ms 44148 KB Output is correct
19 Correct 142 ms 44180 KB Output is correct
20 Correct 186 ms 46388 KB Output is correct
21 Correct 110 ms 45456 KB Output is correct
22 Correct 152 ms 45220 KB Output is correct
23 Correct 123 ms 45420 KB Output is correct
24 Correct 136 ms 47540 KB Output is correct
25 Correct 237 ms 50628 KB Output is correct
26 Correct 107 ms 45528 KB Output is correct
27 Correct 120 ms 45256 KB Output is correct
28 Correct 142 ms 45492 KB Output is correct
29 Correct 182 ms 47060 KB Output is correct
30 Correct 195 ms 48584 KB Output is correct
31 Correct 115 ms 45552 KB Output is correct
32 Correct 130 ms 45480 KB Output is correct
33 Correct 129 ms 45800 KB Output is correct
34 Correct 165 ms 47676 KB Output is correct
35 Correct 177 ms 50576 KB Output is correct
36 Correct 150 ms 47564 KB Output is correct