oj.uz

Submission #960992

# Submission time Handle Problem Language Result Execution time Memory
960992 2024-04-11T10:48:24 Z aminjon__ Stove (JOI18_stove) C++17
100 / 100
 18 ms 2188 KB 
#include<bits/stdc++.h>
#define all(x) (x).begin() , (x).end()
#define endl '\n'
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
using namespace std;
void solve(){
    int n , k;
    cin >> n >> k;
    vector <int> t(n);
    vector <int> gaps(n);
    for(int i = 0;i < n;i++){
    	cin >> t[i];
    	if(i > 0){
    		gaps[i] = t[i]-t[i-1]-1; 
    	}
    }
    
    int ans = t[n-1]-t[0]+1;
    sort(gaps.begin()+1 , gaps.end() ,greater<ll>());
    for(int j = 0;j < gaps.size();j++){
    	if(k > 0){
    		k--;
    		ans -= gaps[j];
    	}
    }
    cout<<ans<<endl;
}
int main(){
    ios_base::sync_with_stdio(NULL);
    cin.tie(NULL);
    cout.tie(NULL);
    ll t=1;
    //cin>>t;
    while(t--){
        solve();
    }
    return 0;  
}

Compilation message

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

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 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 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 600 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 344 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 600 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 344 KB Output is correct
16 Correct 18 ms 2136 KB Output is correct
17 Correct 18 ms 2140 KB Output is correct
18 Correct 15 ms 2140 KB Output is correct
19 Correct 14 ms 2136 KB Output is correct
20 Correct 15 ms 2136 KB Output is correct
21 Correct 15 ms 2136 KB Output is correct
22 Correct 14 ms 2136 KB Output is correct
23 Correct 15 ms 2140 KB Output is correct
24 Correct 17 ms 2188 KB Output is correct