Submission #111997

#TimeUsernameProblemLanguageResultExecution timeMemory
111997qkxwsmSoccer (JOI17_soccer)C++14
30 / 100
3017 ms70392 KiB
//clever #pragma GCC optimize ("O3") #pragma GCC target ("sse4") #include <bits/stdc++.h> #include <ext/pb_ds/tree_policy.hpp> #include <ext/pb_ds/assoc_container.hpp> #include <ext/rope> using namespace std; using namespace __gnu_pbds; using namespace __gnu_cxx; random_device(rd); mt19937 rng(rd()); const long long FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); struct custom_hash { template<class T> unsigned long long operator()(T v) const { unsigned long long x = v; x += FIXED_RANDOM; // x += 11400714819323198485ull; // x = (x ^ (x >> 30)) * 13787848793156543929ull; x = (x ^ (x >> 27)) * 10723151780598845931ull; return x ^ (x >> 31); } }; template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; template<class T, class U> using hash_table = gp_hash_table<T, U, custom_hash>; template<class T> T randomize(T mod) { return (uniform_int_distribution<T>(0, mod - 1))(rng); } template<class T> void readi(T &x) { x = 0; bool negative = false; char c = ' '; while (c < '-') { c = getchar(); } if (c == '-') { negative = true; c = getchar(); } while (c >= '0') { x = x * 10 + (c - '0'); c = getchar(); } if (negative) { x = -x; } } template<class T> void printi(T output) { if (output == 0) { putchar('0'); return; } if (output < 0) { putchar('-'); output = -output; } int buf[20], n = 0; while(output) { buf[n] = ((output % 10)); output /= 10; n++; } for (n--; n >= 0; n--) { putchar(buf[n] + '0'); } return; } template<class T> void ckmin(T &a, T b) { a = min(a, b); } template<class T> void ckmax(T &a, T b) { a = max(a, b); } long long expo(long long a, long long e, long long mod) { return ((e == 0) ? 1 : ((expo(a * a % mod, e >> 1, mod)) * ((e & 1) ? a : 1) % mod)); } template<class T, class U> void nmod(T &x, U mod) { if (x >= mod) x -= mod; } template<class T> T gcd(T a, T b) { return (b ? gcd(b, a % b) : a); } #define y0 ___y0 #define y1 ___y1 #define MP make_pair #define PB push_back #define LB lower_bound #define UB upper_bound #define fi first #define se second #define DBG(x) cerr << #x << " = " << (x) << endl #define SZ(x) ((int) ((x).size())) #define FOR(i, a, b) for (auto i = (a); i < (b); i++) #define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--) #define ALL(x) (x).begin(), (x).end() const long double PI = 4.0 * atan(1.0); const long double EPS = 1e-9; #define MAGIC 347 #define SINF 10007 #define CO 1000007 #define INF 1000000007 #define BIG 1000000931 #define LARGE 1696969696967ll #define GIANT 2564008813937411ll #define LLINF 2696969696969696969ll #define MAXN 513 typedef long long ll; typedef long double ld; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<ld, ld> pdd; typedef vector<int> vi; typedef vector<ll> vl; typedef vector<ld> vd; typedef vector<pii> vpi; typedef vector<pll> vpl; typedef vector<pdd> vpd; typedef pair<ll, pii> plp; int H, W, N; ll A, B, C; pii coor[100013]; ll dp[MAXN][MAXN]; ll clo[MAXN][MAXN]; int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, -1, 0, 1}; priority_queue<plp, vector<plp>, greater<plp> > pq; bool valid(int x, int y) { return (0 <= x && x < H && 0 <= y && y < W); } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); // cout << fixed << setprecision(10); // cerr << fixed << setprecision(10); // if (fopen("file.in", "r")) // { // freopen ("file.in", "r", stdin); // freopen ("file.out", "w", stdout); // } cin >> H >> W >> A >> B >> C >> N; H++; W++; FOR(i, 0, N) { cin >> coor[i].fi >> coor[i].se; } if (C <= A) { cout << 1ll * (abs(coor[0].fi - coor[N - 1].fi) + abs(coor[0].se - coor[N - 1].se)) * C << '\n'; return 0; } FOR(i, 0, H) { FOR(j, 0, W) { dp[i][j] = LLINF; clo[i][j] = LLINF; } } queue<plp> q; FOR(i, 0, N) { clo[coor[i].fi][coor[i].se] = 0; q.push({0ll, coor[i]}); } while(!q.empty()) { ll d = q.front().fi; int x = q.front().se.fi, y = q.front().se.se; // cerr << d << ' ' << x << ' ' << y << endl; q.pop(); if (d != clo[x][y]) continue; FOR(k, 0, 4) { if (valid(x + dx[k], y + dy[k]) && d + 1 < clo[x + dx[k]][y + dy[k]]) { clo[x + dx[k]][y + dy[k]] = d + 1; q.push({d + 1, {x + dx[k], y + dy[k]}}); } } } // FOR(i, 0, H) // { // FOR(j, 0, W) // { // cerr << clo[i][j] << ' '; // } // cerr << endl; // } dp[coor[0].fi][coor[0].se] = 0; pq.push({0, coor[0]}); while(!pq.empty()) { ll d = pq.top().fi; int x = pq.top().se.fi, y = pq.top().se.se; // cerr << d << ' ' << x << ' ' << y << endl; pq.pop(); if (d != dp[x][y]) continue; FOR(j, 0, W) { ll nd = d + min(A * abs(y - j) + B + clo[x][j] * C, C * abs(y - j)); if (nd < dp[x][j]) { dp[x][j] = nd; pq.push({nd, {x, j}}); } } FOR(i, 0, H) { ll nd = d + min(A * abs(x - i) + B + clo[i][y] * C, C * abs(x - i)); if (nd < dp[i][y]) { dp[i][y] = nd; pq.push({nd, {i, y}}); } } } cout << dp[coor[N - 1].fi][coor[N - 1].se] << '\n'; //dp[x][y] is minimum cost to get to (x, y) with a ball! // cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl; return 0; } /* READ READ READ * int overflow, maxn too small, special cases (n=1?, two distinct?), cin.tie() interactive * reread the problem, try small cases * note down possible sources of error as you go * do smth instead of nothing */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...