제출 #1358777

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1358777		bakhtiyarn	Airplane (NOI23_airplane)	C++20	32 / 100	1012 ms	16056 KiB

Main

#include "bits/stdc++.h"
using namespace std;
#define int long long

const int N = 3e5+5;
int a[N];
vector<int> g[N];
int n, m; 

vector<int> DIJ(int u){
    vector<int> dis(n+1, 1e18);
    priority_queue<array<int, 2>> q;
    q.push({0, u});
    dis[u] = 0;

    while(!q.empty()){
        auto [d, u] = q.top();
        q.pop();
        if(dis[u] != d) continue;
        for(int to: g[u]){
            int nd = max(a[to], d+1);
            if(nd > dis[to]) continue;
            dis[to] = nd;
            q.push({nd, to});
        }
    }
    return dis;
}

void solve(){
    cin >> n >> m;
    for(int i=1; i<=n; i++) cin >> a[i];
    for(int i=1; i<=m; i++) {
        int x, y; cin >> x >> y;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    vector<int> d1 = DIJ(1);
    vector<int> dn = DIJ(n);

    int ans = 1e18;
    for(int i=1; i<=n; i++) {
        ans = min(ans, 2 * max(d1[i], dn[i]));
        for(int to: g[i]){
            ans = min(ans, 2 * max(d1[i], dn[to]) + 1);
            ans = min(ans, 2 * max(d1[to], dn[i]) + 1);
        }
    }

    cout << ans << '\n';
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    solve();
}

• 서브태스크 1: 22 / 22
• 서브태스크 2: 10 / 10
• 서브태스크 3: 0 / 31
• 서브태스크 4: 0 / 37