oj.uz

Submission #1080977

# Submission time Handle Problem Language Result Execution time Memory
1080977 2024-08-29T16:35:25 Z raphaelp Text editor (CEOI24_editor) C++14
14 / 100
 3886 ms 21308 KB 
#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 - 1]});
        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 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 1 ms 604 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 73 ms 19268 KB Output is correct
5 Correct 110 ms 16472 KB Output is correct
6 Correct 21 ms 17752 KB Output is correct
7 Correct 251 ms 19028 KB Output is correct
8 Correct 3886 ms 20396 KB Output is correct
9 Correct 2358 ms 17304 KB Output is correct
10 Correct 2074 ms 17596 KB Output is correct
11 Correct 2452 ms 17136 KB Output is correct
12 Correct 1882 ms 20768 KB Output is correct
13 Correct 3197 ms 21228 KB Output is correct
14 Correct 850 ms 20620 KB Output is correct
15 Correct 110 ms 20236 KB Output is correct
16 Correct 164 ms 20560 KB Output is correct
17 Correct 1497 ms 21308 KB Output is correct
18 Correct 1483 ms 20800 KB Output is correct
19 Correct 2269 ms 21136 KB Output is correct
20 Correct 1325 ms 18572 KB Output is correct

Subtask #3
0.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Runtime error 1 ms 604 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #4
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 1 ms 604 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Runtime error 1 ms 604 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -