Submission #217839

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
217839	2020-03-31T02:15:03 Z	DavidDamian	Boxes with souvenirs (IOI15_boxes)	C++11	20 / 100	5 ms	384 KB

boxes

#include "boxes.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
long long delivery(int N, int K, int L, int p[]) {
    ll total=0;
    int remaining=K;
    int a=0,b=N-1;
    int last=-1;
    while(a<=b){
        ll distA;
        ll distB;
        int selected=0;
        if(remaining==K){
            distA=min(p[a],L-p[a]);
            distB=min(p[b],L-p[b]);
            if(distA<=distB) selected=a;
            else selected=b;
            total+=(selected==a)? distA : distB;
        }
        else{
            distA=min(abs(p[a]-p[last]),L-abs(p[a]-p[last]));
            distB=min(abs(p[b]-p[last]),L-abs(p[b]-p[last]));
            if(distA<=distB) selected=a;
            else selected=b;
            total+=(selected==a)? distA : distB;
        }
        remaining--;
        if(remaining==0 || a==b){
            distA=min(p[a],L-p[a]);
            distB=min(p[b],L-p[b]);
            total+=(selected==a)? distA : distB;
            remaining=K;
        }
        last=selected;
        if(selected==a) a++;
        else b--;
    }
    return total;
}

Subtask #1

10.0 / 10.0

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

Subtask #2

10.0 / 10.0

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

Subtask #3

0 / 15.0

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

Subtask #4

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	4 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	5 ms	256 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	4 ms	384 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	5 ms	256 KB	Output is correct
15	Correct	4 ms	384 KB	Output is correct
16	Correct	4 ms	256 KB	Output is correct
17	Correct	5 ms	256 KB	Output is correct
18	Correct	5 ms	256 KB	Output is correct
19	Correct	4 ms	256 KB	Output is correct
20	Correct	5 ms	256 KB	Output is correct
21	Incorrect	4 ms	256 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #5

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	4 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	5 ms	256 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	4 ms	384 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	5 ms	256 KB	Output is correct
15	Correct	4 ms	384 KB	Output is correct
16	Correct	4 ms	256 KB	Output is correct
17	Correct	5 ms	256 KB	Output is correct
18	Correct	5 ms	256 KB	Output is correct
19	Correct	4 ms	256 KB	Output is correct
20	Correct	5 ms	256 KB	Output is correct
21	Incorrect	4 ms	256 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #6

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	4 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	5 ms	256 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	4 ms	384 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	5 ms	256 KB	Output is correct
15	Correct	4 ms	384 KB	Output is correct
16	Correct	4 ms	256 KB	Output is correct
17	Correct	5 ms	256 KB	Output is correct
18	Correct	5 ms	256 KB	Output is correct
19	Correct	4 ms	256 KB	Output is correct
20	Correct	5 ms	256 KB	Output is correct
21	Incorrect	4 ms	256 KB	Output isn't correct
22	Halted	0 ms	0 KB	-