Submission #968519

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
968519	2024-04-23T14:18:17 Z	duckindog	Boxes with souvenirs (IOI15_boxes)	C++17	10 / 100	1 ms	460 KB

boxes

#include <bits/stdc++.h>

using namespace std;

#ifndef LOCAL
#include "boxes.h"
#endif

long long delivery(int n, int k, int l, int p[]) {
  if (k == 1 || k == n) { 
    long long answer = 0;
    for (int i = 0; i < n; ++i) answer += min(p[i], l - p[i]);
    if (k == 1) return answer << 1;
    return min(1ll * l, answer << 1);
  }
}

#ifdef LOCAL
const int N = 10'000'000 + 10;
int n, k, l;
int p[N];

int32_t main() { 
  cin.tie(0)->sync_with_stdio(0);

  cin >> n >> k >> l;
  for (int i = 0; i < n; ++i) cin >> p[i];

  cout << delivery(n, k, l, p) << "\n";
}
#endif

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:16:1: warning: control reaches end of non-void function [-Wreturn-type]
   16 | }
      | ^

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	356 KB	Output is correct
2	Correct	1 ms	356 KB	Output is correct
3	Correct	0 ms	360 KB	Output is correct
4	Correct	1 ms	360 KB	Output is correct
5	Correct	1 ms	360 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	460 KB	Output is correct

Subtask #2

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	360 KB	Output is correct
2	Correct	1 ms	448 KB	Output is correct
3	Incorrect	1 ms	352 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #3

0 / 15.0

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

Subtask #4

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	356 KB	Output is correct
2	Correct	1 ms	356 KB	Output is correct
3	Correct	0 ms	360 KB	Output is correct
4	Correct	1 ms	360 KB	Output is correct
5	Correct	1 ms	360 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	460 KB	Output is correct
8	Correct	0 ms	360 KB	Output is correct
9	Correct	1 ms	448 KB	Output is correct
10	Incorrect	1 ms	352 KB	Output isn't correct
11	Halted	0 ms	0 KB	-

Subtask #5

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	356 KB	Output is correct
2	Correct	1 ms	356 KB	Output is correct
3	Correct	0 ms	360 KB	Output is correct
4	Correct	1 ms	360 KB	Output is correct
5	Correct	1 ms	360 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	460 KB	Output is correct
8	Correct	0 ms	360 KB	Output is correct
9	Correct	1 ms	448 KB	Output is correct
10	Incorrect	1 ms	352 KB	Output isn't correct
11	Halted	0 ms	0 KB	-

Subtask #6

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	356 KB	Output is correct
2	Correct	1 ms	356 KB	Output is correct
3	Correct	0 ms	360 KB	Output is correct
4	Correct	1 ms	360 KB	Output is correct
5	Correct	1 ms	360 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	460 KB	Output is correct
8	Correct	0 ms	360 KB	Output is correct
9	Correct	1 ms	448 KB	Output is correct
10	Incorrect	1 ms	352 KB	Output isn't correct
11	Halted	0 ms	0 KB	-