oj.uz

답안 #1066252

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1066252 2024-08-19T17:02:26 Z sammyuri Soccer (JOI17_soccer) C++17
35 / 100
 2573 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
ll dist[505][505];
ll dist_2[505][505];
ll a, b, c;

ll calc_cost(ll dx, ll dy) {
    ll best = (dx + dy) * c;
    best = min(best, dx * c + b + dy * a);
    best = min(best, dy * c + b + dx * a);
    return best;
}

int main() {
    memset(dist, -1, sizeof(dist));
    int h, w; cin >> h >> w;
    h ++; w ++;
    cin >> a >> b >> c;
    vector<pair<int, int>> players;
    int n; cin >> n;
    int starti, startj, endi, endj;
    for (int i = 0; i < n; i ++) {
        int s, t; cin >> s >> t;
        players.push_back({s, t});
        if (i == 0)
            starti = s, startj = t;
        else if (i == n - 1)
            endi = s, endj = t;
    }
    // multisource bfs
    queue<pair<int, int>> q;
    for (auto a : players) {
        dist[a.first][a.second] = 0;
        q.push(a);
    }
    while (q.size()) {
        pair<int, int> cur = q.front(); q.pop();
        int curdist = dist[cur.first][cur.second];
        if (cur.first > 0 && dist[cur.first - 1][cur.second] == -1) {
            q.push({cur.first - 1, cur.second});
            dist[cur.first - 1][cur.second] = curdist + 1;
        }
        if (cur.first < h - 1 && dist[cur.first + 1][cur.second] == -1) {
            q.push({cur.first + 1, cur.second});
            dist[cur.first + 1][cur.second] = curdist + 1;
        }
        if (cur.second > 0 && dist[cur.first][cur.second - 1] == -1) {
            q.push({cur.first, cur.second - 1});
            dist[cur.first][cur.second - 1] = curdist + 1;
        }
        if (cur.second < w - 1 && dist[cur.first][cur.second + 1] == -1) {
            q.push({cur.first, cur.second + 1});
            dist[cur.first][cur.second + 1] = curdist + 1;
        }
    }
    // calculate answer
    priority_queue<pair<ll, pair<int, int>>> pq;
    for (int i = 0; i < h; i ++)
        for (int j = 0; j < w; j ++) {
            // initial distance
            ll curdist = calc_cost(abs(i - starti), abs(j - startj));
            curdist += dist[i][j] * c;
            curdist = min(curdist, abs(i - starti) * c + abs(j - startj) * c);
            dist_2[i][j] = curdist;
            pq.push({-curdist, {i, j}});
        }
    ll best = 1e18;
    while (pq.size()) {
        auto cur = pq.top(); pq.pop();
        ll curdist = -cur.first;
        int i = cur.second.first, j = cur.second.second;
        if (dist_2[i][j] != curdist)
            continue;
        // send straight to finish
        // cout << curdist << " " << i << " " << j << endl;
        best = min(best, curdist + calc_cost(abs(i - endi), abs(j - endj)));
        for (int ii = 0; ii < h; ii ++) {
            ll newdist = curdist + calc_cost(abs(ii - i), 0) + dist[ii][j] * c;
            newdist = min(newdist, curdist + abs(ii - i) * c);
            if (dist_2[ii][j] > newdist) {
                dist_2[ii][j] = newdist;
                pq.push({-newdist, {ii, j}});
            }
        }
        for (int jj = 0; jj < w; jj ++) {
            ll newdist = curdist + calc_cost(abs(jj - j), 0) + dist[i][jj] * c;
            newdist = min(newdist, curdist + abs(jj - j) * c);
            if (dist_2[i][jj] > newdist) {
                dist_2[i][jj] = newdist;
                pq.push({-newdist, {i, jj}});
            }
        }
    }
    cout << best << endl;
    return 0;
}

Compilation message

soccer.cpp: In function 'int main()':
soccer.cpp:78:67: warning: 'endj' may be used uninitialized in this function [-Wmaybe-uninitialized]
   78 |         best = min(best, curdist + calc_cost(abs(i - endi), abs(j - endj)));
      |                                                                 ~~^~~~~~
soccer.cpp:78:52: warning: 'endi' may be used uninitialized in this function [-Wmaybe-uninitialized]
   78 |         best = min(best, curdist + calc_cost(abs(i - endi), abs(j - endj)));
      |                                                  ~~^~~~~~
soccer.cpp:23:17: warning: 'startj' may be used uninitialized in this function [-Wmaybe-uninitialized]
   23 |     int starti, startj, endi, endj;
      |                 ^~~~~~
soccer.cpp:23:9: warning: 'starti' may be used uninitialized in this function [-Wmaybe-uninitialized]
   23 |     int starti, startj, endi, endj;
      |         ^~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 274 ms 21952 KB Output is correct
2 Correct 1 ms 4184 KB Output is correct
3 Correct 1907 ms 70032 KB Output is correct
4 Correct 1640 ms 69984 KB Output is correct
5 Correct 225 ms 6608 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1161 ms 22192 KB Output is correct
2 Correct 1161 ms 21932 KB Output is correct
3 Correct 836 ms 13252 KB Output is correct
4 Correct 1016 ms 14280 KB Output is correct
5 Correct 824 ms 13000 KB Output is correct
6 Correct 1036 ms 14024 KB Output is correct
7 Correct 1132 ms 22024 KB Output is correct
8 Correct 1104 ms 21696 KB Output is correct
9 Correct 1114 ms 21752 KB Output is correct
10 Correct 111 ms 6608 KB Output is correct
11 Correct 1105 ms 21748 KB Output is correct
12 Correct 1127 ms 22448 KB Output is correct
13 Correct 746 ms 14536 KB Output is correct
14 Correct 1107 ms 22528 KB Output is correct
15 Correct 814 ms 14280 KB Output is correct

Subtask #3
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 274 ms 21952 KB Output is correct
2 Correct 1 ms 4184 KB Output is correct
3 Correct 1907 ms 70032 KB Output is correct
4 Correct 1640 ms 69984 KB Output is correct
5 Correct 225 ms 6608 KB Output is correct
6 Correct 1161 ms 22192 KB Output is correct
7 Correct 1161 ms 21932 KB Output is correct
8 Correct 836 ms 13252 KB Output is correct
9 Correct 1016 ms 14280 KB Output is correct
10 Correct 824 ms 13000 KB Output is correct
11 Correct 1036 ms 14024 KB Output is correct
12 Correct 1132 ms 22024 KB Output is correct
13 Correct 1104 ms 21696 KB Output is correct
14 Correct 1114 ms 21752 KB Output is correct
15 Correct 111 ms 6608 KB Output is correct
16 Correct 1105 ms 21748 KB Output is correct
17 Correct 1127 ms 22448 KB Output is correct
18 Correct 746 ms 14536 KB Output is correct
19 Correct 1107 ms 22528 KB Output is correct
20 Correct 814 ms 14280 KB Output is correct
21 Correct 221 ms 6608 KB Output is correct
22 Correct 1518 ms 37288 KB Output is correct
23 Correct 1116 ms 21428 KB Output is correct
24 Correct 1262 ms 21948 KB Output is correct
25 Correct 1211 ms 22708 KB Output is correct
26 Correct 1250 ms 21424 KB Output is correct
27 Correct 992 ms 11212 KB Output is correct
28 Correct 1186 ms 25224 KB Output is correct
29 Correct 2573 ms 138632 KB Output is correct
30 Runtime error 892 ms 262144 KB Execution killed with signal 9
31 Halted 0 ms 0 KB -