oj.uz

답안 #1073326

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1073326 2024-08-24T12:31:59 Z RKHTM Stove (JOI18_stove) C++14
100 / 100
 17 ms 3544 KB 
#include <bits/stdc++.h>
using namespace std;
#define yasuho ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
typedef long long ll;
const ll MOD = 1e9+7;

/*
1 2 5 6 8 11 13 15 16 20
 1 3 1 2 3  2  2  1  4
   ^   ^ ^           ^
*/

void solve(){
    ll n, k; cin >> n >> k;
    vector<ll> v(n+1);
    for(int i=1; i<=n; i++) cin >> v[i];

    ll ans = v.back()+1-v[1];
    vector<ll> u;
    for(int i=2; i<=n; i++){
        u.push_back(v[i]-v[i-1]);
    }

    sort(u.begin(), u.end(), greater<ll>());
    for(int i=0; i<u.size() and i<k-1; i++){
        // cout << u[i] << ' ';
        ans -= u[i]-1;
    }

    cout << ans << endl;

    return;
}

int main(){
    yasuho // remove for interactive problem
    ll t;
    t = 1;
    //cin >> t;
    while(t--) solve();
}

Compilation message

stove.cpp: In function 'void solve()':
stove.cpp:26:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |     for(int i=0; i<u.size() and i<k-1; i++){
      |                  ~^~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 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 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 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 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 516 KB Output is correct
12 Correct 1 ms 600 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 512 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 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 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 516 KB Output is correct
12 Correct 1 ms 600 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 512 KB Output is correct
16 Correct 13 ms 3292 KB Output is correct
17 Correct 13 ms 3292 KB Output is correct
18 Correct 14 ms 3292 KB Output is correct
19 Correct 14 ms 3288 KB Output is correct
20 Correct 15 ms 3292 KB Output is correct
21 Correct 13 ms 3284 KB Output is correct
22 Correct 13 ms 3544 KB Output is correct
23 Correct 17 ms 3308 KB Output is correct
24 Correct 14 ms 3292 KB Output is correct