oj.uz

Submission #481955

# Submission time Handle Problem Language Result Execution time Memory
481955 2021-10-22T11:14:01 Z Lobo Boxes with souvenirs (IOI15_boxes) C++17
50 / 100
 151 ms 14980 KB 
#include "boxes.h"
#include <bits/stdc++.h>
 
using namespace std;
 
const long long INFll = (long long) 1e18 + 10;
const int INFii = (int) 1e9 + 10;
typedef long long ll;
typedef int ii;
typedef long double dbl;
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
 
#define maxn 1100

ll n, kt;
ll dp1[maxn], x1[maxn];
ll dp2[maxn], x2[maxn];

long long delivery(int N, int K, int L, int p[]) {
    L--;
    n = N;
    kt = K;
    for(ii i = 1; i <= n; i++) {
        dp1[i] = dp2[i] = -1;
        x1[i] = p[i-1];
        x2[i] = L-x1[i]+1;
    }

    reverse(x2+1,x2+1+n);

    for(ii i = 1; i <= n; i++) {
        ll ans = INFll;

        for(ii j = i-1; j >= i-kt && j >= 0; j--) {
            ans = min(ans, dp1[j]);
        }

        dp1[i] = ans + x1[i] + min(x1[i],x2[n-i+1]);
    }

    for(ii i = 1; i <= n; i++) {
        ll ans = INFll;

        for(ii j = i-1; j >= i-kt && j >= 0; j--) {
            ans = min(ans, dp2[j]);
        }

        dp2[i] = ans + x2[i] + min(x1[n-i+1],x2[i]);
    }

    ll ans = INFll;
    for(ii i = 0; i <= n; i++) {
        ans = min(ans, dp1[i] + dp2[n-i]);
    }

    return ans;

}


// #include <bits/stdc++.h>
 
// using namespace std;

// const long long INFll = (long long) 1e18 + 10;
// const int INFii = (int) 1e9 + 10;
// typedef long long ll;
// typedef int ii;
// typedef long double dbl;
// #define endl '\n'
// #define sc second
// #define fr first
// #define mp make_pair
// #define pb push_back
// #define all(x) x.begin(), x.end()

// #define maxn 1100

// ll n, kt;
// ll mark1[maxn], dp1[maxn], x1[maxn];
// ll mark2[maxn], dp2[maxn], x2[maxn];

// ll sol1(ll i) {
//     if(i == 0) return 0;
//     if(dp1[i] != -1) return dp1[i];

//     ll ans = INFll;

//     for(ii j = i-1; j >= i-kt && j >= 0; j--) {
//         ans = min(ans, sol1(j));
//     }

//     return dp1[i] = ans + x1[i] + min(x1[i],x2[n-i+1]);
// }

// ll sol2(ll i) {
//     if(i == 0) return 0;
//     if(dp2[i] != -1) return dp2[i];

//     ll ans = INFll;

//     for(ii j = i-1; j >= i-kt && j >= 0; j--) {
//         ans = min(ans, sol2(j));
//     }

//     return dp2[i] = ans + x2[i] + min(x1[n-i+1],x2[i]);
// }


// int main() {
//     ios::sync_with_stdio(false); cin.tie(0);

//     //freopen("in.in", "r", stdin);
//     //freopen("out.out", "w", stdout);

//     ii N, K, L;
//     cin >> N >> K >> L;
//     vector<ii> p;
//     for(ii i = 0; i < N; i++) {
//         ii aa; cin >> aa;
//         p.pb(aa);
//     }

//     L--;
//     n = N;
//     kt = K;
//     for(ii i = 1; i <= n; i++) {
//         dp1[i] = dp2[i] = -1;
//         x1[i] = p[i-1];
//         x2[i] = L-x1[i]+1;
//     }

//     reverse(x2+1,x2+1+n);

//     ll ans = INFll;
//     for(ii i = 0; i <= n; i++) {
//         ans = min(ans, (sol1(i)) + (sol2(n-i)));
//     }

//     cout << ans << endl;

// }

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 204 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 3 ms 332 KB Output is correct
12 Correct 3 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 300 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 296 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 3 ms 332 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 2 ms 332 KB Output is correct
28 Correct 2 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 3 ms 332 KB Output is correct
12 Correct 3 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 300 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 296 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 3 ms 332 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 2 ms 332 KB Output is correct
28 Correct 2 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Runtime error 151 ms 14980 KB Execution killed with signal 11
34 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 3 ms 332 KB Output is correct
12 Correct 3 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 300 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 296 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 3 ms 332 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 2 ms 332 KB Output is correct
28 Correct 2 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Runtime error 151 ms 14980 KB Execution killed with signal 11
34 Halted 0 ms 0 KB -