제출 #1080972

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1080972		raphaelp	Text editor (CEOI24_editor)	C++14	0 / 100	1 ms	496 KiB

Main

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int N;
    cin >> N;
    int debx, deby, finx, finy;
    cin >> debx >> deby >> finx >> finy;
    debx--, deby--, finx--, finy--;
    vector<int> Tab(N);
    for (int i = 0; i < N; i++)
        cin >> Tab[i];
    vector<vector<int>> occ(N, vector<int>(5001));
    priority_queue<vector<int>> PQ;
    PQ.push({0, debx, deby});
    while (!PQ.empty())
    {
        int x = PQ.top()[1], y = PQ.top()[2], t = PQ.top()[0];
        PQ.pop();
        if (occ[x][y])
            continue;
        occ[x][y] = 1;
        if (x == finx && y == finy)
        {
            cout << -t;
            return 0;
        }
        if (y > 0)
            PQ.push({t - 1, x, y - 1});
        if (y < Tab[x])
            PQ.push({t - 1, x, y + 1});
        if (x > 0 && y == 0)
            PQ.push({t - 1, x - 1, Tab[x]});
        if (x < N - 1 && y == Tab[x])
            PQ.push({t - 1, x + 1, 0});
        if (x < N - 1)
            PQ.push({t - 1, x + 1, min(y, Tab[x + 1])});
        if (x > 0)
            PQ.push({t - 1, x - 1, min(y, Tab[x - 1])});
    }
}

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