Submission #1182096

#	Time	Username	Problem	Language	Result	Execution time	Memory
1182096		asli_bg	Airplane (NOI23_airplane)	C++20	22 / 100	63 ms	41032 KiB

Main

#include<bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;

#define int long long

typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
typedef vector<bool> vb;

#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)

#define all(x) x.begin(),x.end()
#define fi first
#define se second
#define pb push_back
#define sp <<" "<<

#define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl;
#define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;

#define DEBUG(x) cout<<#x sp x<<endl;
#define carp(x,y) ((x%MOD)*(y%MOD))%MOD
#define topla(x,y) ((x%MOD)+(y%MOD))%MOD
#define mid (l+r)/2

const int MAXN=1e6+5;
const int MOD=1e9+7;
const int INF=1e18;

int n,m;
vi a;
vi adj[MAXN];

int artir[MAXN];
int cur[MAXN];

int d[MAXN];
int ans[MAXN];

pii tut[MAXN];

void dij(int bas){
    set<pii> s;
    s.insert({0,bas});
    FORE(i,1,n+1){
        d[i]=INF;
        artir[i]=0;
        cur[i]=0;
    }
    d[bas]=0;

    while(!s.empty()){
        auto el=*s.begin();
        s.erase(el);

        int nd=el.se;

        for(auto kom:adj[nd]){
            int cost=1;
            if(a[kom]>cur[nd]){
                cost=max(cost,a[kom]-cur[nd]-artir[nd]);
            }

            if(d[kom]>d[nd]+cost){
                if(d[kom]!=INF) s.erase({d[kom],kom});
                d[kom]=d[nd]+cost;
                if(a[kom]>cur[nd]){
                    cur[kom]=a[kom];
                }
                else{
                    cur[kom]=cur[nd];
                    artir[kom]=artir[nd]+1;
                }
                s.insert({d[kom],kom});
            }
        }
    }

    FORE(i,1,n+1){
        if(bas==1) tut[i]={cur[i],artir[i]};
        else{
            if(tut[i].fi!=cur[i]){
                if(tut[i].fi>cur[i]){
                    if(artir[i]<tut[i].fi-cur[i]){
                        d[i]+=tut[i].fi-cur[i]-artir[i];
                    }
                }
                else{
                    if(tut[i].se<cur[i]-tut[i].fi){
                        d[i]+=cur[i]-tut[i].fi-tut[i].se;
                    }
                }
            }
        }
        ans[i]+=d[i];
    }
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    
    cin>>n>>m;
    a.resize(n+1);
    FORE(i,1,n+1) cin>>a[i];
    FOR(i,m){
        int u,v;
        cin>>u>>v;
        adj[u].pb(v);
        adj[v].pb(u);
    }

    dij(1);
    dij(n);

    int res=INF;
    FORE(i,1,n+1) res=min(res,ans[i]);

    cout<<res<<endl;
}   

• Subtask 1: 22 / 22
• Subtask 2: 0 / 10
• Subtask 3: 0 / 31
• Subtask 4: 0 / 37