oj.uz

Submission #736342

# Submission time Handle Problem Language Result Execution time Memory
736342 2023-05-05T13:13:29 Z oyber Stove (JOI18_stove) C++14
100 / 100
 24 ms 1884 KB 
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    int n, k;
    scanf("%d %d", &n, &k);

    vector<int> diffs;
    int before = 0;
    int first = 0;
    for (int i = 0; i < n; i++) {
        int t;
        scanf("%d", &t);

        if (i != 0) {
            int diff = t-before-1;
            diffs.push_back(-diff);
        } else {
            first = t;
        }
        before = t;
    }

    sort(diffs.begin(), diffs.end());

    int wait = before-first+1;
    for (int i = 0; i < k-1; i++) {
        wait += diffs[i];
    }
    printf("%d\n", wait);
}

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:8:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |     scanf("%d %d", &n, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~
stove.cpp:15:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |         scanf("%d", &t);
      |         ~~~~~^~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 288 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 288 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 288 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 288 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 296 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 288 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 288 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 296 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 18 ms 1712 KB Output is correct
17 Correct 20 ms 1696 KB Output is correct
18 Correct 20 ms 1792 KB Output is correct
19 Correct 24 ms 1884 KB Output is correct
20 Correct 21 ms 1784 KB Output is correct
21 Correct 20 ms 1744 KB Output is correct
22 Correct 19 ms 1712 KB Output is correct
23 Correct 19 ms 1736 KB Output is correct
24 Correct 19 ms 1680 KB Output is correct