oj.uz

Submission #20976

# Submission time Handle Problem Language Result Execution time Memory
20976 2017-03-26T04:39:39 Z kimjihoon 격자 보존하기 (GA9_preserve) C++
0 / 100
 0 ms 1160 KB 
#include <stdio.h>
#include <algorithm>
using namespace std;
int n, k, d, a, m[11111], c, t;
int main()
{
    scanf("%d %d %d", &n, &k, &d);
    for(int i = 1; i <= k; i++){
        scanf("%d", &a);
        m[i] = a-t-1;
        t = a;
    }
    m[k+1] = n - t;
    if(d % 2 == 0)m[1] += m[k+1];
    else {
        if(m[1] > m[k+1])c += m[1];
        else c += m[k+1];
        m[1] = 0;
    }
    sort(m+1, m+k+1);
    for(int i = k; k-i+1 <= d/2 && k-i+1 <= k; i--)c += m[i];
    printf("%d\n", c);
    return 0;
}

Compilation message

preserve.cpp: In function 'int main()':
preserve.cpp:7:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d", &n, &k, &d);
                                  ^
preserve.cpp:9:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a);
                        ^

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1160 KB Output is correct
2 Correct 0 ms 1160 KB Output is correct
3 Correct 0 ms 1160 KB Output is correct
4 Correct 0 ms 1160 KB Output is correct
5 Correct 0 ms 1160 KB Output is correct
6 Correct 0 ms 1160 KB Output is correct
7 Correct 0 ms 1160 KB Output is correct
8 Incorrect 0 ms 1160 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1160 KB Output is correct
2 Correct 0 ms 1160 KB Output is correct
3 Correct 0 ms 1160 KB Output is correct
4 Correct 0 ms 1160 KB Output is correct
5 Correct 0 ms 1160 KB Output is correct
6 Correct 0 ms 1160 KB Output is correct
7 Correct 0 ms 1160 KB Output is correct
8 Correct 0 ms 1160 KB Output is correct
9 Correct 0 ms 1160 KB Output is correct
10 Correct 0 ms 1160 KB Output is correct
11 Correct 0 ms 1160 KB Output is correct
12 Correct 0 ms 1160 KB Output is correct
13 Correct 0 ms 1160 KB Output is correct
14 Correct 0 ms 1160 KB Output is correct
15 Correct 0 ms 1160 KB Output is correct
16 Correct 0 ms 1160 KB Output is correct
17 Correct 0 ms 1160 KB Output is correct
18 Correct 0 ms 1160 KB Output is correct
19 Incorrect 0 ms 1160 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

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

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1160 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1160 KB Output isn't correct
2 Halted 0 ms 0 KB -