oj.uz

Submission #67764

# Submission time Handle Problem Language Result Execution time Memory
67764 2018-08-15T09:40:01 Z theknife2001 Boxes with souvenirs (IOI15_boxes) C++17
0 / 100
 2 ms 376 KB 
#include "boxes.h"
//#include "grader.cpp"
#include <bits/stdc++.h>

using namespace std;
const int N=1e7+55;
long long dp[N][2];
int n;

long long delivery(int N, int k, int L, int p[])
{
    n=N;
    int x;
    int temp=0;
    bool q=0;
    for(int i=0;i<n;i++)
    {
        x=k;
        while(x--&&i<n)
        {
            while(p[i]==0)
                i++;
            dp[i][0]=temp+p[i];
            i++;
        }
        i--;
        temp+=p[i]+min(p[i],L-p[i]);
    }
    temp=0;
    for(int i=n-1;i>=0;i--)
    {
        x=k;
        while(x--&&i>=0)
        {
            while(p[i]==0)
                i--;
            dp[i][1]=temp+(L-p[i]);
            i--;
        }
        i++;
        temp+=L-p[i]+min(p[i],L-p[i]);
    }
    long long ans=1e18+55;
    for(int i=0;i<n;i++)
    {
        ans=min(dp[i][0]+(i+1<n?dp[i+1][1]:0)+min(p[i],L-p[i])+(i+1<n?min(p[i+1],L-p[i+1]):0),ans);
    }
    return ans;
}

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:10:48: warning: declaration of 'N' shadows a global declaration [-Wshadow]
 long long delivery(int N, int k, int L, int p[])
                                                ^
boxes.cpp:6:11: note: shadowed declaration is here
 const int N=1e7+55;
           ^
boxes.cpp:15:10: warning: unused variable 'q' [-Wunused-variable]
     bool q=0;
          ^

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 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 376 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 256 KB Output is correct
2 Incorrect 2 ms 372 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

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

Subtask #6
0 / 30.0

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