結果

問題 No.2366 登校
ユーザー rniyarniya
提出日時 2023-06-30 22:41:37
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 304 ms / 4,000 ms
コード長 2,583 bytes
コンパイル時間 2,330 ms
コンパイル使用メモリ 209,436 KB
最終ジャッジ日時 2025-02-15 04:17:53
ジャッジサーバーID
(参考情報)
judge4 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 25
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif
using namespace std;
typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
template <class T> istream& operator>>(istream& is, vector<T>& v) {
for (auto& x : v) is >> x;
return is;
}
template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
auto sep = "";
for (const auto& x : v) os << exchange(sep, " ") << x;
return os;
}
template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }
template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }
template <class T> void mkuni(vector<T>& v) {
sort(begin(v), end(v));
v.erase(unique(begin(v), end(v)), end(v));
}
template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }
const int MAX_N = 82;
int dp[MAX_N][MAX_N][MAX_N * 4];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N, M, K, T;
cin >> N >> M >> K >> T;
if (T >= (N - 1) + (M - 1)) {
cout << 0 << '\n';
return 0;
}
vector C(N, vector<int>(M, -1)), D(N, vector<int>(M, -1));
for (; K--;) {
int a, b, c, d;
cin >> a >> b >> c >> d;
a--, b--;
C[a][b] = c;
D[a][b] = d;
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
for (int k = 0; k < MAX_N * 4; k++) {
dp[i][j][k] = INF;
}
}
}
priority_queue<tuple<int, int, int, int>> pq;
dp[0][0][MAX_N * 2] = 0;
pq.emplace(0, 0, 0, MAX_N * 2);
while (not pq.empty()) {
auto [val, x, y, z] = pq.top();
pq.pop();
val *= -1;
if (dp[x][y][z] != val) continue;
if (C[x][y] != -1) {
int nz = max(0, z - C[x][y] + 1);
if (chmin(dp[x][y][nz], val + D[x][y])) pq.emplace(-dp[x][y][nz], x, y, nz);
}
for (int i = 0; i < 4; i++) {
int nx = x + dx[i], ny = y + dy[i];
if (nx < 0 or N <= nx or ny < 0 or M <= ny) continue;
if (z + 1 < MAX_N * 4 and chmin(dp[nx][ny][z + 1], val)) pq.emplace(-dp[nx][ny][z + 1], nx, ny, z + 1);
}
}
int ans = INF;
for (int k = 0; k <= MAX_N * 2 + T; k++) chmin(ans, dp[N - 1][M - 1][k]);
cout << (ans == INF ? -1 : ans) << '\n';
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0