oj.uz

Submission #361255

# Submission time Handle Problem Language Result Execution time Memory
361255 2021-01-29T00:48:25 Z jainbot27 Soccer (JOI17_soccer) C++17
100 / 100
 535 ms 21980 KB 
#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
// 217
// 44
 
using namespace std;
 
const ll INF = 1e18;
vector < vector <ll> > dst_c;
 
int dl[] = {-1, 0, 1, 0}, dc[] = {0, -1, 0, 1};
 
vector <int> x, y;
int h, w, A, B, C, n;
 
inline bool in(int l, int c) {
    return l >= 0 && c >= 0 && l <= h && c <= w;
}
 
inline void bfs() {
    queue < pair <int, int> > Q;
 
    dst_c.resize(h + 1, vector <ll>(w + 1, INF));
 
    for(int i = 1; i < n; i++) {
        dst_c[x[i]][y[i]] = 0;
        Q.push({x[i], y[i]});
    }
 
    while(Q.size()) {
        auto cur = Q.front();
        Q.pop();
 
        for(int i = 0; i < 4; i++) {
            int l = cur.first + dl[i];
            int c = cur.second + dc[i];
 
            if(in(l, c) && dst_c[l][c] == INF) {
                dst_c[l][c] = dst_c[cur.first][cur.second] + C;
                Q.push({l, c});
            }
        }
 
    }
}
 
struct Data {
    int l, c, t;
    ll cst;
 
    bool operator <(const Data &other) const {
        return cst > other.cst;
    }
};
 
const int MAXH = 500;
 
ll dst[MAXH + 1][MAXH + 1][5];
bool vis[MAXH + 1][MAXH + 1][5];
 
int main() {
    //ifstream cin("A.in");
    //ofstream cout("A.out");
    int i, j;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
 
    cin >> h >> w >> A >> B >> C >> n;
 
    x.resize(n + 1), y.resize(n + 1);
    for(i = 1; i <= n; i++) {
        cin >> x[i] >> y[i];
    }
 
    bfs();
 
    priority_queue <Data> pq;
 
    for(i = 0; i <= h; i++) {
        for(j = 0; j <= w; j++) {
            for(int d = 0; d < 5; d++) {
                dst[i][j][d] = INF;
            }
        }
    }
 
    pq.push({x[1], y[1], 4, 0});
    dst[x[1]][y[1]][4] = 0;
 
    while(pq.size()) {
        auto cur = pq.top();
        pq.pop();
 
        if(vis[cur.l][cur.c][cur.t]) {
            continue;
        }
 
        vis[cur.l][cur.c][cur.t] = 1;
 
        if(cur.t != 4) {
            ll cst = cur.cst + B;
 
            if(cur.l != x[n] || cur.c != y[n]) {
                cst += dst_c[cur.l][cur.c];
            }
 
            if(dst[cur.l][cur.c][4] > cst) {
                dst[cur.l][cur.c][4] = cst;
                pq.push({cur.l, cur.c, 4, cst});
            }
        }
 
        if(cur.t == 4) {
            for(i = 0; i < 4; i++) {
                int l = cur.l + dl[i], c = cur.c + dc[i];
 
                if(in(l, c) && dst[l][c][4] > cur.cst + C) {
                    dst[l][c][4] = cur.cst + C;
                    pq.push({l, c, 4, dst[l][c][4]});
                }
 
                if(in(l, c) && dst[l][c][i] > cur.cst + A) {
                    dst[l][c][i] = cur.cst + A;
                    pq.push({l, c, i, dst[l][c][i]});
                }
            }
        }
        else {
            int l = cur.l + dl[cur.t], c = cur.c + dc[cur.t];
 
            if(in(l, c) && dst[l][c][cur.t] > cur.cst + A) {
                dst[l][c][cur.t] = cur.cst + A;
                pq.push({l, c, cur.t, dst[l][c][cur.t]});
            }
        }
    }
 
    cout << dst[x[n]][y[n]][4];
 
    //cin.close();
    //cout.close();
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 6888 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 360 ms 19700 KB Output is correct
4 Correct 359 ms 19680 KB Output is correct
5 Correct 57 ms 7020 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 397 ms 19688 KB Output is correct
2 Correct 394 ms 19852 KB Output is correct
3 Correct 276 ms 17120 KB Output is correct
4 Correct 285 ms 19680 KB Output is correct
5 Correct 295 ms 19316 KB Output is correct
6 Correct 315 ms 19680 KB Output is correct
7 Correct 401 ms 19852 KB Output is correct
8 Correct 372 ms 19864 KB Output is correct
9 Correct 386 ms 19852 KB Output is correct
10 Correct 47 ms 7292 KB Output is correct
11 Correct 403 ms 19852 KB Output is correct
12 Correct 403 ms 19700 KB Output is correct
13 Correct 239 ms 17120 KB Output is correct
14 Correct 393 ms 19852 KB Output is correct
15 Correct 311 ms 19468 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 6888 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 360 ms 19700 KB Output is correct
4 Correct 359 ms 19680 KB Output is correct
5 Correct 57 ms 7020 KB Output is correct
6 Correct 397 ms 19688 KB Output is correct
7 Correct 394 ms 19852 KB Output is correct
8 Correct 276 ms 17120 KB Output is correct
9 Correct 285 ms 19680 KB Output is correct
10 Correct 295 ms 19316 KB Output is correct
11 Correct 315 ms 19680 KB Output is correct
12 Correct 401 ms 19852 KB Output is correct
13 Correct 372 ms 19864 KB Output is correct
14 Correct 386 ms 19852 KB Output is correct
15 Correct 47 ms 7292 KB Output is correct
16 Correct 403 ms 19852 KB Output is correct
17 Correct 403 ms 19700 KB Output is correct
18 Correct 239 ms 17120 KB Output is correct
19 Correct 393 ms 19852 KB Output is correct
20 Correct 311 ms 19468 KB Output is correct
21 Correct 68 ms 7404 KB Output is correct
22 Correct 505 ms 19744 KB Output is correct
23 Correct 470 ms 15384 KB Output is correct
24 Correct 501 ms 16672 KB Output is correct
25 Correct 475 ms 19684 KB Output is correct
26 Correct 439 ms 19868 KB Output is correct
27 Correct 189 ms 15388 KB Output is correct
28 Correct 219 ms 15968 KB Output is correct
29 Correct 400 ms 18504 KB Output is correct
30 Correct 200 ms 15980 KB Output is correct
31 Correct 433 ms 19852 KB Output is correct
32 Correct 535 ms 21980 KB Output is correct
33 Correct 345 ms 19680 KB Output is correct
34 Correct 530 ms 19816 KB Output is correct
35 Correct 186 ms 15240 KB Output is correct