답안 #92127

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
92127	2019-01-01T15:29:32 Z	tjrwodnjs999	격자 보존하기 (GA9_preserve)	C++11	56 / 100	23 ms	1912 KB

preserve

#include <cstdio>
#include <algorithm>
using namespace std;
 
int l, n, k, a[100010], s[100010];
 
int main(){
    scanf("%d%d%d", &l, &n, &k);
    for(int i = 0; i < n; i++) scanf("%d", a + i);
    for(int i = 1; i < n; i++) s[i] = a[i] - a[i - 1] - 1;
    sort(s + 1, s + n);
    reverse(s + 1, s + n);
    for(int i = 1; i < n; i++) s[i] += s[i - 1];
    if(k == 1) printf("%d", max(a[0] - 1, l - a[n - 1]));
    else if(k % 2) printf("%d", max(s[k / 2] + max(a[0] - 1, l - a[n - 1]), s[k / 2 - 1] + a[0] - 1 + l - a[n - 1]));
    else printf("%d", max(s[k / 2], s[k / 2 - 1] + a[0] - 1 + l - a[n - 1]));
}

Compilation message

preserve.cpp: In function 'int main()':
preserve.cpp:8:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d", &l, &n, &k);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
preserve.cpp:9:37: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 0; i < n; i++) scanf("%d", a + i);
                                ~~~~~^~~~~~~~~~~~~

Subtask #1

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 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	256 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	1 ms	376 KB	Output is correct
7	Correct	1 ms	376 KB	Output is correct
8	Incorrect	2 ms	424 KB	Output isn't correct
9	Halted	0 ms	0 KB	-

Subtask #2

17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	1 ms	376 KB	Output is correct
3	Correct	1 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	256 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	380 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	256 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	1 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	1 ms	376 KB	Output is correct
20	Correct	1 ms	256 KB	Output is correct
21	Correct	1 ms	256 KB	Output is correct
22	Correct	2 ms	256 KB	Output is correct
23	Correct	2 ms	256 KB	Output is correct

Subtask #3

22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 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	256 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	1 ms	256 KB	Output is correct
13	Correct	2 ms	256 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	1 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	2 ms	256 KB	Output is correct
20	Correct	1 ms	376 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	2 ms	256 KB	Output is correct
23	Correct	1 ms	256 KB	Output is correct
24	Correct	2 ms	256 KB	Output is correct
25	Correct	2 ms	256 KB	Output is correct
26	Correct	2 ms	256 KB	Output is correct
27	Correct	1 ms	256 KB	Output is correct

Subtask #4

17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	21 ms	1016 KB	Output is correct
2	Correct	21 ms	1144 KB	Output is correct
3	Correct	22 ms	1016 KB	Output is correct
4	Correct	22 ms	1144 KB	Output is correct
5	Correct	21 ms	1016 KB	Output is correct
6	Correct	22 ms	1144 KB	Output is correct
7	Correct	21 ms	1016 KB	Output is correct
8	Correct	22 ms	1120 KB	Output is correct
9	Correct	11 ms	760 KB	Output is correct
10	Correct	8 ms	504 KB	Output is correct
11	Correct	21 ms	1016 KB	Output is correct
12	Correct	21 ms	1016 KB	Output is correct
13	Correct	21 ms	1016 KB	Output is correct
14	Correct	20 ms	1144 KB	Output is correct
15	Correct	21 ms	1144 KB	Output is correct
16	Correct	21 ms	1016 KB	Output is correct
17	Correct	20 ms	1016 KB	Output is correct
18	Correct	20 ms	1016 KB	Output is correct
19	Correct	21 ms	1016 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	20 ms	1016 KB	Output is correct
23	Correct	21 ms	1016 KB	Output is correct
24	Correct	19 ms	1016 KB	Output is correct

Subtask #5

0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	23 ms	1912 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-