oj.uz

Submission #322423

# Submission time Handle Problem Language Result Execution time Memory
322423 2020-11-14T17:15:33 Z tigicha Boxes with souvenirs (IOI15_boxes) C++17
10 / 100
 1 ms 364 KB 
#include "boxes.h"
#include<bits/stdc++.h>
using namespace std;
long long ans, dp1[10000001], dp2[10000001];
long long delivery(int n, int k, int l, int a[]){
    for(long long i=0; i<n; i++)
    if(i>=k) dp1[i+1]=2*a[i]+a[i-k+1];
    else dp1[i+1]=2*a[i];
    for(long long i=n-1; i>=0; i--)
    if(i<n-k) dp2[i+1]=2*(l-a[i])+dp2[i+k+1];
    else dp2[i+1]=2*(l-a[i]);
    ans=min(dp1[n], dp2[1]);
    for(long long i=1; i<=n-k+1; i++)
    ans=min(ans, dp1[i-1]+l+dp2[i+k]);
    for(long long i=1; i<n; i++)
    ans=min(ans, dp1[i]+dp2[i+1]);
    return ans;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -