Submission #219611

# Submission time Handle Problem Language Result Execution time Memory
219611 2020-04-05T18:14:57 Z summitwei Boxes with souvenirs (IOI15_boxes) C++17
100 / 100
582 ms 285176 KB
#include <bits/stdc++.h>
#include <boxes.h>
using namespace std;
typedef vector<int> vi;
typedef vector<pair<int, int> > vpii;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef vector<ll> vll;
#define INF 1000000000000000000LL
#define MOD 1000000007LL
#define EPSILON 0.00001
#define f first
#define s second
#define pb push_back
#define mp make_pair

#define FOR(i, a, b) for (int i=(a); i<=(signed)(b); i++)
#define F0R(i, a) for (int i=0; i<(signed)(a); i++)
#define RFOR(i, a, b) for (int i=(a); i >= b; i--)

#define MN 10000005
int n, k; ll l;
ll d[MN];
ll ps[MN];
ll rps[MN];

ll delivery(int N, int K, int L, int positions[]){
    n = N; k = K; l = (ll)L;
    F0R(i, n) d[i] = positions[i];
    F0R(i, n){
        ps[i] = d[i]*2;
        if(i >= k){
            ps[i] += ps[i-k];
        }
    }
    RFOR(i, n-1, 0){
        rps[i] = (l-d[i])*2;
        if(i+k < n){
            rps[i] += rps[i+k];
        }
    }
    ll ans = INF;
    F0R(i, n-1){
        ans = min(ans, ps[i]+rps[i+1]);
    }
    ans = min(ans, min(rps[0], ps[n-1]));
    if(k >= n) ans = min(ans, l);
    else{
        F0R(i, n-k+1){
            int lf = i-1, rt = i+k;
            ll res = l+(lf<0?0:ps[lf])+(rt>=n?0:rps[rt]);
            ans = min(ans, res);
        }
    }
    return ans;
}

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

    int N, K, L;
    cin >> N >> K >> L;
    int pos[N];
    F0R(i, N) cin >> pos[i];
    cout << delivery(N, K, L, pos) << "\n";
    
    return 0;
}*/
# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 436 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 436 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 4 ms 384 KB Output is correct
21 Correct 4 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 4 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 4 ms 384 KB Output is correct
32 Correct 4 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 436 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 4 ms 384 KB Output is correct
21 Correct 4 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 4 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 4 ms 384 KB Output is correct
32 Correct 4 ms 384 KB Output is correct
33 Correct 66 ms 37368 KB Output is correct
34 Correct 31 ms 29688 KB Output is correct
35 Correct 33 ms 30208 KB Output is correct
36 Correct 67 ms 37496 KB Output is correct
37 Correct 66 ms 37496 KB Output is correct
38 Correct 66 ms 37496 KB Output is correct
39 Correct 60 ms 35964 KB Output is correct
40 Correct 38 ms 31352 KB Output is correct
41 Correct 66 ms 37496 KB Output is correct
42 Correct 40 ms 31608 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 436 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 4 ms 384 KB Output is correct
21 Correct 4 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 4 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 4 ms 384 KB Output is correct
32 Correct 4 ms 384 KB Output is correct
33 Correct 66 ms 37368 KB Output is correct
34 Correct 31 ms 29688 KB Output is correct
35 Correct 33 ms 30208 KB Output is correct
36 Correct 67 ms 37496 KB Output is correct
37 Correct 66 ms 37496 KB Output is correct
38 Correct 66 ms 37496 KB Output is correct
39 Correct 60 ms 35964 KB Output is correct
40 Correct 38 ms 31352 KB Output is correct
41 Correct 66 ms 37496 KB Output is correct
42 Correct 40 ms 31608 KB Output is correct
43 Correct 568 ms 284920 KB Output is correct
44 Correct 264 ms 285176 KB Output is correct
45 Correct 280 ms 279160 KB Output is correct
46 Correct 582 ms 284796 KB Output is correct
47 Correct 567 ms 284792 KB Output is correct
48 Correct 569 ms 284672 KB Output is correct
49 Correct 511 ms 284944 KB Output is correct
50 Correct 322 ms 275576 KB Output is correct
51 Correct 579 ms 285008 KB Output is correct
52 Correct 337 ms 275576 KB Output is correct