oj.uz

답안 #199602

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
199602 2020-02-02T07:36:12 Z zaneyu Stove (JOI18_stove) C++14
100 / 100
 83 ms 3076 KB 
/*input
3 1
1
2
6
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld double
#define pii pair<ll,ll>
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=1e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=ll(1e9+7);
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
ll mult(ll a,ll b){
    return (a*b)%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
int main() {
    int n,k;
    cin>>n>>k;
    vector<ll> arr;
    ll gaps[n-1];
    for(int i=0;i<n;i++){
        int x;
        cin>>x;
        arr.pb(x);
    }
    for(int i=1;i<sz(arr);i++) {
        gaps[i-1]=arr[i]-arr[i-1];
    }
    MNTO(k,sz(arr));
    n=sz(arr);
    sort(gaps,gaps+n-1);
    long long ans=0;
    for(int i=n-2;i>n-k-1 and i>=0;i--) {
        ans+=gaps[i];
    }
    cout<<arr[n-1]-arr[0]-ans+k;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 7 ms 504 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 7 ms 504 KB Output is correct
10 Correct 7 ms 376 KB Output is correct
11 Correct 7 ms 376 KB Output is correct
12 Correct 7 ms 376 KB Output is correct
13 Correct 8 ms 376 KB Output is correct
14 Correct 8 ms 504 KB Output is correct
15 Correct 7 ms 504 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 7 ms 504 KB Output is correct
10 Correct 7 ms 376 KB Output is correct
11 Correct 7 ms 376 KB Output is correct
12 Correct 7 ms 376 KB Output is correct
13 Correct 8 ms 376 KB Output is correct
14 Correct 8 ms 504 KB Output is correct
15 Correct 7 ms 504 KB Output is correct
16 Correct 83 ms 3048 KB Output is correct
17 Correct 78 ms 3032 KB Output is correct
18 Correct 78 ms 3004 KB Output is correct
19 Correct 75 ms 2924 KB Output is correct
20 Correct 79 ms 2924 KB Output is correct
21 Correct 80 ms 2932 KB Output is correct
22 Correct 80 ms 3076 KB Output is correct
23 Correct 80 ms 3044 KB Output is correct
24 Correct 77 ms 2924 KB Output is correct