제출 #1173411

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1173411		somefolk	Airplane (NOI23_airplane)	C++20	0 / 100	29 ms	3776 KiB

Main

#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <complex>
#include <list>
#include <cassert>
#include <chrono>
#include <random>
#include <stack>
#include <iomanip>
#include <fstream>
using namespace std;

#define endl "\n"
// #define int long long

const int INF = 1e9+7;
const int MOD = 1e9+7;

struct E{
    int u, v;
};

void solve(){
    int n, m;
    cin >> n >> m;
    int mx = 0;
    vector<int> a(n);
    for(int i = 0; i < n; i++){
        cin >> a[i];
        mx = max(mx, a[i]);
    }
    vector<E> edges(m);
    for(int i = 0; i < m; i++){
        cin >> edges[i].u >> edges[i].v;
    }

    int sol = 0, curr = 0;
    for(int i = 1; i < n; i++){
        if(a[i] > curr){
            sol += (a[i] - curr);
            curr = a[i];
            if(curr == mx){
                int idx = 0;
                vector<int> h;
                for(int j = i+1; j < n; j++){
                    if(j == i+1){
                        h.push_back(j);
                    } else {
                        if(a[i] > h[idx]){
                            h[idx] = j;
                        } else {
                            h.push_back(j);
                            idx++;
                        }
                    }
                }
                for(auto &i : h){
                    sol += i;
                }
                break;
            }
        } else {
            if(curr < mx){
                curr++;
                sol++;
            } else {
                int idx = 0;
                vector<int> h;
                for(int j = i+1; j < n; j++){
                    if(j == i+1){
                        h.push_back(j);
                    } else {
                        if(a[i] > h[idx]){
                            h[idx] = j;
                        } else {
                            h.push_back(j);
                            idx++;
                        }
                    }
                }
                for(auto &i : h){
                    sol += i;
                }
                break;
            }
        }
    }

    cout << sol << endl;
}

int32_t main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    while(t--) solve();
    return 0;
}

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