oj.uz

답안 #1112975

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1112975 2024-11-15T10:30:32 Z Aviansh Airplane (NOI23_airplane) C++17
0 / 100
 10 ms 1104 KB 
#include <bits/stdc++.h>

using namespace std;
int n,m;
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m;
    int a[n];
    for(int &i : a){
        cin >> i;
    }
    int mx = 0;
    for(int i = 0;i<n;i++){
        if(a[i]>=a[mx]){
            mx=i;
        }
    }
    int fmx = 0;
    for(int i = 0;i<n;i++){
        if(a[mx]==a[i]){
            fmx=i;
            break;
        }
    }
    long long ans1 = a[mx]*2;
    ans1+=n-1;
    ans1-=fmx;
    ans1-=(n-mx-1);
    cout << ans1;
    return 0;
    vector<int>g[n];
    for(int i = 0;i<m;i++){
        int a,b;
        cin >> a >> b;
        a--;b--;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    set<array<int,4>>pq;
    pq.insert({0,0,0,0});
    //time,current height, place, downbool
    set<array<int,3>>vis;
    //height,place,downbool
    set<int>vis1;
    long long ans = 0;
    while(!pq.empty()){
        array<int,4>cur = *(pq.begin());
        //cout << cur[0] << " " << cur[1] << " " << cur[2] << " " << cur[3] << "\n";
        pq.erase(pq.begin());
        if(vis.find({cur[1],cur[2],cur[3]})!=vis.end()){
            continue;
        }
        vis.insert({cur[1],cur[2],cur[3]});
        vis1.insert(cur[2]);
        if(cur[2]==n-1){
            pq.insert({cur[0]+cur[1],0,cur[2],1});
            if(cur[1]==0){
                ans=cur[0];
                break;
            }
        }
        for(int i : g[cur[2]]){
            if(vis1.find(i)!=vis1.end()){
                continue;
            }
            vis1.insert(i);
            if(cur[3]){
                if(a[i]<=cur[1]-1){
                    pq.insert({cur[0]+1,cur[1]-1,i,1});
                }
                else if(a[i]<=cur[1]){
                    pq.insert({cur[0]+1,cur[1],i,1});
                }
            }
            else{
                if(a[i]>cur[1]){
                    pq.insert({a[i]-cur[1]+cur[0],a[i],i,0});
                }
                else{
                    pq.insert({cur[0]+1,cur[1]+1,i,0});
                }
                if(a[i]<=cur[1]-1){
                    pq.insert({cur[0]+1,cur[1]-1,i,1});
                }
                else if(a[i]<=cur[1]){
                    pq.insert({cur[0]+1,cur[1],i,1});
                }
            }
        }
    }
    cout << ans;
    return 0;
}

Subtask #1
0 / 22.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 31.0

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

Subtask #4
0 / 37.0

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