結果
問題 | No.2855 Move on Grid |
ユーザー | MMRZ |
提出日時 | 2024-08-25 15:32:18 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 611 ms / 3,000 ms |
コード長 | 3,045 bytes |
コンパイル時間 | 3,224 ms |
コンパイル使用メモリ | 257,776 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-08-25 15:32:39 |
合計ジャッジ時間 | 19,367 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 111 ms
6,816 KB |
testcase_01 | AC | 180 ms
6,944 KB |
testcase_02 | AC | 107 ms
6,940 KB |
testcase_03 | AC | 68 ms
6,944 KB |
testcase_04 | AC | 48 ms
6,940 KB |
testcase_05 | AC | 104 ms
6,940 KB |
testcase_06 | AC | 92 ms
6,944 KB |
testcase_07 | AC | 9 ms
6,944 KB |
testcase_08 | AC | 91 ms
6,940 KB |
testcase_09 | AC | 34 ms
6,944 KB |
testcase_10 | AC | 291 ms
6,940 KB |
testcase_11 | AC | 324 ms
6,940 KB |
testcase_12 | AC | 304 ms
6,940 KB |
testcase_13 | AC | 293 ms
6,940 KB |
testcase_14 | AC | 315 ms
6,940 KB |
testcase_15 | AC | 323 ms
6,940 KB |
testcase_16 | AC | 295 ms
6,940 KB |
testcase_17 | AC | 304 ms
6,944 KB |
testcase_18 | AC | 297 ms
6,940 KB |
testcase_19 | AC | 321 ms
6,940 KB |
testcase_20 | AC | 493 ms
6,944 KB |
testcase_21 | AC | 537 ms
6,944 KB |
testcase_22 | AC | 495 ms
6,940 KB |
testcase_23 | AC | 467 ms
6,944 KB |
testcase_24 | AC | 508 ms
6,940 KB |
testcase_25 | AC | 548 ms
6,940 KB |
testcase_26 | AC | 509 ms
6,944 KB |
testcase_27 | AC | 523 ms
6,940 KB |
testcase_28 | AC | 495 ms
6,944 KB |
testcase_29 | AC | 514 ms
6,944 KB |
testcase_30 | AC | 553 ms
6,940 KB |
testcase_31 | AC | 573 ms
6,944 KB |
testcase_32 | AC | 556 ms
6,944 KB |
testcase_33 | AC | 596 ms
6,940 KB |
testcase_34 | AC | 548 ms
6,944 KB |
testcase_35 | AC | 582 ms
6,944 KB |
testcase_36 | AC | 496 ms
6,940 KB |
testcase_37 | AC | 611 ms
6,940 KB |
testcase_38 | AC | 571 ms
6,940 KB |
testcase_39 | AC | 548 ms
6,940 KB |
ソースコード
# include <bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; const double pi = acos(-1); template<class T>constexpr T inf() { return ::std::numeric_limits<T>::max(); } template<class T>constexpr T hinf() { return inf<T>() / 2; } template <typename T_char>T_char TL(T_char cX) { return tolower(cX); } template <typename T_char>T_char TU(T_char cX) { return toupper(cX); } template<class T> bool chmin(T& a,T b) { if(a > b){a = b; return true;} return false; } template<class T> bool chmax(T& a,T b) { if(a < b){a = b; return true;} return false; } int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; } int d_sum(ll n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; } int d_cnt(ll n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; } ll gcd(ll a, ll b) { if (b == 0)return a; return gcd(b, a%b); }; ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g*b; }; ll MOD(ll x, ll m){return (x%m+m)%m; } ll FLOOR(ll x, ll m) {ll r = (x%m+m)%m; return (x-r)/m; } template<class T> using dijk = priority_queue<T, vector<T>, greater<T>>; # define all(qpqpq) (qpqpq).begin(),(qpqpq).end() # define UNIQUE(wpwpw) (wpwpw).erase(unique(all((wpwpw))),(wpwpw).end()) # define LOWER(epepe) transform(all((epepe)),(epepe).begin(),TL<char>) # define UPPER(rprpr) transform(all((rprpr)),(rprpr).begin(),TU<char>) # define rep(i,upupu) for(ll i = 0, i##_len = (upupu);(i) < (i##_len);(i)++) # define reps(i,opopo) for(ll i = 1, i##_len = (opopo);(i) <= (i##_len);(i)++) # define len(x) ((ll)(x).size()) # define bit(n) (1LL << (n)) # define pb push_back # define exists(c, e) ((c).find(e) != (c).end()) struct INIT{ INIT(){ std::ios::sync_with_stdio(false); std::cin.tie(0); cout << fixed << setprecision(20); } }INIT; namespace mmrz { void solve(); } int main(){ mmrz::solve(); } #define debug(...) (static_cast<void>(0)) using namespace mmrz; void SOLVE(){ int n, m, k; cin >> n >> m >> k; vector<vector<int>> a(n, vector(m, 0)); rep(i, n)rep(j, m){ cin >> a[i][j]; } auto within = [&](int y, int x) -> bool { return 0 <= y && y < n && 0 <= x && x < m; }; int dy[] = {1, 0, -1, 0}; int dx[] = {0, 1, 0, -1}; auto f = [&](int mid) -> bool { vector<vector<int>> dp(n, vector(m, hinf<int>())); dijk<pair<int, pair<int, int>>> q; dp[0][0] = (a[0][0]<mid); q.push({0, {0, 0}}); while(not q.empty()){ auto [dis, cur] = q.top(); auto [y, x] = cur; q.pop(); rep(dir, 4){ int ny = y+dy[dir]; int nx = x+dx[dir]; if(not within(ny, nx))continue; if(chmin(dp[ny][nx], dp[y][x]+(a[ny][nx]<mid))){ q.push({dp[ny][nx], {ny, nx}}); } } } debug(mid, dp); return dp[n-1][m-1] <= k; }; ll ng = 1e9+1, ok = 1; while(ng-ok > 1){ ll mid = (ng+ok) >> 1; (f(mid) ? ok : ng) = mid; } cout << ok << endl; } void mmrz::solve(){ int t = 1; //cin >> t; while(t--)SOLVE(); }