oj.uz

답안 #875627

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
875627 2023-11-20T08:45:24 Z TahirAliyev Stove (JOI18_stove) C++17
100 / 100
 38 ms 1684 KB 
#include <bits/stdc++.h>
using namespace std;


#define ll long long int
#define pii pair<int, int>
#define oo 1e9

const int MAX = 1e5 + 5;

int n, k;
int arr[MAX];
vector<int> v;

int main(){
    cin >> n >> k;
    for(int i = 1; i <= n; i++){
        cin >> arr[i];
    }
    for(int i = 2; i <= n; i++){
        if(arr[i] - arr[i - 1] - 1 > 0){
            v.push_back(arr[i] - arr[i - 1] - 1);
        }
    }
    if(k >= v.size() + 1){
        cout << n << '\n';
        return 0;
    }
    sort(v.begin(), v.end());
    int ans = n;
    for(int i = 0; i < v.size() + 1 - k; i++){
        ans += v[i];
    }
    cout << ans << '\n';
}

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:25:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |     if(k >= v.size() + 1){
      |        ~~^~~~~~~~~~~~~~~
stove.cpp:31:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     for(int i = 0; i < v.size() + 1 - k; i++){
      |                    ~~^~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 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 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 600 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 2 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 35 ms 1252 KB Output is correct
17 Correct 34 ms 1240 KB Output is correct
18 Correct 33 ms 1240 KB Output is correct
19 Correct 34 ms 1240 KB Output is correct
20 Correct 34 ms 1400 KB Output is correct
21 Correct 34 ms 1340 KB Output is correct
22 Correct 34 ms 1240 KB Output is correct
23 Correct 38 ms 1684 KB Output is correct
24 Correct 33 ms 1236 KB Output is correct