oj.uz

Submission #619421

# Submission time Handle Problem Language Result Execution time Memory
619421 2022-08-02T11:52:23 Z Hazem Boxes with souvenirs (IOI15_boxes) C++14
100 / 100
 543 ms 277488 KB 
#include <bits/stdc++.h>
#define LL long long

using namespace std;

const LL LINF = 1e18;

LL a[10000010],pr[10000010],su[10000010];
vector<LL>vec[2];
LL n,k,L1;

long long delivery(int N, int K, int L, int p[]) {
    
    n = N,k = K;    
    L1 = L;

    for(int i=1;i<=n;i++)
        a[i] = p[i-1];
    
    for(int i=1;i<=n;i++)
        if(i<=k)
            pr[i] = a[i]*2;
        else 
            pr[i] = pr[i-k] + a[i]*2;


    for(int i=n;i>=1;i--)
        if(n-i+1<=k)
            su[i] = (L-a[i])*2;
        else 
            su[i] = su[i+k] + (L-a[i])*2;

    LL ans = min(pr[n],su[1]);
    for(int i=1;i<=n;i++){
        ans = min(ans,pr[i-1]+su[i]);
        ans = min(ans,pr[i-1]+su[i+k]+L);
    }

    return ans;
}

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:27:15: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   27 |     for(int i=n;i>=1;i--)
      |               ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 316 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 312 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 312 KB Output is correct
23 Correct 1 ms 312 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 368 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 61 ms 31040 KB Output is correct
34 Correct 23 ms 29608 KB Output is correct
35 Correct 31 ms 30068 KB Output is correct
36 Correct 58 ms 33144 KB Output is correct
37 Correct 57 ms 33192 KB Output is correct
38 Correct 60 ms 33092 KB Output is correct
39 Correct 50 ms 33128 KB Output is correct
40 Correct 35 ms 31328 KB Output is correct
41 Correct 54 ms 33260 KB Output is correct
42 Correct 30 ms 31632 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 312 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 312 KB Output is correct
23 Correct 1 ms 312 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 368 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 61 ms 31040 KB Output is correct
34 Correct 23 ms 29608 KB Output is correct
35 Correct 31 ms 30068 KB Output is correct
36 Correct 58 ms 33144 KB Output is correct
37 Correct 57 ms 33192 KB Output is correct
38 Correct 60 ms 33092 KB Output is correct
39 Correct 50 ms 33128 KB Output is correct
40 Correct 35 ms 31328 KB Output is correct
41 Correct 54 ms 33260 KB Output is correct
42 Correct 30 ms 31632 KB Output is correct
43 Correct 483 ms 275736 KB Output is correct
44 Correct 202 ms 274900 KB Output is correct
45 Correct 254 ms 275132 KB Output is correct
46 Correct 485 ms 277180 KB Output is correct
47 Correct 490 ms 277368 KB Output is correct
48 Correct 526 ms 277488 KB Output is correct
49 Correct 462 ms 277072 KB Output is correct
50 Correct 300 ms 275524 KB Output is correct
51 Correct 543 ms 277432 KB Output is correct
52 Correct 310 ms 275500 KB Output is correct