結果
問題 | No.2328 Build Walls |
ユーザー | deuteridayo |
提出日時 | 2023-05-28 15:05:20 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,088 bytes |
コンパイル時間 | 4,591 ms |
コンパイル使用メモリ | 270,516 KB |
実行使用メモリ | 19,828 KB |
最終ジャッジ日時 | 2024-06-08 06:57:29 |
合計ジャッジ時間 | 7,721 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 5 ms
9,440 KB |
testcase_01 | AC | 6 ms
9,600 KB |
testcase_02 | AC | 6 ms
9,496 KB |
testcase_03 | AC | 5 ms
9,600 KB |
testcase_04 | AC | 5 ms
9,600 KB |
testcase_05 | AC | 6 ms
9,728 KB |
testcase_06 | AC | 5 ms
9,600 KB |
testcase_07 | AC | 6 ms
9,600 KB |
testcase_08 | AC | 6 ms
9,496 KB |
testcase_09 | AC | 6 ms
9,484 KB |
testcase_10 | AC | 6 ms
9,596 KB |
testcase_11 | AC | 6 ms
9,600 KB |
testcase_12 | AC | 5 ms
9,600 KB |
testcase_13 | AC | 76 ms
15,084 KB |
testcase_14 | WA | - |
testcase_15 | AC | 44 ms
12,240 KB |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | AC | 14 ms
10,420 KB |
testcase_20 | WA | - |
testcase_21 | AC | 66 ms
14,464 KB |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | AC | 123 ms
19,696 KB |
testcase_29 | WA | - |
testcase_30 | AC | 140 ms
19,672 KB |
testcase_31 | AC | 136 ms
19,712 KB |
testcase_32 | WA | - |
testcase_33 | AC | 147 ms
19,700 KB |
testcase_34 | AC | 140 ms
19,824 KB |
testcase_35 | AC | 141 ms
19,528 KB |
testcase_36 | WA | - |
ソースコード
#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]; } lint ans=INF64; vec<vec<lint>>dp(w+1,vec<lint>(h,INF64)); repp(i,1,h-1)dp[0][i]=0; rep(i,w){ repp(j,1,h-1){ if(a[j][i]==-1)continue; dp[i+1][j]=min({dp[i][j-1],dp[i][j],dp[i][j+1]})+a[j][i]; } repp(j,1,h-2){ if(a[j+1][i]!=-1)dp[i+1][j+1]=min(dp[i+1][1+j],dp[i+1][j]+a[j+1][i]); } for(int j=h-1;j>=2;j--){ if(a[j-1][i]!=-1)dp[i+1][j-1]=min(dp[i+1][j-1],dp[i+1][j]+a[j-1][i]); } } rep(i,h)ans=min(ans,dp[w][i]); if(ans>=INF64)ans=-1; cout<<ans<<endl; }