結果
問題 | No.2855 Move on Grid |
ユーザー |
![]() |
提出日時 | 2024-08-31 13:49:44 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 166 ms / 3,000 ms |
コード長 | 3,406 bytes |
コンパイル時間 | 6,460 ms |
コンパイル使用メモリ | 338,756 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-08-31 13:49:57 |
合計ジャッジ時間 | 12,634 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 40 |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>#pragma GCC target ("avx")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#pragma GCC optimize("Ofast,unroll-loops")#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")using namespace std;using namespace atcoder;using ll=long long;#define rep(i,a,b) for(it i=(it)(a);i<=(it)b;i++)#define nrep(i,a,b) for(it i=(it)(a);i>=(it)b;i--)#define all(v) v.begin(), v.end()#define rall(v) v.rbegin(), v.rend()#define moda 998244353LL#define modb 1000000007LL#define gyaku 166374059LL#define dai 2500000000000000000LL#define tyu 2500000000#define giri 1000000000#define en 3.14159265358979#define endl '\n'#define sho -dai#define eps 1e-14#define yn(x) cout<<(x ? "Yes\n":"No\n");#define YN(x) cout<<(x ? "YES\n":"NO\n");#define cou(x) cout<<x<<endl;#define ci(x) cin>>x;using it=long long;using un=unsigned long long;using db=long double;using st=string;using ch=char;using bo=bool;using P=pair<it,it>;using ip=pair<int,int>;using mint=modint;using mints=modint998244353;using minto=modint1000000007;using vi=vector<it>;using ivi=vector<int>;using vd=vector<db>;using vs=vector<st>;using vc=vector<ch>;using vb=vector<bo>;using vp=vector<P>;using ivp=vector<ip>;using vm=vector<mint>;using vms=vector<mints>;using vmo=vector<minto>;using sp=set<P>;using isp=set<ip>;using ss=set<st>;using sc=set<ch>;using si=set<it>;using isi=set<int>;using svi=set<vi>;using vvi=vector<vi>;using ivvi=vector<ivi>;using vvd=vector<vd>;using vvs=vector<vs>;using vvb=vector<vb>;using vvc=vector<vc>;using vvp=vector<vp>;using ivvp=vector<ivp>;using vvm=vector<vm>;using vvms=vector<vms>;using vvmo=vector<vmo>;using vsi=vector<si>;using ivsi=vector<isi>;using vsp=vector<sp>;using ivsp=vector<isp>;using vvsi=vector<vsi>;using ivvsi=vector<ivsi>;using vvsp=vector<vsp>;using ivvsp=vector<ivsp>;using vvvi=vector<vvi>;using ivvvi=vector<ivvi>;using vvvd=vector<vvd>;using vvvm=vector<vvm>;using vvvvi=vector<vvvi>;using ivvvvi=vector<ivvvi>;template<typename T>void scan(vector<T> &a){rep(i,0,a.size()-1)cin>>a[i];}int haba(ivvi &g,int r,int c,int x,int y,int a,int b){ivvi dist(r,ivi(c,-1));dist[x][y]=g[x][y];deque<ip> que;que.push_back({x,y});while(que.size()){int x=que.front().first,y=que.front().second;que.pop_front();if(x&&dist[x-1][y]==-1){dist[x-1][y]=dist[x][y]+g[x-1][y];if(g[x-1][y])que.push_back({x-1,y});else que.push_front({x-1,y});}if(x!=r-1&&dist[x+1][y]==-1){dist[x+1][y]=dist[x][y]+g[x+1][y];if(g[x+1][y])que.push_back({x+1,y});else que.push_front({x+1,y});}if(y&&dist[x][y-1]==-1){dist[x][y-1]=dist[x][y]+g[x][y-1];if(g[x][y-1])que.push_back({x,y-1});else que.push_front({x,y-1});}if(y!=c-1&&dist[x][y+1]==-1){dist[x][y+1]=dist[x][y]+g[x][y+1];if(g[x][y+1])que.push_back({x,y+1});else que.push_front({x,y+1});}}return dist[a][b];}int main(){ios::sync_with_stdio(false);cin.tie(nullptr);int n,m,k;cin>>n>>m>>k;ivvi a(n,ivi(m));rep(i,0,n-1)scan(a[i]);int ok=1,ng=giri+1;while(ng-ok>1){int mid=(ng+ok)/2;ivvi g(n,ivi(m));rep(i,0,n-1)rep(j,0,m-1)g[i][j]=(a[i][j]<mid);if(haba(g,n,m,0,0,n-1,m-1)>k)ng=mid;else ok=mid;}cou(ok);}