Submission #1306799

#	Time	Username	Problem	Language	Result	Execution time	Memory
1306799		Tymond	Soccer (JOI17_soccer)	C++20	100 / 100	199 ms	16088 KiB

soccer

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

struct pair_hash{
  size_t operator()(const pair<int,int>&x)const{
    return hash<long long>()(((long long)x.first)^(((long long)x.second)<<32));
  }
};

int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
const int MAXN = 507;
const int MAXM = 1e5 + 7;
const ll INF = 1e18;
ll d[MAXN][MAXN];
ll dist[MAXN][MAXN][3];
pii points[MAXM];
ll A, B, C;
int n, h, w;


bool check(int nx, int ny){
    return (min(nx, ny) >= 0 && nx <= h && ny <= w);
}

void bfs(){
    queue<pii> q;
    for(int i = 1; i <= n; i++){
        q.push(points[i]);
    }

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

        for(int z = 0; z < 4; z++){
            int nx = x + dx[z];
            int ny = y + dy[z];
            if(check(nx, ny) && d[nx][ny] > d[x][y] + 1){
                d[nx][ny] = d[x][y] + 1;
                q.push(mp(nx, ny));
            }
        }
    }
}

void tryAdding(int nx, int ny, int nz, ll ndist, priority_queue<pair<ll, pair<pii, int>>>& pq){
    if(!check(nx, ny) || dist[nx][ny][nz] <= ndist){
        return;
    }

    dist[nx][ny][nz] = ndist;
    pq.push(mp(-ndist, mp(mp(nx, ny), nz)));
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

    cin >> h >> w;
    cin >> A >> B >> C;
    cin >> n;
    for(int i = 0; i <= h; i++){
        for(int j = 0; j <= w; j++){
            d[i][j] = INF;
            for(int z = 0; z < 3; z++){
                dist[i][j][z] = INF;
            }
        }
    }

    for(int i = 1; i <= n; i++){
        int x, y;
        cin >> x >> y;

        points[i] = mp(x, y);
        d[x][y] = 0LL;
    }

    bfs();

    dist[points[1].fi][points[1].se][0] = 0LL;
    priority_queue<pair<ll, pair<pii, int>>> pq;
    pq.push(mp(0LL, mp(points[1], 0)));

    while(sz(pq)){
        pair<ll, pair<pii, int>> curr = pq.top();
        pq.pop();

        curr.fi = -curr.fi;
        int x = curr.se.fi.fi;
        int y = curr.se.fi.se;
        int z = curr.se.se;
        ll D = curr.fi;
        if(D != dist[x][y][z]){
            continue;
        }

        if(z == 0){
            tryAdding(x, y, 1, D + B, pq);
            tryAdding(x, y, 2, D + B, pq);

            for(int l = 0; l < 4; l++){
                tryAdding(x + dx[l], y + dy[l], 0, D + C, pq);
            }
        }else if(z == 1){
            tryAdding(x, y, 0, (ll)D + d[x][y] * C, pq);

            tryAdding(x + 1, y, 1, D + A, pq);
            tryAdding(x - 1, y, 1, D + A, pq);
        }else{
            tryAdding(x, y, 0, (ll)D + d[x][y] * C, pq);

            tryAdding(x, y + 1, 2, D + A, pq);
            tryAdding(x, y - 1, 2, D + A, pq);
        }
    }

    ll ans = INF;
    for(int j = 0; j <= 2; j++){
        ans = min(ans, dist[points[n].fi][points[n].se][j]);
    }
    cout << ans << '\n';

    return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 30 / 30
• Subtask 3: 65 / 65