oj.uz

Submission #502856

# Submission time Handle Problem Language Result Execution time Memory
502856 2022-01-06T16:17:03 Z Khizri Stove (JOI18_stove) C++17
100 / 100
 22 ms 2144 KB 
#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
    if(a>b) swap(a,b);
    if(a==0) return a+b;
    return gcd(b%a,a);
}
ll lcm(ll a,ll b){
    return a/gcd(a,b)*b;
}
bool is_prime(ll n){
    ll k=sqrt(n);
    if(n==2) return true;
    if(n<2||n%2==0||k*k==n) return false;
    for(int i=3;i<=k;i+=2){
        if(n%i==0){
            return false;
        }
    }
    return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=2e5+5;
int t=1,n,k,arr[mxn];
void solve(){
    vector<int>vt;
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        cin>>arr[i];
        if(i>1){
            vt.pb(arr[i]-arr[i-1]-1);
        }
    }
    sort(rall(vt));
    int ans=arr[n]-arr[1]+1;
    for(int i=0;i<k-1;i++){
        ans-=vt[i];
    }
    cout<<ans<<endl;
}
int main(){
    IOS;
    //cin>>t;
    while(t--){
        solve();
    }
    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 320 KB Output is correct
4 Correct 0 ms 328 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 204 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 320 KB Output is correct
4 Correct 0 ms 328 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 1 ms 280 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 360 KB Output is correct
15 Correct 1 ms 332 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 320 KB Output is correct
4 Correct 0 ms 328 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 1 ms 280 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 360 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 18 ms 2116 KB Output is correct
17 Correct 19 ms 2120 KB Output is correct
18 Correct 17 ms 2092 KB Output is correct
19 Correct 20 ms 2144 KB Output is correct
20 Correct 18 ms 2100 KB Output is correct
21 Correct 18 ms 2136 KB Output is correct
22 Correct 19 ms 2108 KB Output is correct
23 Correct 22 ms 2112 KB Output is correct
24 Correct 17 ms 2116 KB Output is correct