oj.uz

Submission #1049734

# Submission time Handle Problem Language Result Execution time Memory
1049734 2024-08-09T04:32:29 Z vjudge1 Stove (JOI18_stove) C++17
100 / 100
 13 ms 3184 KB 
#ifdef ONLINE_JUDGE
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif
#include <bits/stdc++.h>
#define ll long long int
#define speed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define TxtIO freopen("lol.in","r",stdin); freopen("lol.txt","w",stdout);
#define forn(i,n) for(int i=0;i<n;i++)
#define pb push_back
using namespace std;

void solve(){
    ll n,k;
    cin>>n>>k;k--;
    vector <pair<ll,ll>> v(n);
    forn(i,n){
        cin>>v[i].first;
        v[i].second=v[i].first+1;
    }
    vector <ll> razn;
    for(int i=0;i<n-1;i++){
        razn.pb(abs(v[i].second-v[i+1].first));
    }
    sort(razn.begin(),razn.end());
    ll ans=0;
    for(int i=0;i<(n-k-1);i++){
        ans+=razn[i];
    }
    ans+=n;
    cout<<ans;
}

signed main(){
    speed;
    int t=1;
    while(t--){
        solve();
    }
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 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 348 KB Output is correct
12 Correct 0 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 1 ms 344 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 348 KB Output is correct
12 Correct 0 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 11 ms 3036 KB Output is correct
17 Correct 11 ms 3036 KB Output is correct
18 Correct 13 ms 3184 KB Output is correct
19 Correct 11 ms 3032 KB Output is correct
20 Correct 11 ms 3036 KB Output is correct
21 Correct 11 ms 2956 KB Output is correct
22 Correct 11 ms 3036 KB Output is correct
23 Correct 11 ms 3036 KB Output is correct
24 Correct 11 ms 3036 KB Output is correct