답안 #13179 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
13179	2015-02-01T13:29:23 Z	yourID	격자 보존하기 (GA9_preserve)	C++	91 / 100	795 ms	2376 KB

preserve

#include <cstdio>
#include <queue>
using namespace std;
 
priority_queue<int, vector<int>, less<int> > put;
int horse[100000];
 
int main() {
    int start, end, n, k, d;
    int i;
    scanf("%d %d %d", &n, &k, &d);
    for (i=0; i<k; ++i) {
        scanf("%d", &horse[i]);
    }
    start = horse[0] - 1;
    end = n - horse[k - 1];
    for (i=1; i<k; ++i) {
        put.push(horse[i] - horse[i - 1] - 1);
    }
    if (d == 1) printf("%d\n", (start > end) ? start : end);
    else if (d == 2) printf("%d\n", (start + end > put.top()) ? (start + end) : put.top());
    else {
        int nd = d - 2;
        int now = 0, max = -1;
        for (i=0; i<nd/2; ++i) {
            now += put.top();
            put.pop();
        }
        nd %= 2;
        nd += 2;
        if (nd == 3) {
            max = put.top() + start;
            if (max < put.top() + end) {
                max = put.top() + end;
            }
            if (max < start + end) {
                max = start + end;
            }
        } else if (nd == 2) {
            max = start + end;
            if (max < put.top()) {
                max = put.top();
            }
        }
        printf("%d\n", now + max);
    }
    return 0;
}

Subtask #1
0.0 / 9.0

#	결과	메모리	Grader output
1	Correct	1604 KB	Output is correct
2	Correct	1604 KB	Output is correct
3	Correct	1604 KB	Output is correct
4	Correct	1604 KB	Output is correct
5	Correct	1604 KB	Output is correct
6	Correct	1604 KB	Output is correct
7	Correct	1604 KB	Output is correct
8	Incorrect	1604 KB	Output isn't correct
9	Halted	0 KB	-

Subtask #2
17.0 / 17.0

#	결과	메모리	Grader output
1	Correct	1604 KB	Output is correct
2	Correct	1604 KB	Output is correct
3	Correct	1604 KB	Output is correct
4	Correct	1604 KB	Output is correct
5	Correct	1604 KB	Output is correct
6	Correct	1604 KB	Output is correct
7	Correct	1604 KB	Output is correct
8	Correct	1604 KB	Output is correct
9	Correct	1604 KB	Output is correct
10	Correct	1604 KB	Output is correct
11	Correct	1604 KB	Output is correct
12	Correct	1604 KB	Output is correct
13	Correct	1604 KB	Output is correct
14	Correct	1604 KB	Output is correct
15	Correct	1604 KB	Output is correct
16	Correct	1604 KB	Output is correct
17	Correct	1604 KB	Output is correct
18	Correct	1604 KB	Output is correct
19	Correct	1604 KB	Output is correct
20	Correct	1604 KB	Output is correct
21	Correct	1604 KB	Output is correct
22	Correct	1604 KB	Output is correct
23	Correct	1604 KB	Output is correct

Subtask #3
22.0 / 22.0

#	결과	메모리	Grader output
1	Correct	1604 KB	Output is correct
2	Correct	1604 KB	Output is correct
3	Correct	1604 KB	Output is correct
4	Correct	1604 KB	Output is correct
5	Correct	1604 KB	Output is correct
6	Correct	1604 KB	Output is correct
7	Correct	1604 KB	Output is correct
8	Correct	1604 KB	Output is correct
9	Correct	1604 KB	Output is correct
10	Correct	1604 KB	Output is correct
11	Correct	1604 KB	Output is correct
12	Correct	1604 KB	Output is correct
13	Correct	1604 KB	Output is correct
14	Correct	1604 KB	Output is correct
15	Correct	1604 KB	Output is correct
16	Correct	1604 KB	Output is correct
17	Correct	1604 KB	Output is correct
18	Correct	1604 KB	Output is correct
19	Correct	1604 KB	Output is correct
20	Correct	1604 KB	Output is correct
21	Correct	1604 KB	Output is correct
22	Correct	1604 KB	Output is correct
23	Correct	1604 KB	Output is correct
24	Correct	1604 KB	Output is correct
25	Correct	1604 KB	Output is correct
26	Correct	1604 KB	Output is correct
27	Correct	1604 KB	Output is correct

Subtask #4
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	24 ms	2376 KB	Output is correct
2	Correct	26 ms	2376 KB	Output is correct
3	Correct	17 ms	2376 KB	Output is correct
4	Correct	23 ms	2376 KB	Output is correct
5	Correct	25 ms	2376 KB	Output is correct
6	Correct	21 ms	2376 KB	Output is correct
7	Correct	18 ms	2376 KB	Output is correct
8	Correct	19 ms	2376 KB	Output is correct
9	Correct	11 ms	1992 KB	Output is correct
10	Correct	6 ms	1736 KB	Output is correct
11	Correct	23 ms	2376 KB	Output is correct
12	Correct	22 ms	2376 KB	Output is correct
13	Correct	19 ms	2376 KB	Output is correct
14	Correct	8 ms	2376 KB	Output is correct
15	Correct	21 ms	2376 KB	Output is correct
16	Correct	0 ms	2376 KB	Output is correct
17	Correct	0 ms	2376 KB	Output is correct
18	Correct	20 ms	2376 KB	Output is correct
19	Correct	20 ms	2376 KB	Output is correct
20	Correct	0 ms	1604 KB	Output is correct
21	Correct	0 ms	1604 KB	Output is correct
22	Correct	17 ms	2376 KB	Output is correct
23	Correct	12 ms	2376 KB	Output is correct
24	Correct	19 ms	2376 KB	Output is correct

Subtask #5
35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	795 ms	2376 KB	Output is correct
2	Correct	313 ms	2376 KB	Output is correct
3	Correct	25 ms	2376 KB	Output is correct
4	Correct	22 ms	2376 KB	Output is correct
5	Correct	14 ms	2376 KB	Output is correct
6	Correct	21 ms	2376 KB	Output is correct
7	Correct	18 ms	2376 KB	Output is correct
8	Correct	13 ms	2376 KB	Output is correct
9	Correct	13 ms	1992 KB	Output is correct
10	Correct	8 ms	1736 KB	Output is correct
11	Correct	0 ms	2376 KB	Output is correct
12	Correct	16 ms	2376 KB	Output is correct
13	Correct	18 ms	2376 KB	Output is correct
14	Correct	18 ms	2376 KB	Output is correct
15	Correct	21 ms	2376 KB	Output is correct
16	Correct	15 ms	2376 KB	Output is correct
17	Correct	23 ms	2376 KB	Output is correct
18	Correct	16 ms	2376 KB	Output is correct
19	Correct	16 ms	2376 KB	Output is correct
20	Correct	25 ms	2376 KB	Output is correct

답안 #13179

Compilation message

Subtask #1 0.0 / 9.0

Subtask #2 17.0 / 17.0

Subtask #3 22.0 / 22.0

Subtask #4 17.0 / 17.0

Subtask #5 35.0 / 35.0

Subtask #1
0.0 / 9.0

Subtask #2
17.0 / 17.0

Subtask #3
22.0 / 22.0

Subtask #4
17.0 / 17.0

Subtask #5
35.0 / 35.0