fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5. #define print(a)         for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14.     int x = 1;
  15.     a %= mod;
  16.     while (b) {
  17.         if (b & 1) x = (x * a) % mod; 
  18.         a = (a * a) % mod;
  19.         b >>= 1;
  20.     }
  21.     return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. vector<int> a;
  31. vector<int> cost;
  32.  
  33. int consistency1(int n) {
  34.     vector<int> dp(n + 1, INF);
  35.  
  36.     dp[0] = 0; 
  37.  
  38.     for (int i=1; i<=n; i++) {
  39.  
  40.         for (int j=0; j<=n; j++) {
  41.             int left = max(0LL, j - a[j]);
  42.             int right = min(n, j + a[j]);
  43.  
  44.             if (left <= i && right >= i) {
  45.                 if (dp[left] != INF) {
  46.                     dp[i] = min(dp[i], dp[left] + cost[j]);
  47.                 }
  48.             }
  49.         }
  50.     }
  51.  
  52.     return dp[n] == INF ? -1 : dp[n];
  53. }
  54.  
  55.  
  56.  
  57.  
  58. //? Optimization 
  59.  
  60. int consistency2(int n) {
  61.     vector<int> dp(n + 1, INF);
  62.  
  63.     dp[0] = 0; 
  64.  
  65.     for (int i=1; i<=n; i++) {
  66.  
  67.     	int start = max(0LL, i-100);
  68.     	int end = min(n, i+100);
  69.  
  70.         for (int j=start; j<=end; j++) {
  71.             int left = max(0LL, j - a[j]);
  72.             int right = min(n, j + a[j]);
  73.  
  74.             if (left <= i && right >= i) {
  75.                 if (dp[left] != INF) {
  76.                     dp[i] = min(dp[i], dp[left] + cost[j]);
  77.                 }
  78.             }
  79.         }
  80.     }
  81.  
  82.     return dp[n] == INF ? -1 : dp[n];
  83. }
  84.  
  85.  
  86.  
  87.  
  88.  
  89.  
  90.  
  91.  
  92.  
  93.  
  94.  
  95. int practice(int n){
  96.  
  97.  
  98.     return 0;
  99. }
  100.  
  101.  
  102.  
  103.  
  104.  
  105. void solve() {
  106.  
  107.     int n;
  108.     cin>> n;
  109.  
  110.     a.resize(n+1);
  111.     for(int i=0; i<=n; i++) cin >> a[i];
  112.  
  113.     cost.resize(n+1);
  114.     for(int i=0; i<=n; i++) cin >> cost[i];
  115.  
  116.     cout << consistency1(n) << " " << consistency2(n) << endl;
  117.  
  118.  
  119. }
  120.  
  121.  
  122.  
  123.  
  124.  
  125. int32_t main() {
  126.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  127.  
  128.     int t = 1;
  129.     // cin >> t;
  130.     while (t--) {
  131.         solve();
  132.     }
  133.  
  134.     return 0;
  135. }
Success #stdin #stdout 0.01s 5320KB
comments (?)
stdin
copy 
4
1 1 2 1 0
5 2 5 1 1
stdout
copy 
3 3
https://ideone.com/h57Y53
language:
C++14 (gcc 8.3)
created:
11 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!