oj.uz

Submission #1115228

# Submission time Handle Problem Language Result Execution time Memory
1115228 2024-11-20T08:59:15 Z staszic_ojuz Stove (JOI18_stove) C++17
100 / 100
 34 ms 1464 KB 
#include<bits/stdc++.h>
using namespace std;
int main() {
    int n, za;
    cin >> n >> za;
    vector<int> kiedy(n);
    vector<int> roz;
    za -= 1;
    for (int i = 0; i < n; i++) {
        cin >> kiedy[i];
        if (i > 0) {
            roz.push_back(kiedy[i] - kiedy[i - 1] - 1);
        }
    }
    int calosc = kiedy[kiedy.size() - 1] + 1 - kiedy[0];
    sort(roz.begin(), roz.end());
    while (za > 0 and roz.size() > 0) {
        calosc -= roz[roz.size() - 1];
        roz.pop_back();
        za -= 1;
    }
    cout << calosc;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 2 ms 336 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 2 ms 336 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 2 ms 336 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 2 ms 336 KB Output is correct
16 Correct 34 ms 1228 KB Output is correct
17 Correct 32 ms 1464 KB Output is correct
18 Correct 32 ms 1244 KB Output is correct
19 Correct 32 ms 1228 KB Output is correct
20 Correct 33 ms 1228 KB Output is correct
21 Correct 32 ms 1228 KB Output is correct
22 Correct 32 ms 1228 KB Output is correct
23 Correct 31 ms 1296 KB Output is correct
24 Correct 33 ms 1404 KB Output is correct