oj.uz

Submission #12669

# Submission time Handle Problem Language Result Execution time Memory
12669 2014-12-28T09:22:03 Z kipa00 격자 보존하기 (GA9_preserve) C++
56 / 100
 28 ms 2372 KB 
#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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1600 KB Output is correct
2 Correct 0 ms 1600 KB Output is correct
3 Correct 0 ms 1600 KB Output is correct
4 Correct 0 ms 1600 KB Output is correct
5 Correct 0 ms 1600 KB Output is correct
6 Correct 0 ms 1600 KB Output is correct
7 Correct 0 ms 1600 KB Output is correct
8 Runtime error 0 ms 1600 KB open (syscall #2) was called by the program (disallowed syscall)
9 Halted 0 ms 0 KB -

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1600 KB Output is correct
2 Correct 0 ms 1600 KB Output is correct
3 Correct 0 ms 1600 KB Output is correct
4 Correct 0 ms 1600 KB Output is correct
5 Correct 0 ms 1600 KB Output is correct
6 Correct 0 ms 1600 KB Output is correct
7 Correct 0 ms 1600 KB Output is correct
8 Correct 0 ms 1600 KB Output is correct
9 Correct 0 ms 1600 KB Output is correct
10 Correct 0 ms 1600 KB Output is correct
11 Correct 0 ms 1600 KB Output is correct
12 Correct 0 ms 1600 KB Output is correct
13 Correct 0 ms 1600 KB Output is correct
14 Correct 0 ms 1600 KB Output is correct
15 Correct 0 ms 1600 KB Output is correct
16 Correct 0 ms 1600 KB Output is correct
17 Correct 0 ms 1600 KB Output is correct
18 Correct 0 ms 1600 KB Output is correct
19 Correct 0 ms 1600 KB Output is correct
20 Correct 0 ms 1600 KB Output is correct
21 Correct 0 ms 1600 KB Output is correct
22 Correct 0 ms 1600 KB Output is correct
23 Correct 0 ms 1600 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1600 KB Output is correct
2 Correct 0 ms 1600 KB Output is correct
3 Correct 0 ms 1600 KB Output is correct
4 Correct 0 ms 1600 KB Output is correct
5 Correct 0 ms 1600 KB Output is correct
6 Correct 0 ms 1600 KB Output is correct
7 Correct 0 ms 1600 KB Output is correct
8 Correct 0 ms 1600 KB Output is correct
9 Correct 0 ms 1600 KB Output is correct
10 Correct 0 ms 1600 KB Output is correct
11 Correct 0 ms 1600 KB Output is correct
12 Correct 0 ms 1600 KB Output is correct
13 Correct 0 ms 1600 KB Output is correct
14 Correct 0 ms 1600 KB Output is correct
15 Correct 0 ms 1600 KB Output is correct
16 Correct 0 ms 1600 KB Output is correct
17 Correct 0 ms 1600 KB Output is correct
18 Correct 0 ms 1600 KB Output is correct
19 Correct 0 ms 1600 KB Output is correct
20 Correct 0 ms 1600 KB Output is correct
21 Correct 0 ms 1600 KB Output is correct
22 Correct 0 ms 1600 KB Output is correct
23 Correct 0 ms 1600 KB Output is correct
24 Correct 0 ms 1600 KB Output is correct
25 Correct 0 ms 1600 KB Output is correct
26 Correct 0 ms 1600 KB Output is correct
27 Correct 0 ms 1600 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 2372 KB Output is correct
2 Correct 24 ms 2372 KB Output is correct
3 Correct 16 ms 2372 KB Output is correct
4 Correct 24 ms 2372 KB Output is correct
5 Correct 8 ms 2372 KB Output is correct
6 Correct 4 ms 2372 KB Output is correct
7 Correct 20 ms 2372 KB Output is correct
8 Correct 20 ms 2372 KB Output is correct
9 Correct 12 ms 1988 KB Output is correct
10 Correct 4 ms 1732 KB Output is correct
11 Correct 16 ms 2372 KB Output is correct
12 Correct 24 ms 2372 KB Output is correct
13 Correct 12 ms 2372 KB Output is correct
14 Correct 16 ms 2372 KB Output is correct
15 Correct 24 ms 2372 KB Output is correct
16 Correct 20 ms 2372 KB Output is correct
17 Correct 20 ms 2372 KB Output is correct
18 Correct 16 ms 2372 KB Output is correct
19 Correct 8 ms 2372 KB Output is correct
20 Correct 0 ms 1600 KB Output is correct
21 Correct 0 ms 1600 KB Output is correct
22 Correct 16 ms 2372 KB Output is correct
23 Correct 16 ms 2372 KB Output is correct
24 Correct 16 ms 2372 KB Output is correct

Subtask #5
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Runtime error 28 ms 2372 KB SIGSEGV Segmentation fault
2 Halted 0 ms 0 KB -