結果
問題 | No.2855 Move on Grid |
ユーザー |
![]() |
提出日時 | 2024-08-25 14:28:45 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 171 ms / 3,000 ms |
コード長 | 3,371 bytes |
コンパイル時間 | 1,837 ms |
コンパイル使用メモリ | 179,620 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-08-25 14:28:53 |
合計ジャッジ時間 | 7,599 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 40 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define CPP_STR(x) CPP_STR_I(x)#define CPP_CAT(x, y) CPP_CAT_I(x, y)#define CPP_STR_I(args...) #args#define CPP_CAT_I(x, y) x##y#define ASSERT(expr...) assert((expr))using i8 = int8_t;using u8 = uint8_t;using i16 = int16_t;using u16 = uint16_t;using i32 = int32_t;using u32 = uint32_t;using i64 = int64_t;using u64 = uint64_t;using f32 = float;using f64 = double;// }}}constexpr i64 INF = 1'010'000'000'000'000'017LL;constexpr i64 MOD = 998244353LL;constexpr f64 EPS = 1e-12;constexpr f64 PI = 3.14159265358979323846;#define M5 100007#define M9 1000000000#define F first#define S second// util {{{#define FOR(i, start, end) for (i64 i = (start), CPP_CAT(i, xxxx_end) = (end); i < CPP_CAT(i, xxxx_end); ++i)#define REP(i, n) FOR(i, 0, n)#define all(x) (x).begin(), (x).end()#define ll long long int#define VI vector<ll>#define VVI vector<VI>#define ISD true#define debug(x) \if (ISD) \cout << #x << ": " << x << endltemplate <typename T, typename U, typename Comp = less<>>bool chmax(T &xmax, const U &x, Comp comp = {}){if (comp(xmax, x)){xmax = x;return true;}return false;}template <typename T, typename U, typename Comp = less<>>bool chmin(T &xmin, const U &x, Comp comp = {}){if (comp(x, xmin)){xmin = x;return true;}return false;}int main(){int N, M, K;cin >> N >> M >> K;vector<vector<ll>> A(N, vector<ll>(M));REP(i, N){REP(j, M){cin >> A[i][j];}}ll l = 0;ll r = 1e9 + 1;while (r - l > 1){ll m = l + (r - l) / 2;auto AA = A;REP(i, N){REP(j, M){AA[i][j] = A[i][j] >= m ? 0 : 1;}}/* REP(i, N){REP(j, M){cout << AA[i][j] << " ";}cout << endl;}*/deque<pair<int, int>> q;q.push_front({0, 0});vector<vector<ll>> d(N, vector<ll>(M, INF));int dx[4] = {1, 0, -1, 0};int dy[4] = {0, 1, 0, -1};d[0][0] = AA[0][0];while (!q.empty()){auto t = q.front();q.pop_front();int cx = t.F;int cy = t.S;REP(k, 4){int nx = cx + dx[k];int ny = cy + dy[k];if (nx < 0 || nx >= N || ny < 0 || ny >= M){continue;}// cout << nx << " " << ny << endl;if (d[nx][ny] <= d[cx][cy] + AA[nx][ny]){continue;}d[nx][ny] = d[cx][cy] + AA[nx][ny];// cout << nx << " " << ny << endl;if (AA[nx][ny] == 1){q.push_back({nx, ny});}else{q.push_front({nx, ny});}}}if (d[N - 1][M - 1] <= K){l = m;}else{r = m;}}cout << l << endl;}