| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 12243 |
2014-12-25T18:28:38 Z |
pro0331 |
격자 보존하기 (GA9_preserve) |
C++ |
|
0 ms |
1124 KB |
#include <stdio.h>
#include <algorithm>
#include <functional>
int n, k, d, blank[10001];
int main()
{
int i, p;
int last = 0;
scanf("%d %d %d", &n, &k, &d);
for (i = 0; i < k; i++) {
scanf("%d", &p);
blank[i] = p - last - 1;
last = p;
}
blank[k] = n - last;
int first = blank[0];
last = blank[k];
sort(blank, blank+k+1, std::greater<int>());
int result = 0;
for (i = 0; d > 1; i++) {
result += blank[i];
if (first == blank[i]) {
first = 0;
d--;
} else if (last == blank[i]) {
last = 0;
d--;
} else {
d -= 2;
}
}
if (d == 1)
result += std::max(first, last);
else if (first + last > blank[i-1])
result = result - blank[i-1] + first + last;
printf("%d\n", result);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 11 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 12 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 13 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 17 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 19 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 20 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 21 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 22 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 23 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 24 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 25 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 26 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 27 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 28 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 29 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 30 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 31 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 32 |
Correct |
0 ms |
1124 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 11 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 12 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 13 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 17 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 19 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 20 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 21 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 22 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 23 |
Correct |
0 ms |
1124 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 11 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 12 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 13 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 17 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 19 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 20 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 21 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 22 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 23 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 24 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 25 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 26 |
Correct |
0 ms |
1124 KB |
Output is correct |
| 27 |
Correct |
0 ms |
1124 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
1124 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
1124 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
