oj.uz

Submission #866790

# Submission time Handle Problem Language Result Execution time Memory
866790 2023-10-27T04:45:12 Z Eliorita Valley (BOI19_valley) C++14
100 / 100
 303 ms 61432 KB 
#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define x first
#define y second
#define getbit(u,i) ((u>>i)&1)
#define all(x) x.begin(),x.end()
#define N 200001
using namespace std;
typedef pair<int,int> ii;
typedef pair<double,double> dd;
struct node
{
    int val,lazy;
} tree[4*N];
int n,s,e,q,a[N],num[N],tail[N],h[N],p[N][18],cnt,rev[N],d[N],ans[N];
vector<ii> g[N],Q[N];
ii ed[N];
void down(int id,int l,int r)
{
    tree[id].val+=tree[id].lazy;
    if(l!=r)
    {
        tree[id*2].lazy+=tree[id].lazy;
        tree[id*2+1].lazy+=tree[id].lazy;
    }
    tree[id].lazy=0;
}
void update(int id,int l,int r,int u,int v,int val)
{
    down(id,l,r);
    if(l>v||r<u||l>r||u>v) return;
    if(l>=u&&r<=v)
    {
        tree[id].val+=val;
        if(l!=r)
        {
            tree[id*2].lazy+=val;
            tree[id*2+1].lazy+=val;
        }
        return;
    }
    int m=(l+r)/2;
    update(id*2,l,m,u,v,val);
    update(id*2+1,m+1,r,u,v,val);
    tree[id].val=min(tree[id*2].val,tree[id*2+1].val);
}
int get(int id,int l,int r,int u,int v)
{
    down(id,l,r);
    if(l>v||r<u||l>r||u>v) return LLONG_MAX;
    if(l>=u&&r<=v) return tree[id].val;
    int m=(l+r)/2;
    return min(get(id*2,l,m,u,v),get(id*2+1,m+1,r,u,v));
}
void dfs(int u,int pre)
{
    num[u]=++cnt;
    rev[cnt]=u;
    h[u]=h[pre]+1;
    p[u][0]=pre;
    for(int i=1;i<=17;i++) p[u][i]=p[p[u][i-1]][i-1];
    for(ii v : g[u])
    {
        if(v.x==pre) continue;
        d[v.x]=d[u]+v.y;
        dfs(v.x,u);
    }
    tail[u]=cnt;
}
int lca(int u,int v)
{
    if(h[u]<h[v]) swap(u,v);
    for(int i=17;i>=0;i--)
    {
        if(h[p[u][i]]>=h[v]) u=p[u][i];
    }
    if(u==v) return u;
    for(int i=17;i>=0;i--)
    {
        if(p[u][i]!=p[v][i])
        {
            u=p[u][i];
            v=p[v][i];
        }
    }
    return p[u][0];
}
void reroot(int u,int pre)
{
//    cout<<u<<'\n';
//    for(int i=1;i<=s;i++) cout<<get(1,1,s,i,i)<<' ';
//    cout<<'\n';
    for(ii c : Q[u])
    {
        int cur=ed[c.x].x;
//        if(u==5)cout<<cur<<' ';
        if(lca(u,cur)!=cur) ans[c.y]=-1;
        else
        {
            int l=lower_bound(a+1,a+s+1,num[cur])-a;
            int r=upper_bound(a+1,a+s+1,tail[cur])-a-1;
            if(l>r) ans[c.y]=-2;
            else ans[c.y]=get(1,1,s,l,r);
        }
    }
    for(ii v : g[u])
    {
        if(v.x==pre) continue;
        int l=lower_bound(a+1,a+s+1,num[v.x])-a;
        int r=upper_bound(a+1,a+s+1,tail[v.x])-a-1;
//        if(v.x==3)  cout<<num[3]<<' '<<l<<' '<<r<<'\n';
        update(1,1,s,1,s,v.y);
        update(1,1,s,l,r,-2*v.y);
        reroot(v.x,u);
        update(1,1,s,1,s,-v.y);
        update(1,1,s,l,r,2*v.y);
    }
}
signed main()
{
    if(fopen("demo.inp","r"))
    {
        freopen("demo.inp","r",stdin);
        freopen("demo.out","w",stdout);
    }
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>s>>q>>e;
    for(int i=1;i<n;i++)
    {
        int u,v,w;
        cin>>u>>v>>w;
        ed[i]={u,v};
        g[u].pb({v,w});
        g[v].pb({u,w});
    }
    dfs(e,0);
    for(int i=1;i<n;i++)
    {
        if(h[ed[i].x]<h[ed[i].y]) swap(ed[i].y,ed[i].x);
    }
    for(int i=1;i<=s;i++) {cin>>a[i]; a[i]=num[a[i]];}
//    cout<<upper_bound(a+1,a+s+1,3)-a-1;
//    return 0;
    sort(a+1,a+s+1);
    for(int i=1;i<=s;i++) update(1,1,s,i,i,d[rev[a[i]]]);
    for(int i=1;i<=q;i++)
    {
        int k,r;
        cin>>k>>r;
        Q[r].pb({k,i});
    }
    reroot(e,0);
    for(int i=1;i<=q;i++)
    {
        if(ans[i]==-1) cout<<"escaped\n";
        else if(ans[i]==-2) cout<<"oo\n";
        else cout<<ans[i]<<'\n';
    }
}

Compilation message

valley.cpp: In function 'int main()':
valley.cpp:124:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  124 |         freopen("demo.inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
valley.cpp:125:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  125 |         freopen("demo.out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 21296 KB Output is correct
2 Correct 6 ms 21340 KB Output is correct
3 Correct 6 ms 21340 KB Output is correct
4 Correct 7 ms 21304 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 21296 KB Output is correct
2 Correct 6 ms 21340 KB Output is correct
3 Correct 6 ms 21340 KB Output is correct
4 Correct 7 ms 21304 KB Output is correct
5 Correct 4 ms 21080 KB Output is correct
6 Correct 4 ms 21080 KB Output is correct
7 Correct 4 ms 21084 KB Output is correct
8 Correct 4 ms 21236 KB Output is correct
9 Correct 4 ms 21084 KB Output is correct
10 Correct 4 ms 21172 KB Output is correct
11 Correct 5 ms 21084 KB Output is correct
12 Correct 5 ms 21244 KB Output is correct
13 Correct 5 ms 21084 KB Output is correct
14 Correct 5 ms 21084 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 239 ms 56484 KB Output is correct
2 Correct 263 ms 56160 KB Output is correct
3 Correct 286 ms 56556 KB Output is correct
4 Correct 303 ms 58456 KB Output is correct
5 Correct 247 ms 58828 KB Output is correct
6 Correct 287 ms 61432 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 21296 KB Output is correct
2 Correct 6 ms 21340 KB Output is correct
3 Correct 6 ms 21340 KB Output is correct
4 Correct 7 ms 21304 KB Output is correct
5 Correct 4 ms 21080 KB Output is correct
6 Correct 4 ms 21080 KB Output is correct
7 Correct 4 ms 21084 KB Output is correct
8 Correct 4 ms 21236 KB Output is correct
9 Correct 4 ms 21084 KB Output is correct
10 Correct 4 ms 21172 KB Output is correct
11 Correct 5 ms 21084 KB Output is correct
12 Correct 5 ms 21244 KB Output is correct
13 Correct 5 ms 21084 KB Output is correct
14 Correct 5 ms 21084 KB Output is correct
15 Correct 239 ms 56484 KB Output is correct
16 Correct 263 ms 56160 KB Output is correct
17 Correct 286 ms 56556 KB Output is correct
18 Correct 303 ms 58456 KB Output is correct
19 Correct 247 ms 58828 KB Output is correct
20 Correct 287 ms 61432 KB Output is correct
21 Correct 129 ms 51796 KB Output is correct
22 Correct 151 ms 51732 KB Output is correct
23 Correct 144 ms 51536 KB Output is correct
24 Correct 170 ms 54232 KB Output is correct
25 Correct 162 ms 57900 KB Output is correct
26 Correct 138 ms 51816 KB Output is correct
27 Correct 143 ms 51736 KB Output is correct
28 Correct 186 ms 51776 KB Output is correct
29 Correct 194 ms 53332 KB Output is correct
30 Correct 194 ms 55400 KB Output is correct
31 Correct 152 ms 51792 KB Output is correct
32 Correct 162 ms 51792 KB Output is correct
33 Correct 193 ms 51936 KB Output is correct
34 Correct 226 ms 54096 KB Output is correct
35 Correct 206 ms 57784 KB Output is correct
36 Correct 256 ms 54100 KB Output is correct