제출 #1195225

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1195225		Turkhuu	Text editor (CEOI24_editor)	C++20	56 / 100	892 ms	1114112 KiB

Main

#include <bits/stdc++.h>
#define FOR(i, a, b) for (auto i = (a); i <= (b); i++)
#define ROF(i, a, b) for (auto i = (a); i >= (b); i--)
using namespace std;
using ll = long long;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n; ll sx, sy, tx, ty;
    cin >> n >> sx >> sy >> tx >> ty;
    sx--, sy--, tx--, ty--;
    vector<ll> a(n);
    for (auto& x : a) cin >> x;
    auto s = a;
    s.push_back(sy);
    s.push_back(ty);
    sort(s.begin(), s.end());
    s.erase(unique(s.begin(), s.end()), s.end());
    int m = s.size();
    map<ll, int> id;
    FOR(i, 0, m - 1) id[s[i]] = i;
    vector dis(n, vector<ll>(m, 1e18));
    priority_queue<array<ll, 3>, vector<array<ll, 3>>, greater<array<ll, 3>>> pq;
    for (pq.push({dis[sx][id[sy]] = 0, sx, id[sy]}); !pq.empty(); pq.pop()) {
        auto [d, x, _y] = pq.top();
        if (d != dis[x][_y]) continue;
        ll y = s[_y];
        vector<array<ll, 3>> moves;
        if (x) {
            moves.push_back({x - 1, id[min(a[x - 1], y)], 1});
            moves.push_back({x - 1, id[a[x - 1]], y + 1});
        }
        if (x + 1 < n) {
            moves.push_back({x + 1, id[min(a[x + 1], y)], 1});
            moves.push_back({x + 1, id[0], a[x] - y + 1});
        }
        for (auto [u, v, w] : moves) if (d + w < dis[u][v]) pq.push({dis[u][v] = d + w, u, v});
    }
    ll ans = 1e18;
    FOR(i, 0, m - 1) ans = min(ans, dis[tx][i] + abs(s[i] - ty));
    cout << ans << "\n";
    return 6/22;
} 

• Subtask 0: 0 / 0
• Subtask 1: 5 / 5
• Subtask 2: 14 / 14
• Subtask 3: 26 / 26
• Subtask 4: 11 / 11
• Subtask 5: 0 / 44