oj.uz

Submission #1093889

# Submission time Handle Problem Language Result Execution time Memory
1093889 2024-09-28T02:38:25 Z InvMOD Stove (JOI18_stove) C++14
100 / 100
 16 ms 2384 KB 
#include<bits/stdc++.h>

using namespace std;


void solve()
{
    int n,k; cin >> n >> k;

    vector<int> T(n+1, 0);
    for(int i = 1; i <= n; i++){
        cin >> T[i];
    }

    int answer = (T[n] + 1) - T[1];
    // don't count last time cause that's when JOI turn off

    vector<int> minimize;
    for(int i = 2; i <= n; i++){
        // turn off at T[i-1] + 1, turn on again at T[i]
        minimize.push_back(-((T[i]-1) - T[i-1]));
    }

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

    for(int i = 0; i < min((int)minimize.size(), k-1); i++){
        if(!minimize[i]) break;
        answer = answer + minimize[i];
    }
    cout << answer <<"\n";
}

int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    #define name "InvMOD"
    if(fopen(name".INP", "r")){
        freopen(name".INP", "r", stdin);
        freopen(name".OUT", "w", stdout);
    }

    solve();
    return 0;
}

Compilation message

stove.cpp: In function 'int32_t main()':
stove.cpp:39:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |         freopen(name".INP", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
stove.cpp:40:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |         freopen(name".OUT", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
50.0 / 50.0

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