oj.uz

답안 #1029807

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1029807 2024-07-21T10:53:55 Z ihne Airplane (NOI23_airplane) C++17
63 / 100
 107 ms 21332 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pii pair<int,int>
#define pb push_back
const int mn=2e5+5;
const int mod=1e9+7;
int a[mn];
pii dp[mn];
vector<int> g[mn];
signed main(){
  //freopen("","r",stdin);
  //freopen("","w",stdout);
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n,m;
  cin>>n>>m;
  int ans=1e18;
  for (int i=1;i<=n;i++){
    cin>>a[i];
    dp[i]={1e18,1e18};
  }
  for (int i=1;i<=m;i++){
    int u,v;
    cin>>u>>v;
    g[u].pb(v);
    g[v].pb(u);
  }
  dp[1]={0,0};
  priority_queue<pair<pii,int>,vector<pair<pii,int>>,greater<pair<pii,int>>> pq;
  pq.push({{0,0},1});
  while (!pq.empty()){
    int lb=pq.top().fi.fi-pq.top().fi.se;
    int ub=pq.top().fi.se;
    int id=pq.top().se;
    pq.pop();
    pii cur={lb+ub,ub};
    if (dp[id]!=cur) continue;
    for (int v:g[id]){
      if (v==n) ans=min(ans,ub+max(lb,1ll));
      else{
        if (a[v]>ub){
          int l=a[v];
          int r=a[v];
          if (l+r<dp[v].fi){
            dp[v]={l+r,r};
            pq.push({{l+r,r},v});
          }
        }
        else{
          int l=max(a[v],lb-1);
          int r=ub+1;
          if (l+r<dp[v].fi){
            dp[v]={l+r,r};
            pq.push({{l+r,r},v});
          }
        }
      }
    }
  }
  cout<<ans;
}

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4952 KB Output is correct
2 Correct 45 ms 19280 KB Output is correct
3 Correct 47 ms 19540 KB Output is correct
4 Correct 49 ms 19796 KB Output is correct
5 Correct 51 ms 20328 KB Output is correct
6 Correct 51 ms 20232 KB Output is correct
7 Correct 49 ms 20304 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 2 ms 4956 KB Output is correct
6 Correct 5 ms 5488 KB Output is correct
7 Correct 3 ms 5296 KB Output is correct
8 Correct 3 ms 5244 KB Output is correct
9 Correct 3 ms 5212 KB Output is correct
10 Correct 3 ms 5212 KB Output is correct
11 Correct 3 ms 5212 KB Output is correct
12 Correct 3 ms 5212 KB Output is correct
13 Correct 3 ms 5464 KB Output is correct
14 Correct 3 ms 5212 KB Output is correct
15 Correct 4 ms 5436 KB Output is correct
16 Correct 3 ms 5212 KB Output is correct
17 Correct 3 ms 5212 KB Output is correct
18 Correct 3 ms 4956 KB Output is correct

Subtask #3
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 2 ms 4956 KB Output is correct
6 Correct 5 ms 5488 KB Output is correct
7 Correct 3 ms 5296 KB Output is correct
8 Correct 3 ms 5244 KB Output is correct
9 Correct 3 ms 5212 KB Output is correct
10 Correct 3 ms 5212 KB Output is correct
11 Correct 3 ms 5212 KB Output is correct
12 Correct 3 ms 5212 KB Output is correct
13 Correct 3 ms 5464 KB Output is correct
14 Correct 3 ms 5212 KB Output is correct
15 Correct 4 ms 5436 KB Output is correct
16 Correct 3 ms 5212 KB Output is correct
17 Correct 3 ms 5212 KB Output is correct
18 Correct 3 ms 4956 KB Output is correct
19 Correct 3 ms 5212 KB Output is correct
20 Correct 3 ms 5212 KB Output is correct
21 Correct 3 ms 5212 KB Output is correct
22 Correct 3 ms 5212 KB Output is correct
23 Correct 3 ms 5212 KB Output is correct
24 Correct 3 ms 5212 KB Output is correct
25 Correct 3 ms 5212 KB Output is correct
26 Correct 3 ms 5176 KB Output is correct
27 Correct 3 ms 5212 KB Output is correct
28 Correct 3 ms 5212 KB Output is correct
29 Correct 3 ms 5212 KB Output is correct
30 Correct 3 ms 5212 KB Output is correct

Subtask #4
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4952 KB Output is correct
2 Correct 45 ms 19280 KB Output is correct
3 Correct 47 ms 19540 KB Output is correct
4 Correct 49 ms 19796 KB Output is correct
5 Correct 51 ms 20328 KB Output is correct
6 Correct 51 ms 20232 KB Output is correct
7 Correct 49 ms 20304 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 2 ms 4956 KB Output is correct
12 Correct 2 ms 4956 KB Output is correct
13 Correct 2 ms 4956 KB Output is correct
14 Correct 5 ms 5488 KB Output is correct
15 Correct 3 ms 5296 KB Output is correct
16 Correct 3 ms 5244 KB Output is correct
17 Correct 3 ms 5212 KB Output is correct
18 Correct 3 ms 5212 KB Output is correct
19 Correct 3 ms 5212 KB Output is correct
20 Correct 3 ms 5212 KB Output is correct
21 Correct 3 ms 5464 KB Output is correct
22 Correct 3 ms 5212 KB Output is correct
23 Correct 4 ms 5436 KB Output is correct
24 Correct 3 ms 5212 KB Output is correct
25 Correct 3 ms 5212 KB Output is correct
26 Correct 3 ms 4956 KB Output is correct
27 Correct 3 ms 5212 KB Output is correct
28 Correct 3 ms 5212 KB Output is correct
29 Correct 3 ms 5212 KB Output is correct
30 Correct 3 ms 5212 KB Output is correct
31 Correct 3 ms 5212 KB Output is correct
32 Correct 3 ms 5212 KB Output is correct
33 Correct 3 ms 5212 KB Output is correct
34 Correct 3 ms 5176 KB Output is correct
35 Correct 3 ms 5212 KB Output is correct
36 Correct 3 ms 5212 KB Output is correct
37 Correct 3 ms 5212 KB Output is correct
38 Correct 3 ms 5212 KB Output is correct
39 Correct 107 ms 21332 KB Output is correct
40 Correct 93 ms 21016 KB Output is correct
41 Correct 100 ms 20844 KB Output is correct
42 Correct 86 ms 20572 KB Output is correct
43 Correct 85 ms 20724 KB Output is correct
44 Correct 87 ms 20784 KB Output is correct
45 Correct 84 ms 20308 KB Output is correct
46 Correct 82 ms 20564 KB Output is correct
47 Correct 92 ms 20564 KB Output is correct
48 Correct 87 ms 20568 KB Output is correct
49 Incorrect 107 ms 21332 KB Output isn't correct
50 Halted 0 ms 0 KB -