oj.uz

Submission #1073195

# Submission time Handle Problem Language Result Execution time Memory
1073195 2024-08-24T10:13:40 Z _callmelucian Soccer (JOI17_soccer) C++14
100 / 100
 728 ms 46524 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pl;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tt;

#define all(a) a.begin(), a.end()
#define filter(a) a.erase(unique(all(a)), a.end())

const int mn = 1e5 + 5;
bool vis[505][505], visit[505][505][2][4];
int x[mn], y[mn], closest[505][505];
ll dist[505][505][2][4];
int n, m, A, B, C;

const int dr[4] = {-1, 0, 0, 1};
const int dc[4] = {0, -1, 1, 0};

bool ok (int i, int j) {
    if (i < 0 || j < 0) return 0;
    if (i > n || j > m) return 0;
    return 1;
}

int mahattan (int i, int j, int u, int v) {
    return abs(i - u) + abs(j - v);
}

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

    cin >> n >> m >> A >> B >> C;
    for (int i = 0; i <= n; i++)
        for (int j = 0; j <= m; j++) closest[i][j] = INT_MAX;

    int k; cin >> k;
    queue<pii> q;
    for (int i = 1; i <= k; i++) {
        cin >> x[i] >> y[i];
        closest[x[i]][y[i]] = 0;
        q.emplace(x[i], y[i]);
    }

    while (q.size()) {
        int i, j; tie(i, j) = q.front(); q.pop();
        if (vis[i][j]) continue;
        vis[i][j] = 1;
        for (int way = 0; way < 4; way++) {
            int i2 = i + dr[way], j2 = j + dc[way];
            if (ok(i2, j2) && closest[i][j] + 1 < closest[i2][j2]) {
                closest[i2][j2] = closest[i][j] + 1;
                q.emplace(i2, j2);
            }
        }
    }

    priority_queue<tuple<ll,int,int,int,int>> pq; pq.emplace(0, x[1], y[1], 0, 0);
    for (int i = 0; i <= n; i++)
        for (int j = 0; j <= m; j++)
            for (int kick = 0; kick < 2; kick++)
                for (int way = 0; way < 4; way++) dist[i][j][kick][way] = LLONG_MAX;
    dist[x[1]][y[1]][0][0] = 0;

    ll ans = LLONG_MAX;
    while (pq.size()) {
        ll ndst; int i, j, kick, way; tie(ndst, i, j, kick, way) = pq.top(); pq.pop();
        if (visit[i][j][kick][way]) continue;
        visit[i][j][kick][way] = 1;

        ans = min(ans, dist[i][j][kick][way] + 1LL * C * mahattan(i, j, x[k], y[k]));

        if (kick) {
            // switch to walk mode
            if (dist[i][j][1][way] + 1LL * C * closest[i][j] < dist[i][j][0][way]) {
                dist[i][j][0][way] = dist[i][j][1][way] + 1LL * C * closest[i][j];
                pq.emplace(-dist[i][j][0][way], i, j, 0, way);
            }

            // extend the kick
            int i2 = i + dr[way], j2 = j + dc[way];
            if (ok(i2, j2) && dist[i][j][1][way] + A < dist[i2][j2][1][way]) {
                dist[i2][j2][1][way] = dist[i][j][1][way] + A;
                pq.emplace(-dist[i2][j2][1][way], i2, j2, 1, way);
            }
        }

        else {
            // switch to kick mode
            if (dist[i][j][0][way] + B < dist[i][j][1][way]) {
                dist[i][j][1][way] = dist[i][j][0][way] + B;
                pq.emplace(-dist[i][j][1][way], i, j, 1, way);
            }

            // rotate
            int nway = (way + 1) % 4;
            if (dist[i][j][0][way] < dist[i][j][0][nway]) {
                dist[i][j][0][nway] = dist[i][j][0][way];
                pq.emplace(-dist[i][j][0][nway], i, j, 0, nway);
            }

            // extend the walk
            int i2 = i + dr[way], j2 = j + dc[way];
            if (ok(i2, j2) && dist[i][j][0][way] + C < dist[i2][j2][0][way]) {
                dist[i2][j2][0][way] = dist[i][j][0][way] + C;
                pq.emplace(-dist[i2][j2][0][way], i2, j2, 0, way);
            }
        }
    }
    cout << ans;

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 10440 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 445 ms 25800 KB Output is correct
4 Correct 493 ms 31892 KB Output is correct
5 Correct 109 ms 9808 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 585 ms 44112 KB Output is correct
2 Correct 598 ms 44476 KB Output is correct
3 Correct 426 ms 28092 KB Output is correct
4 Correct 426 ms 25792 KB Output is correct
5 Correct 432 ms 30648 KB Output is correct
6 Correct 477 ms 31920 KB Output is correct
7 Correct 645 ms 44332 KB Output is correct
8 Correct 524 ms 44248 KB Output is correct
9 Correct 659 ms 44244 KB Output is correct
10 Correct 79 ms 11484 KB Output is correct
11 Correct 628 ms 44240 KB Output is correct
12 Correct 624 ms 44340 KB Output is correct
13 Correct 370 ms 28040 KB Output is correct
14 Correct 705 ms 44292 KB Output is correct
15 Correct 506 ms 42936 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 10440 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 445 ms 25800 KB Output is correct
4 Correct 493 ms 31892 KB Output is correct
5 Correct 109 ms 9808 KB Output is correct
6 Correct 585 ms 44112 KB Output is correct
7 Correct 598 ms 44476 KB Output is correct
8 Correct 426 ms 28092 KB Output is correct
9 Correct 426 ms 25792 KB Output is correct
10 Correct 432 ms 30648 KB Output is correct
11 Correct 477 ms 31920 KB Output is correct
12 Correct 645 ms 44332 KB Output is correct
13 Correct 524 ms 44248 KB Output is correct
14 Correct 659 ms 44244 KB Output is correct
15 Correct 79 ms 11484 KB Output is correct
16 Correct 628 ms 44240 KB Output is correct
17 Correct 624 ms 44340 KB Output is correct
18 Correct 370 ms 28040 KB Output is correct
19 Correct 705 ms 44292 KB Output is correct
20 Correct 506 ms 42936 KB Output is correct
21 Correct 109 ms 9684 KB Output is correct
22 Correct 633 ms 31932 KB Output is correct
23 Correct 609 ms 29964 KB Output is correct
24 Correct 692 ms 32024 KB Output is correct
25 Correct 547 ms 31932 KB Output is correct
26 Correct 577 ms 25852 KB Output is correct
27 Correct 322 ms 21468 KB Output is correct
28 Correct 344 ms 22096 KB Output is correct
29 Correct 495 ms 24764 KB Output is correct
30 Correct 270 ms 21844 KB Output is correct
31 Correct 631 ms 44240 KB Output is correct
32 Correct 728 ms 46524 KB Output is correct
33 Correct 452 ms 31920 KB Output is correct
34 Correct 719 ms 44240 KB Output is correct
35 Correct 273 ms 21840 KB Output is correct