結果

問題 No.2855 Move on Grid
ユーザー siganaisiganai
提出日時 2024-08-25 13:50:11
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 109 ms / 3,000 ms
コード長 5,459 bytes
コンパイル時間 2,355 ms
コンパイル使用メモリ 213,376 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-08-25 13:50:19
合計ジャッジ時間 6,596 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 26 ms
6,816 KB
testcase_01 AC 34 ms
6,944 KB
testcase_02 AC 21 ms
6,940 KB
testcase_03 AC 16 ms
6,940 KB
testcase_04 AC 12 ms
6,940 KB
testcase_05 AC 26 ms
6,940 KB
testcase_06 AC 26 ms
6,940 KB
testcase_07 AC 4 ms
6,940 KB
testcase_08 AC 19 ms
6,944 KB
testcase_09 AC 11 ms
6,940 KB
testcase_10 AC 74 ms
6,944 KB
testcase_11 AC 72 ms
6,944 KB
testcase_12 AC 73 ms
6,944 KB
testcase_13 AC 73 ms
6,940 KB
testcase_14 AC 74 ms
6,944 KB
testcase_15 AC 72 ms
6,940 KB
testcase_16 AC 71 ms
6,940 KB
testcase_17 AC 71 ms
6,944 KB
testcase_18 AC 70 ms
6,940 KB
testcase_19 AC 74 ms
6,944 KB
testcase_20 AC 104 ms
6,944 KB
testcase_21 AC 106 ms
6,944 KB
testcase_22 AC 107 ms
6,940 KB
testcase_23 AC 104 ms
6,940 KB
testcase_24 AC 102 ms
6,940 KB
testcase_25 AC 103 ms
6,944 KB
testcase_26 AC 104 ms
6,940 KB
testcase_27 AC 100 ms
6,940 KB
testcase_28 AC 104 ms
6,940 KB
testcase_29 AC 109 ms
6,944 KB
testcase_30 AC 107 ms
6,940 KB
testcase_31 AC 107 ms
6,940 KB
testcase_32 AC 107 ms
6,944 KB
testcase_33 AC 104 ms
6,940 KB
testcase_34 AC 101 ms
6,944 KB
testcase_35 AC 97 ms
6,944 KB
testcase_36 AC 88 ms
6,944 KB
testcase_37 AC 102 ms
6,940 KB
testcase_38 AC 103 ms
6,940 KB
testcase_39 AC 106 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
using namespace std;
// #pragma GCC target("avx,avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#ifdef LOCAL
#include <debug.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll,ll>;
using pii = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vul = vector<ull>;
using vpii = vector<pii>;
using vvpii = vector<vpii>;
using vpll = vector<pll>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T,vector<T>, greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#define rep2(i, n) for (ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i) , end(i)
#define all2(i,a) begin(i) , begin(i) + a
#define all3(i,a,b) begin(i) + a , begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
template<class T> auto min(const T& a){return *min_element(all(a));}
template<class T> auto max(const T& a){return *max_element(all(a));}
template<class... Ts> void in(Ts&... t);
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
bool is_clamp(ll val,ll low,ll high) {return low <= val && val < high;}
void Yes() {cout << "Yes\n";return;}
void No() {cout << "No\n";return;}
void YES() {cout << "YES\n";return;}
void NO() {cout << "NO\n";return;}
template <typename T>
T floor(T a, T b) {return a / b - (a % b && (a ^ b) < 0);}
template <typename T>
T ceil(T x, T y) {return floor(x + y - 1, y);}
template <typename T>
T bmod(T x, T y) {return x - y * floor(x, y);}
template <typename T>
pair<T, T> divmod(T x, T y) {T q = floor(x, y);return {q, x - q * y};}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(15);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ituple(t, make_index_sequence<tuple_size<T>::value>{});} 
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }
#undef unpack
constexpr long double PI = 3.141592653589793238462643383279L;
template <class F> struct REC {
    F f;
    REC(F &&f_) : f(forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};

constexpr int mod = 998244353;
//constexpr int mod = 1000000007;
int dx[] = {1,-1,0,0};
int dy[] = {0,0,1,-1};
int main() {
    INT(n,m,k);
    VV(int,a,n,m);
    int ok = 1,ng = 1e9 + 1;
    while(ng - ok > 1) {
        int mid = (ok + ng) / 2;
        vvi dp(n,vi(m,1e9));
        dp[0][0] = a[0][0] < mid;
        deque<pii> dq;
        dq.emplace_back(0,0);
        while(!dq.empty()) {
            auto [px,py] = dq.front();
            dq.pop_front();
            rep(dir,4) {
                int nx = px + dx[dir];
                int ny = py + dy[dir];
                if(is_clamp(nx,0,n) && is_clamp(ny,0,m)) {
                    int f = a[nx][ny] < mid;
                    if(chmin(dp[nx][ny],dp[px][py] + f)) {
                        if(f) dq.emplace_back(nx,ny);
                        else dq.emplace_front(nx,ny);
                    }
                }
            }
        }
        if(dp[n-1][m-1] > k) ng = mid;
        else ok = mid;
    }
    cout << ok << '\n';
}
0