oj.uz

Submission #117498

# Submission time Handle Problem Language Result Execution time Memory
117498 2019-06-16T09:24:10 Z zubec Boxes with souvenirs (IOI15_boxes) C++14
10 / 100
 2 ms 384 KB 
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 1000005;

long long dp[N], dp2[N];

long long delivery(int N, int K, int L, int p[]) {

    int mid = L/2;
    int lstPos = -1;
    for (int i = 1; i <= N; i++){
        dp[i] = 1e18;
        int pos = p[i-1];
        dp[i] = dp[max(0, i-K)] + pos*2;
    }
    long long ans = 1e18;
    for (int i = N; i >= 1; i--){
        dp2[i] = 1e18;
        int pos = p[i-1];
        dp2[i] = dp2[min(N+1, i+K)] + (L-pos)*2;
        ans = min(ans, dp[i]+dp2[i+1]);
    }
    ans = min(ans, dp[0]+dp2[1]);
    return ans;

}

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:9:48: warning: declaration of 'N' shadows a global declaration [-Wshadow]
 long long delivery(int N, int K, int L, int p[]) {
                                                ^
boxes.cpp:5:11: note: shadowed declaration is here
 const int N = 1000005;
           ^
boxes.cpp:11:9: warning: unused variable 'mid' [-Wunused-variable]
     int mid = L/2;
         ^~~
boxes.cpp:12:9: warning: unused variable 'lstPos' [-Wunused-variable]
     int lstPos = -1;
         ^~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Incorrect 2 ms 384 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Incorrect 2 ms 384 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Incorrect 2 ms 384 KB Output isn't correct
9 Halted 0 ms 0 KB -