Advertisement
leminhkt

noname57

May 23rd, 2020
121
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.75 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. // #include<time.h>
  3. // #include<stdio.h>
  4. // #include<windows.h>
  5. // #include<conio.h>
  6.  
  7.  
  8. using namespace std;
  9.  
  10.  
  11. typedef bool bul;
  12. typedef char ja;
  13. typedef short sot;
  14. typedef long long ll;
  15. typedef long double ld;
  16. typedef string sj;
  17. #define pe pair
  18. typedef pe<int, int> pii;
  19. #define vec vector
  20. #define fus first
  21. #define sec second
  22. #define MOD (1000000007)
  23. #define PI (2*acos(0))
  24. #define pb push_back
  25.  
  26.  
  27. #define FOR(i, a, b) for(ll i = (a); i <= (b); ++i)
  28. #define FORn(i, a, b) for(ll i = (a); i < (b); ++i)
  29. #define FORx(i, a, b, x) for(ll i = (a); i <= (b); i += (x))
  30. #define FORnx(i, a, b, x) for(ll i = (a); i < (b); i += (x))
  31. #define FORR(i, a, b) for(ll i = (a); i >= (b); --i)
  32. #define FORRn(i, a, b) for(ll i = (a); i > (b); --i)
  33. #define FORRx(i, a, b, n) for(ll i = (a); i >= (b); i -= (x))
  34. #define FORRnx(i, a, b, n) for(ll i = (a); i > (b); i -= (x))
  35.  
  36.  
  37. #define all(x) (x).begin(), (x).end()
  38. #define sz(x) 1ll*(x).size()
  39. #define sqr(x) (x)*(x)
  40.  
  41.  
  42.     /* ----------------- useful func ----------------- */
  43.  
  44.  
  45.  
  46. /* ----------------- ~~~~~~~~~~~ ----------------- */
  47.  
  48.  
  49.  
  50.  
  51.  
  52.  
  53.  
  54.         /* ----------------- ~~~~~~~ ----------------- */
  55.  
  56.     int m, n, res = INT_MAX;
  57.     int a[1000][1000];
  58.  
  59. /* ----------------- ~~~~~~~ ----------------- */
  60.  
  61. int main(){
  62.  
  63.     //freopen(".inp", "r", stdin);
  64.     //freopen(".out", "w", stdout);
  65.     //ios_base::sync_with_stdio(0); cin.tie(0);
  66.  
  67.         /* ----------------- main func ----------------- */
  68.  
  69.     cin >> m >> n;
  70.     FORn(i, 0, m)
  71.         FORn(j, 0, n){
  72.             cin >> a[i][j];
  73.             if(i == 0) continue;
  74.             int t = a[i - 1][j];
  75.             if(j != 0) t = min(t, a[i - 1][j - 1]);
  76.             if(j != n - 1) t = min(t, a[i - 1][j + 1]);
  77.             a[i][j] += t;
  78.         }
  79.     FORn(i, 0, n)
  80.         res = min(res, a[m - 1][i]);
  81.     cout << res;
  82.  
  83. /* ----------------- ~~~~~~~~~ ----------------- */
  84.  
  85. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement