結果

問題 No.2855 Move on Grid
ユーザー hibit_at
提出日時 2024-08-25 14:56:19
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,083 ms / 3,000 ms
コード長 5,217 bytes
コンパイル時間 1,059 ms
コンパイル使用メモリ 118,980 KB
最終ジャッジ日時 2025-02-24 01:18:20
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 40
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#include <stack>
#include <complex>

using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define all(A) A.begin(), A.end()
#define itr(A, l, r) A.begin() + l, A.begin() + r
#define debug(var) cout << #var << " = " << var << endl;
typedef long long ll;

template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p)
{
    os << "(" << p.first << "," << p.second << ")";
    return os;
}

template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p)
{
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v)
{
    for (int i = 0; i < (int)v.size(); i++)
    {
        os << v[i] << (i + 1 != (int)v.size() ? " " : "");
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<vector<T>> &v)
{
    for (int i = 0; i < (int)v.size(); i++)
    {
        os << v[i] << endl;
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<vector<vector<T>>> &v)
{
    int n = v.size();
    int m = v[0].size();
    int p = v[0][0].size();
    rep(k, p)
    {
        os << "k = " << k << endl;
        rep(i, n)
        {
            rep(j, m)
            {
                os << v[i][j][k];
                if (j < m - 1)
                {
                    os << " ";
                }
                else
                {
                    os << endl;
                }
            }
        }
    }
    return os;
}

template <typename T>
istream &operator>>(istream &is, vector<T> &v)
{
    for (T &in : v)
        is >> in;
    return is;
}

template <typename T, typename S>
ostream &operator<<(ostream &os, map<T, S> &mp)
{
    for (auto &[key, val] : mp)
    {
        os << key << ":" << val << " ";
    }
    cout << endl;
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, set<T> st)
{
    auto itr = st.begin();
    for (int i = 0; i < (int)st.size(); i++)
    {
        os << *itr << (i + 1 != (int)st.size() ? " " : "");
        itr++;
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, multiset<T> st)
{
    auto itr = st.begin();
    for (int i = 0; i < (int)st.size(); i++)
    {
        os << *itr << (i + 1 != (int)st.size() ? " " : "");
        itr++;
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, queue<T> q)
{
    while (q.size())
    {
        os << q.front() << " ";
        q.pop();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, deque<T> q)
{
    while (q.size())
    {
        os << q.front() << " ";
        q.pop_front();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, stack<T> st)
{
    while (st.size())
    {
        os << st.top() << " ";
        st.pop();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, priority_queue<T> pq)
{
    while (pq.size())
    {
        os << pq.top() << " ";
        pq.pop();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, priority_queue<T, vector<T>, greater<T>> mpq)
{
    while (mpq.size())
    {
        os << mpq.top() << " ";
        mpq.pop();
    }
    return os;
}

int main(){
    int n,m,k;
    cin >> n >> m >> k;
    vector<vector<int>> maze(n,vector<int>(m));
    cin >> maze;
    // cout << maze << endl;
    int ok = 0;
    int ng = 1e9+1;
    while(abs(ng-ok)>1){
        int mid = ng+ok;
        mid /= 2;
        // debug(mid);
        vector<vector<int>> dp(n,vector<int>(m,1e9));
        // dp[0][0] = a[0][0] < mid;
        using S = pair<int,pair<int,int>>;
        priority_queue<S,vector<S>, greater<S>> pq;
        pq.push({maze[0][0]<mid,{0,0}});
        while(pq.size()){
            auto [now_weight,now_pos] = pq.top();
            pq.pop();
            auto [cx,cy] = now_pos;
            if(now_weight >= dp[cx][cy]){
                continue;
            }
            dp[cx][cy] = now_weight;
            // vector<int> dx = {1,-1,0,0};
            // vector<int> dy = {0,0,1,-1};
            vector<pair<int, int>> dxy = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
            for(auto [dx,dy] : dxy){
                int nx = cx+dx;
                int ny = cy+dy;
                if(nx < 0 || n <= nx){
                    continue;
                }
                if(ny < 0 || m <= ny){
                    continue;
                }
                int next_weight = now_weight + (maze[nx][ny] < mid);
                // debug(next_weight);
                if(next_weight >= dp[nx][ny]){
                    continue;
                }
                pq.push({next_weight,{nx,ny}});
            }
        }
        // cout << dp << endl;
        if(dp[n-1][m-1]<=k){
            ok = mid;
        }else{
            ng = mid;
        }
    }
    cout << ok << endl;
}
0