oj.uz

Submission #481988

# Submission time Handle Problem Language Result Execution time Memory
481988 2021-10-22T14:25:51 Z Lobo Boxes with souvenirs (IOI15_boxes) C++17
100 / 100
 1658 ms 449596 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 10000010
 
ll n, kt;
ll dp1[maxn], x1[maxn];
ll dp2[maxn], x2[maxn];
 
long long delivery(int N, int K, int L, int p[]) {
    ii n1 = 0;
    ii n2 = 0;
    kt = K;
    for(ii i = 1; i <= N; i++) {
        dp1[i] = dp2[i] = -1;
        x1[i] = p[i-1];
        x2[i] = L-x1[i];

        if(x1[i] <= x2[i]) {
            n1++;
        }
        else {
            n2++;
        }
    }

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

 
    priority_queue<pair<ll,ll>, vector<pair<ll,ll>>, greater<pair<ll,ll>>> pq1;
    pq1.push(mp(0,0));
    for(ii i = 1; i <= n1; i++) {
        ll ans = INFll;
 
        while(pq1.size() && pq1.top().sc < i-kt) pq1.pop();
 
        ans = pq1.top().fr;
 
        dp1[i] = ans + 2*x1[i];
 
        pq1.push(mp(dp1[i],i));
    }
 
    priority_queue<pair<ll,ll>, vector<pair<ll,ll>>, greater<pair<ll,ll>>> pq2;
    pq2.push(mp(0,0));
    for(ii i = 1; i <= n2; i++) {
        ll ans = INFll;
        
        while(pq2.size() && pq2.top().sc < i-kt) pq2.pop();
 
        ans = pq2.top().fr;
 
        dp2[i] = ans + 2*x2[i];
        
        pq2.push(mp(dp2[i],i));
    }
 
    ll ans = dp1[n1]+dp2[n2];
    for(ii i1 = n1-kt, i2 = n2; i1 <= n1; i1++, i2--) {
        ans = min(ans, dp1[i1] + dp2[i2] + L);
    }
 
    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;
 
// }

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:73:19: warning: conversion from 'll' {aka 'long long int'} to 'ii' {aka 'int'} may change value [-Wconversion]
   73 |     for(ii i1 = n1-kt, i2 = n2; i1 <= n1; i1++, i2--) {
      |                 ~~^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 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 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 0 ms 332 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 109 ms 35708 KB Output is correct
34 Correct 88 ms 35736 KB Output is correct
35 Correct 56 ms 35532 KB Output is correct
36 Correct 129 ms 35524 KB Output is correct
37 Correct 111 ms 35584 KB Output is correct
38 Correct 104 ms 35528 KB Output is correct
39 Correct 99 ms 35656 KB Output is correct
40 Correct 92 ms 35608 KB Output is correct
41 Correct 99 ms 35524 KB Output is correct
42 Correct 98 ms 35528 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 109 ms 35708 KB Output is correct
34 Correct 88 ms 35736 KB Output is correct
35 Correct 56 ms 35532 KB Output is correct
36 Correct 129 ms 35524 KB Output is correct
37 Correct 111 ms 35584 KB Output is correct
38 Correct 104 ms 35528 KB Output is correct
39 Correct 99 ms 35656 KB Output is correct
40 Correct 92 ms 35608 KB Output is correct
41 Correct 99 ms 35524 KB Output is correct
42 Correct 98 ms 35528 KB Output is correct
43 Correct 1050 ms 392840 KB Output is correct
44 Correct 1365 ms 372672 KB Output is correct
45 Correct 423 ms 352592 KB Output is correct
46 Correct 1658 ms 362276 KB Output is correct
47 Correct 1522 ms 425696 KB Output is correct
48 Correct 1198 ms 414812 KB Output is correct
49 Correct 1498 ms 449596 KB Output is correct
50 Correct 1214 ms 409012 KB Output is correct
51 Correct 1121 ms 439260 KB Output is correct
52 Correct 1310 ms 399820 KB Output is correct