結果
問題 | No.2328 Build Walls |
ユーザー |
|
提出日時 | 2023-05-28 15:15:42 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 330 ms / 3,000 ms |
コード長 | 3,259 bytes |
コンパイル時間 | 4,746 ms |
コンパイル使用メモリ | 263,088 KB |
最終ジャッジ日時 | 2025-02-13 12:51:31 |
ジャッジサーバーID (参考情報) |
judge1 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 34 |
ソースコード
·#include"bits/stdc++.h"#include"atcoder/all"using namespace std;using namespace atcoder;using lint = long long;using ulint = unsigned long long;#define endl '\n'int const INF = 1<<30;lint const INF64 = 1LL<<61;lint const mod107 = 1e9+7;using mint107 = modint1000000007;long const mod = 998244353;using mint = modint998244353;lint ceilDiv(lint x, lint y){if(x >= 0){return (x+y-1)/y;}else{return x/y;}}lint floorDiv(lint x, lint y){if(x >= 0){return x/y;}else{return (x-y+1)/y;}}lint Sqrt(lint x){lint upper = 1e9;lint lower = 0;while(upper - lower > 0){lint mid = (1+upper + lower)/2;if(mid * mid > x){upper = mid-1;}else{lower= mid;}}return upper;}lint gcd(lint a,lint b){if(a<b)swap(a,b);if(a%b==0)return b;else return gcd(b,a%b);}lint lcm(lint a,lint b){return (a / gcd(a,b)) * b;}lint chmin(vector<lint>&v){lint ans = INF64;for(lint i:v){ans = min(ans, i);}return ans;}lint chmax(vector<lint>&v){lint ans = -INF64;for(lint i:v){ans = max(ans, i);}return ans;}double dist(double x1, double y1, double x2, double y2){return sqrt(pow(x1-x2, 2) + pow(y1-y2,2));}string toString(lint n){string ans = "";if(n == 0){ans += "0";}else{while(n > 0){int a = n%10;char b = '0' + a;string c = "";c += b;n /= 10;ans = c +ans;}}return ans;}string toString(lint n, lint k){string ans = toString(n);string tmp = "";while(ans.length() + tmp.length() < k){tmp += "0";}return tmp + ans;}vector<lint>prime;void makePrime(lint n){prime.push_back(2);for(lint i=3;i<=n;i+=2){bool chk = true;for(lint j=0;j<prime.size() && prime[j]*prime[j]<= i;j++){if(i % prime[j]==0){chk=false;break;}}if(chk)prime.push_back(i);}}lint Kai[20000001]; bool firstCallnCr = true;lint ncrmodp(lint n,lint r,lint p){ if(firstCallnCr){ Kai[0] = 1; for(int i=1;i<=20000000;i++){ Kai[i] = Kai[i-1] * i; Kai[i] %= mod;} firstCallnCr =false;} if(n<0)return 0;if(n < r)return 0;if(n==0)return 1;lint ans = Kai[n];lint tmp = (Kai[r] * Kai[n-r]) % p;for(lint i=1;i<=p-2;i*=2){if(i & p-2){ans *= tmp;ans %= p;}tmp*= tmp;tmp %= p;}return ans;}#define rep(i, n) for(int i = 0; i < n; i++)#define repp(i, x, y) for(int i = x; i < y; i++)#define vec vector#define pb push_back#define se second#define fi first#define al(x) x.begin(),x.end()struct edge{int to;};using graph = vector<vec<int>>;graph g(200000);vec<lint>L(200000,-1);vec<bool>went(200000,false);lint f(int l,lint x){if(went[l])return 0;went[l]=true;L[l]=max(L[l],x);for(int v:g[l])f(v,L[l]);return 0;}int main(){lint h,w;cin>>h>>w;vec<vec<lint>>a(h,vec<lint>(w,-1));repp(i,1,h-1){rep(j,w)cin>>a[i][j];}priority_queue<vec<lint>>que;vec<vec<lint>>d(h,vec<lint>(w+1,INF64));repp(i,1,h-1)que.push({0,i,0});while(!que.empty()){auto q=que.top();que.pop();lint dd=-q[0];lint x=q[1],y=q[2];if(y==w)continue;for(int i=-1;i<=1;i++){for(int j=-1;j<=1;j++){int nx=x+i,ny=y+j;if(x+i<=0)continue;if(y+j<=0)continue;if(nx>=h-1)continue;if(ny>w)continue;if(a[nx][ny-1]==-1)continue;if(i==0&&j==0)continue;if(d[nx][ny]>dd+a[nx][ny-1]){d[nx][ny]=dd+a[nx][ny-1];que.push({-d[nx][ny],nx,ny});}}}}lint ans=INF64;rep(i,h)ans=min(ans,d[i][w]);if(ans==INF64)ans=-1;cout<<ans;}