oj.uz

Submission #381227

# Submission time Handle Problem Language Result Execution time Memory
381227 2021-03-24T19:50:18 Z fishy15 Soccer (JOI17_soccer) C++17
100 / 100
 537 ms 23388 KB 
#include <iostream>
#include <iomanip>
#include <fstream>
#include <vector>
#include <array>
#include <algorithm>
#include <utility>
#include <map>
#include <queue>
#include <set>
#include <cmath>
#include <cstdio>
#include <cstring>

#define ll long long
#define ld long double
#define eps 1e-8
#define MOD 1000000007

#define INF 0x3f3f3f3f
#define INFLL 0x3f3f3f3f3f3f3f3f

// change if necessary
#define MAXN 100010
#define MAXW 510

using namespace std;

int h, w;
ll a, b, c;
int n;
array<int, 2> players[MAXN];
priority_queue<array<ll, 4>, vector<array<ll, 4>>, greater<array<ll, 4>>> pq; // {dist, x, y, dir}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, -1, 0, 1};

bool walk_set[MAXW][MAXW];
ll walk_dist[MAXW][MAXW];

// 0-3 refer to dir kicked from, corresponds to directions above
// 5 is min cost while keeping the ball
ll dist[MAXW][MAXW][5];

bool ok(int x, int y, int dir, ll d) {
    return x >= 0 && y >= 0 && x < h && y < w && d < dist[x][y][dir];
}

bool ok_walk(int x, int y) {
    return x >= 0 && y >= 0 && x < h && y < w && !walk_set[x][y];
}

void set_dist(ll d, int x, int y, int dir) {
    if (dist[x][y][dir] < d) return;
    if (dir < 4) {
        int nx = x + dx[dir];
        int ny = y + dy[dir];

        // continue the kick
        if (ok(nx, ny, dir, d + a)) {
            dist[nx][ny][dir] = d + a;
            pq.push({d + a, nx, ny, dir});
        }

        // get picked up by person
        if (ok(x, y, 4, d + walk_dist[x][y])) {
            dist[x][y][4] = d + walk_dist[x][y];
            pq.push({d + walk_dist[x][y], x, y, 4});
        }
    } else {
        // walk to adjacent square
        for (int i = 0; i < 4; i++) {
            int nx = x + dx[i];
            int ny = y + dy[i];
            if (ok(nx, ny, 4, d + c)) {
                dist[nx][ny][4] = d + c;
                pq.push({d + c, nx, ny, 4});
            }
        }

        // kick in some direction
        for (int i = 0; i < 4; i++) {
            if (ok(x, y, i, d + b)) {
                dist[x][y][i] = d + b;
                pq.push({d + b, x, y, i});
            }
        }
    }
}

void calc_walk() {
    queue<array<int, 2>> q;
    for (int i = 0; i < n; i++) {
        auto [x, y] = players[i];
        walk_set[x][y] = true;
        q.push({x, y});
    }

    while (!q.empty()) {
        auto [x, y] = q.front();
        q.pop();
        for (int i = 0; i < 4; i++) {
            int nx = x + dx[i];
            int ny = y + dy[i];
            if (ok_walk(nx, ny)) {
                walk_dist[nx][ny] = walk_dist[x][y] + c;
                walk_set[nx][ny] = true;
                q.push({nx, ny});
            }
        }
    }
}

void calc_dist() {
    pq.push({0, players[0][0], players[0][1], 4});
    memset(dist, 0x3f, sizeof dist);
    dist[players[0][0]][players[0][1]][4] = 0;
    while (!pq.empty()) {
        auto [d, x, y, dir] = pq.top();
        pq.pop();
        set_dist(d, x, y, dir);
    }
}

int main() {
    cin.tie(0)->sync_with_stdio(0);

    cin >> h >> w;
    cin >> a >> b >> c;
    cin >> n;

    h++; w++;
    for (int i = 0; i < n; i++) {
        int s, t; cin >> s >> t;
        players[i] = {s, t};
    }

    calc_walk();

    calc_dist();

    cout << dist[players[n - 1][0]][players[n - 1][1]][4] << '\n';

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 14056 KB Output is correct
2 Correct 6 ms 10604 KB Output is correct
3 Correct 358 ms 21084 KB Output is correct
4 Correct 372 ms 21240 KB Output is correct
5 Correct 94 ms 12268 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 440 ms 21220 KB Output is correct
2 Correct 419 ms 21224 KB Output is correct
3 Correct 309 ms 20704 KB Output is correct
4 Correct 292 ms 21084 KB Output is correct
5 Correct 325 ms 21224 KB Output is correct
6 Correct 324 ms 21216 KB Output is correct
7 Correct 420 ms 21228 KB Output is correct
8 Correct 367 ms 21208 KB Output is correct
9 Correct 443 ms 21204 KB Output is correct
10 Correct 68 ms 15256 KB Output is correct
11 Correct 416 ms 21208 KB Output is correct
12 Correct 443 ms 21204 KB Output is correct
13 Correct 236 ms 20704 KB Output is correct
14 Correct 431 ms 21204 KB Output is correct
15 Correct 331 ms 21204 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 14056 KB Output is correct
2 Correct 6 ms 10604 KB Output is correct
3 Correct 358 ms 21084 KB Output is correct
4 Correct 372 ms 21240 KB Output is correct
5 Correct 94 ms 12268 KB Output is correct
6 Correct 440 ms 21220 KB Output is correct
7 Correct 419 ms 21224 KB Output is correct
8 Correct 309 ms 20704 KB Output is correct
9 Correct 292 ms 21084 KB Output is correct
10 Correct 325 ms 21224 KB Output is correct
11 Correct 324 ms 21216 KB Output is correct
12 Correct 420 ms 21228 KB Output is correct
13 Correct 367 ms 21208 KB Output is correct
14 Correct 443 ms 21204 KB Output is correct
15 Correct 68 ms 15256 KB Output is correct
16 Correct 416 ms 21208 KB Output is correct
17 Correct 443 ms 21204 KB Output is correct
18 Correct 236 ms 20704 KB Output is correct
19 Correct 431 ms 21204 KB Output is correct
20 Correct 331 ms 21204 KB Output is correct
21 Correct 99 ms 12532 KB Output is correct
22 Correct 499 ms 21232 KB Output is correct
23 Correct 464 ms 16860 KB Output is correct
24 Correct 537 ms 16988 KB Output is correct
25 Correct 416 ms 21216 KB Output is correct
26 Correct 466 ms 21460 KB Output is correct
27 Correct 315 ms 14744 KB Output is correct
28 Correct 299 ms 15428 KB Output is correct
29 Correct 416 ms 18952 KB Output is correct
30 Correct 242 ms 14800 KB Output is correct
31 Correct 419 ms 21208 KB Output is correct
32 Correct 521 ms 23388 KB Output is correct
33 Correct 323 ms 21236 KB Output is correct
34 Correct 529 ms 21204 KB Output is correct
35 Correct 247 ms 15340 KB Output is correct