Submission #67723

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
67723	2018-08-15T09:10:04 Z	theknife2001	Boxes with souvenirs (IOI15_boxes)	C++17	20 / 100	2 ms	376 KB

boxes

#include "boxes.h"
#include <bits/stdc++.h>

using namespace std;
const int N=1e6+55;
bool vis[N];
int n;

long long delivery(int N, int k, int L, int p[])
{
    n=N;
    int x;
    int temp=0;
    bool q=0;
    long long ans=0;
    for(int i=0;i<n;i++)
    {
        x=k;
        temp=0;
        while(x--&&i<n)
        {
            if(p[i]==0)
            {
                vis[i]=1;
                i++;
            }
            if(p[i]-temp<=L-(p[i]-temp))
            {
                temp=p[i];
                vis[i]=1;
                i++;
            }
            else
            {
                q=1;
                break;
            }
        }
        i--;
        ans+=temp+min(temp,L-temp);
        if(q)
            break;
    }
    for(int i=n-1;i>=0&&vis[i]==0;i--)
    {
        x=k;
        temp=0;
        if(vis[i])
            break;
        while(x--&&!vis[i]&&i<n)
        {
            temp=p[i];
            i--;
        }
        i++;
        ans+=L-temp+L-temp;
    }
    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=1e6+55;
           ^

Subtask #1

10.0 / 10.0

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

Subtask #2

10.0 / 10.0

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

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	308 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	2 ms	348 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Incorrect	2 ms	376 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #5

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	308 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	2 ms	348 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Incorrect	2 ms	376 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #6

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	308 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	2 ms	348 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Incorrect	2 ms	376 KB	Output isn't correct
16	Halted	0 ms	0 KB	-