Submission #71779

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
71779	2018-08-25T15:29:07 Z	zubec	Boxes with souvenirs (IOI15_boxes)	C++14	10 / 100	3 ms	476 KB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int N = 10000010;

int n, k, l, a[N];
long long delivery(int N, int K, int L, int p[]) {
    ll ans1 = 0, ans2 = 0;
    n = N;
    k = K;
    l = L;
    for (int i = 1; i <= n; i++)
        a[i] = p[i-1];
    for (int i = 1; i <= n; i+=k){
        int nxt = min(n, i+k-1);
        ans1 += min(a[i], l-a[i]);
        ans1 += abs(a[i]-a[nxt]);
        ans1 += min(a[nxt], l-a[nxt]);
    }
    reverse(a+1, a+n+1);
    for (int i = 1; i <= n; i+=k){
        int nxt = min(n, i+k-1);
        ans2 += min(a[i], l-a[i]);
        ans2 += abs(a[i]-a[nxt]);
        ans2 += min(a[nxt], l-a[nxt]);
    }
    return min(ans1, ans2);

}

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:6:11: note: shadowed declaration is here
 const int N = 10000010;
           ^

Subtask #1

10.0 / 10.0

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

Subtask #2

0 / 10.0

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

Subtask #3

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Incorrect	2 ms	368 KB	Output isn't correct
6	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	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	404 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	3 ms	348 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	476 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Incorrect	2 ms	376 KB	Output isn't correct
13	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	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	404 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	3 ms	348 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	476 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Incorrect	2 ms	376 KB	Output isn't correct
13	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	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	404 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	3 ms	348 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	476 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Incorrect	2 ms	376 KB	Output isn't correct
13	Halted	0 ms	0 KB	-