oj.uz

Submission #391017

# Submission time Handle Problem Language Result Execution time Memory
391017 2021-04-17T15:07:43 Z Blistering_Barnacles Stove (JOI18_stove) C++11
100 / 100
 38 ms 16284 KB 
//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
using namespace std;
typedef long long ll;
ll q, dp[105][100005], a[555555] , b[555555], k, l, m, n, o, p;
map < char , ll > mp;
vll adj[555555];
const ll mod = 1e9+7;
str s;
void solve(){
    cin >> n >> k;
    for(ll i = 1 ; i <= n ; i++){
        cin >> a[i] ;
    }
    sort(a + 1 , a + n + 1) ;
    vll v ;
    for(ll i = 2 ; i <= n ; i++){
        v.pb(a[i] - a[i - 1] - 1) ;
    }
    sort(all(v)) ;
    reverse(all(v)) ;
    o = 0 ;
    for(ll i = 1 ; i < k ; i++)o += v[i - 1] ;
    cout << a[n] - a[1] + 1 - o << endl;
}
int main(){
    fast ;
    //cin >> q;
    q = 1;
    while(q--){
        solve();
    }
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 13260 KB Output is correct
2 Correct 9 ms 13480 KB Output is correct
3 Correct 9 ms 13376 KB Output is correct
4 Correct 9 ms 13260 KB Output is correct
5 Correct 9 ms 13344 KB Output is correct
6 Correct 9 ms 13260 KB Output is correct
7 Correct 9 ms 13260 KB Output is correct
8 Correct 9 ms 13368 KB Output is correct
9 Correct 10 ms 13260 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 13260 KB Output is correct
2 Correct 9 ms 13480 KB Output is correct
3 Correct 9 ms 13376 KB Output is correct
4 Correct 9 ms 13260 KB Output is correct
5 Correct 9 ms 13344 KB Output is correct
6 Correct 9 ms 13260 KB Output is correct
7 Correct 9 ms 13260 KB Output is correct
8 Correct 9 ms 13368 KB Output is correct
9 Correct 10 ms 13260 KB Output is correct
10 Correct 10 ms 13388 KB Output is correct
11 Correct 10 ms 13384 KB Output is correct
12 Correct 10 ms 13384 KB Output is correct
13 Correct 10 ms 13404 KB Output is correct
14 Correct 10 ms 13388 KB Output is correct
15 Correct 10 ms 13388 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 13260 KB Output is correct
2 Correct 9 ms 13480 KB Output is correct
3 Correct 9 ms 13376 KB Output is correct
4 Correct 9 ms 13260 KB Output is correct
5 Correct 9 ms 13344 KB Output is correct
6 Correct 9 ms 13260 KB Output is correct
7 Correct 9 ms 13260 KB Output is correct
8 Correct 9 ms 13368 KB Output is correct
9 Correct 10 ms 13260 KB Output is correct
10 Correct 10 ms 13388 KB Output is correct
11 Correct 10 ms 13384 KB Output is correct
12 Correct 10 ms 13384 KB Output is correct
13 Correct 10 ms 13404 KB Output is correct
14 Correct 10 ms 13388 KB Output is correct
15 Correct 10 ms 13388 KB Output is correct
16 Correct 32 ms 16268 KB Output is correct
17 Correct 32 ms 16200 KB Output is correct
18 Correct 31 ms 16204 KB Output is correct
19 Correct 37 ms 16228 KB Output is correct
20 Correct 33 ms 16284 KB Output is correct
21 Correct 31 ms 16204 KB Output is correct
22 Correct 38 ms 16260 KB Output is correct
23 Correct 32 ms 16264 KB Output is correct
24 Correct 32 ms 16248 KB Output is correct