oj.uz

Submission #235480

# Submission time Handle Problem Language Result Execution time Memory
235480 2020-05-28T10:57:52 Z doowey Holding (COCI20_holding) C++14
55 / 110
 43 ms 54528 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

const int N = 51;
const int S = N * (N + 1);
const int M = S/2;
const int inf = (int)1e9;

int dpL[N][N][S]; // pick i items, indice sum j
int dpR[N][N][S];
int a[N];

void upd(int &a, int b){  
  a = min(a, b);
}

int main(){
  fastIO;
  int n, l, r, k;
  cin >> n >> l >> r >> k;
  for(int q = 0; q <= n; q ++ ){
    for(int d = 0; d <= n; d ++ ){
      for(int s = 0; s < S; s ++ ){
        dpL[q][d][s] = inf;
        dpR[q][d][s] = inf;
      }
    }
  }
  dpL[0][0][M]=0;
  int ans = 0;
  for(int i = 1; i <= n; i ++ ){
    cin >> a[i];
    if(i >= l && i <= r) ans += a[i];
  }
  for(int i = 1; i <= r; i ++ ){
    for(int j = 0 ; j <= n ; j ++ ){
      for(int x = 0; x < S ; x ++ ){
        if(i < l){
          if(dpL[i-1][j][x] == inf) continue;
          upd(dpL[i][j + 1][x - i], dpL[i-1][j][x] + a[i]);
          upd(dpL[i][j][x], dpL[i-1][j][x]);
        }
        else{
          if(dpL[i-1][j][x] == inf) continue;
          if(j) upd(dpL[i][j - 1][x + i], dpL[i-1][j][x]);
          upd(dpL[i][j][x], dpL[i-1][j][x] + a[i]);
        }
      }
    }
  }
  for(int x = 0; x <= k ; x ++ ){
    upd(ans, dpL[r][0][x + M]);
  }
  /*
  for(int i = 0 ; i <= n; i ++ ){
    for(int j = 0 ; j < S; j ++ ){
      dp[0][i][j] = dp[1][i][j] = inf;
    }
  }
  dp[0][0][M]=0;
  for(int i = n; i >= l ; i -- ){
    for(int j = 0 ; j <= n; j ++ ){
      for(int x = 0; x < S; x ++ ){
        if(dp[0][j][x] == inf) continue;
        if(i > r){
          upd(dp[1][j + 1][x + i], dp[0][j][x] + a[i]);
          upd(dp[1][j][x], dp[0][j][x]);
        }
        else{
          if(j) upd(dp[1][j - 1][x - i], dp[0][j][x]);
          upd(dp[1][j][x], dp[0][j][x] + a[i]);
        }
      }
    }
    for(int j = 0 ; j <= n ; j ++ ){
      for(int x = 0; x < S; x ++ ){
        dp[0][j][x]=dp[1][j][x];
        dp[1][j][x]=inf;
      }
    }
    for(int x = 0 ;x < S; x ++ ){
      ri[i][x]=dp[0][0][x];
    }
  }
  for(int x = 0 ; x <= k ; x ++ ){
    upd(ans, ri[l][x + M]);
  }
  for(int i = l; i + 1 <= r; i ++ ){
    for(int x = 0; x <= k ; x ++ ){
      for(int y = 0 ; y + x <= k ; y ++ ){
        upd(ans, st[i][x] + ri[i + 1][y]);
      }
    }
  }
  */
  cout << ans << "\n";
  return 0;
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1152 KB Output is correct
2 Correct 7 ms 4608 KB Output is correct
3 Correct 7 ms 4608 KB Output is correct
4 Correct 7 ms 4480 KB Output is correct
5 Correct 7 ms 4608 KB Output is correct
6 Correct 7 ms 4480 KB Output is correct
7 Correct 7 ms 4096 KB Output is correct

Subtask #2
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1152 KB Output is correct
2 Correct 7 ms 4608 KB Output is correct
3 Correct 7 ms 4608 KB Output is correct
4 Correct 7 ms 4480 KB Output is correct
5 Correct 7 ms 4608 KB Output is correct
6 Correct 7 ms 4480 KB Output is correct
7 Correct 7 ms 4096 KB Output is correct
8 Correct 42 ms 54400 KB Output is correct
9 Correct 43 ms 54392 KB Output is correct
10 Correct 41 ms 54264 KB Output is correct
11 Correct 41 ms 54392 KB Output is correct
12 Correct 43 ms 54528 KB Output is correct
13 Correct 41 ms 54392 KB Output is correct

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1152 KB Output is correct
2 Correct 7 ms 4608 KB Output is correct
3 Correct 7 ms 4608 KB Output is correct
4 Correct 7 ms 4480 KB Output is correct
5 Correct 7 ms 4608 KB Output is correct
6 Correct 7 ms 4480 KB Output is correct
7 Correct 7 ms 4096 KB Output is correct
8 Correct 42 ms 54400 KB Output is correct
9 Correct 43 ms 54392 KB Output is correct
10 Correct 41 ms 54264 KB Output is correct
11 Correct 41 ms 54392 KB Output is correct
12 Correct 43 ms 54528 KB Output is correct
13 Correct 41 ms 54392 KB Output is correct
14 Correct 38 ms 54264 KB Output is correct
15 Correct 42 ms 54392 KB Output is correct
16 Incorrect 37 ms 54264 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1152 KB Output is correct
2 Correct 7 ms 4608 KB Output is correct
3 Correct 7 ms 4608 KB Output is correct
4 Correct 7 ms 4480 KB Output is correct
5 Correct 7 ms 4608 KB Output is correct
6 Correct 7 ms 4480 KB Output is correct
7 Correct 7 ms 4096 KB Output is correct
8 Correct 42 ms 54400 KB Output is correct
9 Correct 43 ms 54392 KB Output is correct
10 Correct 41 ms 54264 KB Output is correct
11 Correct 41 ms 54392 KB Output is correct
12 Correct 43 ms 54528 KB Output is correct
13 Correct 41 ms 54392 KB Output is correct
14 Correct 38 ms 54264 KB Output is correct
15 Correct 42 ms 54392 KB Output is correct
16 Incorrect 37 ms 54264 KB Output isn't correct
17 Halted 0 ms 0 KB -