結果
問題 | No.2366 登校 |
ユーザー |
|
提出日時 | 2023-06-30 21:57:23 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 309 ms / 4,000 ms |
コード長 | 5,263 bytes |
コンパイル時間 | 2,182 ms |
コンパイル使用メモリ | 213,900 KB |
最終ジャッジ日時 | 2025-02-15 03:51:09 |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 25 |
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for (int i = 0; i < (n); i++) #define per(i, n) for (int i = (n)-1; i >= 0; i--) #define rep2(i, l, r) for (int i = (l); i < (r); i++) #define per2(i, l, r) for (int i = (r)-1; i >= (l); i--) #define each(e, v) for (auto &e : v) #define MM << " " << #define pb push_back #define eb emplace_back #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) #define sz(x) (int)x.size() using ll = long long; using pii = pair<int, int>; using pil = pair<int, ll>; using pli = pair<ll, int>; using pll = pair<ll, ll>; template <typename T> using minheap = priority_queue<T, vector<T>, greater<T>>; template <typename T> using maxheap = priority_queue<T>; template <typename T> bool chmax(T &x, const T &y) { return (x < y) ? (x = y, true) : false; } template <typename T> bool chmin(T &x, const T &y) { return (x > y) ? (x = y, true) : false; } template <typename T> int flg(T x, int i) { return (x >> i) & 1; } int pct(int x) { return __builtin_popcount(x); } int pct(ll x) { return __builtin_popcountll(x); } int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); } int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); } int botbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); } int botbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); } template <typename T> void print(const vector<T> &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' '); if (v.empty()) cout << '\n'; } template <typename T> void printn(const vector<T> &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << '\n'; } template <typename T> int lb(const vector<T> &v, T x) { return lower_bound(begin(v), end(v), x) - begin(v); } template <typename T> int ub(const vector<T> &v, T x) { return upper_bound(begin(v), end(v), x) - begin(v); } template <typename T> void rearrange(vector<T> &v) { sort(begin(v), end(v)); v.erase(unique(begin(v), end(v)), end(v)); } template <typename T> vector<int> id_sort(const vector<T> &v, bool greater = false) { int n = v.size(); vector<int> ret(n); iota(begin(ret), end(ret), 0); sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; }); return ret; } template <typename T> void reorder(vector<T> &a, const vector<int> &ord) { int n = a.size(); vector<T> b(n); for (int i = 0; i < n; i++) b[i] = a[ord[i]]; swap(a, b); } template <typename T> T floor(T x, T y) { assert(y != 0); if (y < 0) x = -x, y = -y; return (x >= 0 ? x / y : (x - y + 1) / y); } template <typename T> T ceil(T x, T y) { assert(y != 0); if (y < 0) x = -x, y = -y; return (x >= 0 ? (x + y - 1) / y : x / y); } template <typename S, typename T> pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) { return make_pair(p.first + q.first, p.second + q.second); } template <typename S, typename T> pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) { return make_pair(p.first - q.first, p.second - q.second); } template <typename S, typename T> istream &operator>>(istream &is, pair<S, T> &p) { S a; T b; is >> a >> b; p = make_pair(a, b); return is; } template <typename S, typename T> ostream &operator<<(ostream &os, const pair<S, T> &p) { return os << p.first << ' ' << p.second; } struct io_setup { io_setup() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); } } io_setup; constexpr int inf = (1 << 30) - 1; constexpr ll INF = (1LL << 60) - 1; // constexpr int MOD = 1000000007; constexpr int MOD = 998244353; void solve() { int N, M, K, T; cin >> N >> M >> K >> T; int L = N + M; vector<vector<vector<ll>>> d(N, vector<vector<ll>>(M, vector<ll>(2 * L + 1, INF))); d[0][0][L] = 0; vector<vector<ll>> C(N, vector<ll>(M, INF)), D = C; rep(i, K) { int x, y; cin >> x >> y; x--, y--; cin >> C[x][y] >> D[x][y]; } using P = pair<ll, tuple<int, int, ll>>; minheap<P> que; auto push = [&](int i, int j, int k) { que.emplace(d[i][j][k], make_tuple(i, j, k)); }; push(0, 0, L); vector<int> dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1}; auto IN = [&](int i, int j) { return 0 <= i && i < N && 0 <= j && j < M; }; while (!empty(que)) { ll t = que.top().first; auto [i, j, k] = que.top().second; que.pop(); if (d[i][j][k] < t) continue; // cout << i MM j MM k MM t << '\n'; if (C[i][j] != INF) { ll nk = max(0LL, k - C[i][j] + 1); if (chmin(d[i][j][nk], t + D[i][j])) push(i, j, nk); } rep(l, 4) { int ni = i + dx[l], nj = j + dy[l]; if (!IN(ni, nj)) continue; int nk = k + 1; if (nk > 2 * L) continue; if (chmin(d[ni][nj][nk], t)) push(ni, nj, nk); } } ll ans = INF; rep(i, L + 1) { if (i <= T) chmin(ans, d[N - 1][M - 1][L + i]); } cout << (ans == INF ? -1 : ans) << '\n'; } int main() { int T = 1; // cin >> T; while (T--) solve(); }