oj.uz

Submission #844526

# Submission time Handle Problem Language Result Execution time Memory
844526 2023-09-05T13:52:28 Z vjudge1 Holding (COCI20_holding) C++14
88 / 110
 32 ms 262144 KB 
// Aber der schlimmste Fiend, dem du begegnen kannst, wirst du immer dir selber sein
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ff first
#define ss second
#define pb push_back
#define rev reverse
#define all(x) x.begin(),x.end()
#define acc accumulate
#define sz size()
#define MOD 1000000007
#define rall(x) x.rbegin(),x.rend()
#define rep(i, x, n) for(int i = x; i < n; i++)
using namespace std;
const int N = 1e6 + 5;
int a[101];
int n, l, r, k;
int dp[101][101][10001];
int rec(int in, int in2, int left){
    if(in2 == r) return 0;
    if(in == n) return MOD;
    if(dp[in][in2][left] != -1) return dp[in][in2][left];
    int ans1 = rec(in+1, in2, left), ans2 = MOD;
    if(abs(in - in2) <= left) ans2 = rec(in+1, in2+1, left - abs(in - in2)) + a[in];
    return dp[in][in2][left] = min(ans1, ans2);
}
inline void solve(){
    cin >> n >> l >> r >> k;
    for(int i = 0; i < n; i++) cin >> a[i];
    rep(i, 0, n) rep(j, 0, n) rep(ll, 0, k+1) dp[i][j][ll] = -1;
    cout << rec(0, l-1, k) << endl;
}
int main(){
    fast_io
    int t;
    t = 1;
    while(t--) solve();
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8536 KB Output is correct
2 Correct 3 ms 29016 KB Output is correct
3 Correct 3 ms 29020 KB Output is correct
4 Correct 3 ms 29020 KB Output is correct
5 Correct 3 ms 29016 KB Output is correct
6 Correct 3 ms 29020 KB Output is correct
7 Correct 3 ms 27228 KB Output is correct

Subtask #2
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8536 KB Output is correct
2 Correct 3 ms 29016 KB Output is correct
3 Correct 3 ms 29020 KB Output is correct
4 Correct 3 ms 29020 KB Output is correct
5 Correct 3 ms 29016 KB Output is correct
6 Correct 3 ms 29020 KB Output is correct
7 Correct 3 ms 27228 KB Output is correct
8 Correct 22 ms 197336 KB Output is correct
9 Correct 19 ms 197336 KB Output is correct
10 Correct 20 ms 197440 KB Output is correct
11 Correct 20 ms 197468 KB Output is correct
12 Correct 20 ms 197212 KB Output is correct
13 Correct 22 ms 197464 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8536 KB Output is correct
2 Correct 3 ms 29016 KB Output is correct
3 Correct 3 ms 29020 KB Output is correct
4 Correct 3 ms 29020 KB Output is correct
5 Correct 3 ms 29016 KB Output is correct
6 Correct 3 ms 29020 KB Output is correct
7 Correct 3 ms 27228 KB Output is correct
8 Correct 22 ms 197336 KB Output is correct
9 Correct 19 ms 197336 KB Output is correct
10 Correct 20 ms 197440 KB Output is correct
11 Correct 20 ms 197468 KB Output is correct
12 Correct 20 ms 197212 KB Output is correct
13 Correct 22 ms 197464 KB Output is correct
14 Correct 21 ms 197464 KB Output is correct
15 Correct 19 ms 197408 KB Output is correct
16 Correct 19 ms 197464 KB Output is correct
17 Correct 19 ms 197356 KB Output is correct
18 Correct 20 ms 197468 KB Output is correct
19 Correct 24 ms 197676 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8536 KB Output is correct
2 Correct 3 ms 29016 KB Output is correct
3 Correct 3 ms 29020 KB Output is correct
4 Correct 3 ms 29020 KB Output is correct
5 Correct 3 ms 29016 KB Output is correct
6 Correct 3 ms 29020 KB Output is correct
7 Correct 3 ms 27228 KB Output is correct
8 Correct 22 ms 197336 KB Output is correct
9 Correct 19 ms 197336 KB Output is correct
10 Correct 20 ms 197440 KB Output is correct
11 Correct 20 ms 197468 KB Output is correct
12 Correct 20 ms 197212 KB Output is correct
13 Correct 22 ms 197464 KB Output is correct
14 Correct 21 ms 197464 KB Output is correct
15 Correct 19 ms 197408 KB Output is correct
16 Correct 19 ms 197464 KB Output is correct
17 Correct 19 ms 197356 KB Output is correct
18 Correct 20 ms 197468 KB Output is correct
19 Correct 24 ms 197676 KB Output is correct
20 Runtime error 32 ms 262144 KB Execution killed with signal 9
21 Halted 0 ms 0 KB -