oj.uz

답안 #1102768

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1102768 2024-10-18T19:44:40 Z ttamx Airplane (NOI23_airplane) C++17
22 / 100
 68 ms 15204 KB 
#include<bits/stdc++.h>
 
using namespace std;
 
using ll = long long;

const int N=2e5+5;
const int INF=INT_MAX/2;

int n,m;
int a[N];
vector<pair<int,int>> edges;
vector<int> adj[N];
int dist1[N],dist2[N];
int ans=INF;

void dijkstra(int st,int *dist){
    priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;
    for(int i=1;i<=n;i++)dist[i]=INF;
    dist[st]=0;
    pq.emplace(0,st);
    while(!pq.empty()){
        auto [d,u]=pq.top();
        pq.pop();
        if(d>dist[u])continue;
        for(auto v:adj[u]){
            int nd=max(d+1,a[v]);
            if(nd<dist[v]){
                dist[v]=nd;
                pq.emplace(nd,v);
            }
        }
    }
}

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n >> m;
    for(int i=1;i<=n;i++){
        cin >> a[i];
    }
    edges.resize(m);
    for(auto &[u,v]:edges){
        cin >> u >> v;
        adj[u].emplace_back(v);
        adj[v].emplace_back(u);
    }
    dijkstra(1,dist1);
    dijkstra(n,dist2);
    for(int i=1;i<=n;i++){
        ans=min(ans,max(dist1[i],dist2[i])*2);
    }
    for(auto [u,v]:edges){
        ans=min(ans,max(dist1[u],dist2[v])*2+1);
    }
    cout << ans;
}

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6480 KB Output is correct
2 Correct 50 ms 15124 KB Output is correct
3 Correct 50 ms 15084 KB Output is correct
4 Correct 51 ms 15176 KB Output is correct
5 Correct 53 ms 15176 KB Output is correct
6 Correct 52 ms 15176 KB Output is correct
7 Correct 68 ms 15204 KB Output is correct
8 Correct 2 ms 6480 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6648 KB Output is correct
2 Correct 1 ms 6480 KB Output is correct
3 Incorrect 2 ms 6480 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6648 KB Output is correct
2 Correct 1 ms 6480 KB Output is correct
3 Incorrect 2 ms 6480 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6480 KB Output is correct
2 Correct 50 ms 15124 KB Output is correct
3 Correct 50 ms 15084 KB Output is correct
4 Correct 51 ms 15176 KB Output is correct
5 Correct 53 ms 15176 KB Output is correct
6 Correct 52 ms 15176 KB Output is correct
7 Correct 68 ms 15204 KB Output is correct
8 Correct 2 ms 6480 KB Output is correct
9 Correct 1 ms 6648 KB Output is correct
10 Correct 1 ms 6480 KB Output is correct
11 Incorrect 2 ms 6480 KB Output isn't correct
12 Halted 0 ms 0 KB -