oj.uz

Submission #1084660

# Submission time Handle Problem Language Result Execution time Memory
1084660 2024-09-06T16:04:15 Z SulA Text editor (CEOI24_editor) C++17
19 / 100
 83 ms 41016 KB 
#include <bits/stdc++.h>
using namespace std;

void subtask_2(int n) {
    pair<int,int> start, end;
    cin >> start.first >> start.second >> end.first >> end.second;

    int l[n+1]; for (int i = 1; i <= n; i++) {
        cin >> l[i];
        l[i]++;
    }

    int dist[n+1][5002];
    bool vis[n+1][5002] = {};
    queue<pair<int,int>> q;
    q.push(start);
    vis[start.first][start.second] = true;
    dist[start.first][start.second] = 0;

    auto visit = [&](int to_x, int to_y, int from_x, int from_y) {
        if (!vis[to_x][to_y]) {
            dist[to_x][to_y] = dist[from_x][from_y] + 1;
            vis[to_x][to_y] = true;
            q.emplace(to_x, to_y);
        }
    };

    while (!q.empty()) {
        auto [x, y] = q.front();
        q.pop();

        // left
        if (x != 1 || y != 1) {
            int l_x, l_y;
            if (y == 1) {
                l_x = x - 1;
                l_y = l[x - 1];
            } else {
                l_x = x;
                l_y = y - 1;
            }
            visit(l_x, l_y, x, y);
        }

        // right
        if (x != n || y != 1) {
            int r_x, r_y;
            if (y == l[x]) {
                r_x = x + 1;
                r_y = 1;
            } else {
                r_x = x;
                r_y = y + 1;
            }
            visit(r_x, r_y, x, y);
        }

        // up
        if (x != 1) {
            visit(x - 1, min(y, l[x - 1]), x, y);
        }

        // down
        if (x != n) {
            visit(x + 1, min(y, l[x + 1]), x, y);
        }
    }
    cout << dist[end.first][end.second];
}

#define int long long
int find_dist(int s, int e, int len) {
    return min({
       (s - e + len) % len,
       (e - s + len) % len
    });
}

void subtask_1() {
    int s_row, s_col, e_row, e_col, l;
    cin >> s_row >> s_col >> e_row >> e_col >> l;
    l++;

    if (e_row == 2) { // end is row 2
        cout << (s_row == 1 ? 1 : 0);
    } else if (s_row == 1) { // both on row 1
        cout << min({
            find_dist(s_col, e_col, l),
            2 + find_dist(1, e_col, l),
            2 + find_dist(l, e_col, l)
        });
    } else {
        cout << 1 + min({
            find_dist(1, e_col, l),
            find_dist(l, e_col, l)
        });
    }
#undef int
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n; cin >> n;
    if (n == 2) subtask_1();
    else if (n <= 1000) subtask_2(n);
    else cout << rand();
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 25 ms 23644 KB Output is correct
5 Correct 28 ms 20316 KB Output is correct
6 Correct 12 ms 22216 KB Output is correct
7 Correct 36 ms 23388 KB Output is correct
8 Correct 76 ms 24920 KB Output is correct
9 Correct 55 ms 20416 KB Output is correct
10 Correct 83 ms 20828 KB Output is correct
11 Correct 61 ms 20312 KB Output is correct
12 Correct 72 ms 25084 KB Output is correct
13 Correct 64 ms 24920 KB Output is correct
14 Correct 66 ms 24920 KB Output is correct
15 Correct 51 ms 24924 KB Output is correct
16 Correct 53 ms 24924 KB Output is correct
17 Correct 54 ms 24920 KB Output is correct
18 Correct 39 ms 24924 KB Output is correct
19 Correct 33 ms 24920 KB Output is correct
20 Correct 62 ms 22568 KB Output is correct

Subtask #3
0.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 25 ms 23644 KB Output is correct
12 Correct 28 ms 20316 KB Output is correct
13 Correct 12 ms 22216 KB Output is correct
14 Correct 36 ms 23388 KB Output is correct
15 Correct 76 ms 24920 KB Output is correct
16 Correct 55 ms 20416 KB Output is correct
17 Correct 83 ms 20828 KB Output is correct
18 Correct 61 ms 20312 KB Output is correct
19 Correct 72 ms 25084 KB Output is correct
20 Correct 64 ms 24920 KB Output is correct
21 Correct 66 ms 24920 KB Output is correct
22 Correct 51 ms 24924 KB Output is correct
23 Correct 53 ms 24924 KB Output is correct
24 Correct 54 ms 24920 KB Output is correct
25 Correct 39 ms 24924 KB Output is correct
26 Correct 33 ms 24920 KB Output is correct
27 Correct 62 ms 22568 KB Output is correct
28 Runtime error 25 ms 41016 KB Execution killed with signal 11
29 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 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 25 ms 23644 KB Output is correct
10 Correct 28 ms 20316 KB Output is correct
11 Correct 12 ms 22216 KB Output is correct
12 Correct 36 ms 23388 KB Output is correct
13 Correct 76 ms 24920 KB Output is correct
14 Runtime error 25 ms 41016 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -

Subtask #5
0.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 25 ms 23644 KB Output is correct
12 Correct 28 ms 20316 KB Output is correct
13 Correct 12 ms 22216 KB Output is correct
14 Correct 36 ms 23388 KB Output is correct
15 Correct 76 ms 24920 KB Output is correct
16 Correct 55 ms 20416 KB Output is correct
17 Correct 83 ms 20828 KB Output is correct
18 Correct 61 ms 20312 KB Output is correct
19 Correct 72 ms 25084 KB Output is correct
20 Correct 64 ms 24920 KB Output is correct
21 Correct 66 ms 24920 KB Output is correct
22 Correct 51 ms 24924 KB Output is correct
23 Correct 53 ms 24924 KB Output is correct
24 Correct 54 ms 24920 KB Output is correct
25 Correct 39 ms 24924 KB Output is correct
26 Correct 33 ms 24920 KB Output is correct
27 Correct 62 ms 22568 KB Output is correct
28 Runtime error 25 ms 41016 KB Execution killed with signal 11
29 Halted 0 ms 0 KB -