oj.uz

Submission #598510

# Submission time Handle Problem Language Result Execution time Memory
598510 2022-07-18T12:38:45 Z AGE Transport (COCI19_transport) C++14
26 / 130
 532 ms 38192 KB 
#include<bits/stdc++.h>
#define F first
#define S second
#define int long long
#define pb push_back

using namespace std;
const int N=2e5+10,M=2e3,mod=1e9+7;
int cost[N],seg[N*4],ans[N];
vector<pair<int,int>>adj[N];
map<pair<int,int>,int>mp;

void dfs(int node,int par){

    for(auto x:adj[node]){

        if(x.F==par)
            continue;

        ans[x.F]=ans[node]+cost[node]-mp[{node,x.F}];
        if(ans[x.F]<0)
            continue;

        dfs(x.F,node);

    }

}

void build(int v,int tl,int tr){

    if(tl==tr){
        seg[v]=ans[tl];
        return ;
    }

    int tm=(tl+tr)/2;

    build(v*2,tl,tm);
    build(v*2+1,tm+1,tr);

    seg[v]=min(seg[v*2],seg[v*2+1]);

}

int get(int v,int tl,int tr,int l,int r){

    if(tl>r||tr<l){
        return 1e18;
    }

    if(tl>=l&&tr<=r)
        return seg[v];

    int tm=(tl+tr)/2;

    return min(get(v*2,tl,tm,l,r),get(v*2+1,tm+1,tr,l,r));

}

int n;
bool ok(int mid,int val,int start){

    if(start+mid-1>n)
        return 0;

    int ans1=get(1,1,n,start,start+mid-1);
    return ans1>=val;

}
main()
{
    int n;
    cin>>n;
        for(int i=1;i<=n;i++)
            cin>>cost[i];

        for(int i=0;i<n-1;i++){
            int x,y,z;
            cin>>x>>y>>z;

            adj[x].pb({y,z});
            adj[y].pb({x,z});
            mp[{x,y}]=z;
            mp[{y,x}]=z;

        }

    if(n<=5000){
        int anss=0;

        for(int i=1;i<=n;i++){

            for(int j=1;j<=n;j++)
                ans[j]=-1e18;

            ans[i]=0;
            dfs(i,0);


            for(int j=1;j<=n;j++)
                if(ans[j]!=1e18&&ans[j]>=0&&i!=j)
                    anss++;

        }

        cout<<anss<<endl;
    }


    else{
       ans[0]=0;

    for(int i=1;i<=n;i++){
        ans[i+1]=ans[i]+cost[i]-mp[{i,i+1}];
    }

    build(1,1,n);
    int anss=0;

    for(int i=1;i<=n;i++){

        int val=ans[i];
        int l=0,r=n+1;

        while(l<r){

            int mid=(l+r+1)/2;
            if(ok(mid,val,i))
                l=mid;
            else
                r=mid-1;

        }

        anss+=l-1;

    }

    reverse(cost+1,cost+n+1);

    ans[0]=0;

    for(int i=1;i<=n;i++){
        ans[i+1]=ans[i]+cost[i]-mp[{n-i+1,n-i}];
    }

    build(1,1,n);

    for(int i=1;i<=n;i++){

        int val=ans[i];
        int l=0,r=n+1;

        while(l<r){

            int mid=(l+r+1)/2;
            if(ok(mid,val,i))
                l=mid;
            else
                r=mid-1;

        }

        anss+=l-1;

    }

    cout<<anss<<endl;
    }
    return 0;
}

Compilation message

transport.cpp:71:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   71 | main()
      | ^~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 212 ms 5588 KB Output is correct
2 Correct 124 ms 5784 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 532 ms 6296 KB Output is correct
2 Correct 47 ms 5920 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 74 ms 14004 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 109 ms 17320 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 185 ms 22208 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 72 ms 14080 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 117 ms 20376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 212 ms 25312 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 255 ms 31844 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 312 ms 38192 KB Output isn't correct
2 Halted 0 ms 0 KB -