oj.uz

답안 #984758

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
984758 2024-05-17T04:59:10 Z hashim Stove (JOI18_stove) C++17
100 / 100
 18 ms 3392 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define pf push_front
#define ep emplace_back
#define ef emplace_front
#define int long long
#define ld long double
#define stoi stoll
#define all(ls) ls.begin(),ls.end()
#define allr(ls) ls.rbegin(),ls.rend()
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
 
using namespace std; 
using namespace __gnu_pbds;
 
template<typename type>using ordered_set=tree<type,null_type,less<type>,rb_tree_tag,tree_order_statistics_node_update>;
template<typename type>using ordered_multiset=tree<type,null_type,less_equal<type>,rb_tree_tag,tree_order_statistics_node_update>;
 
int sum(int ls[],int n){int sum=0;for(int i=0;i<n;i++)sum+=ls[i];return sum;}
 
int count(string str,string word){regex regex_word(word);sregex_iterator it(all(str),regex_word);sregex_iterator end;int count=0;while(it!=end){count++;it++;}return count;}

void solve(){
  int n,k;
  cin>>n>>k;
  int ls[n];
  for(int i=0;i<n;i++)
    cin>>ls[i];
  int cnt=ls[n-1]-ls[0]+1;
  vector<int>diff;
  for(int i=1;i<n;i++){
    diff.pb(ls[i]-ls[i-1]);
  }
  sort(all(diff),greater<int>());
  for(int i=0;i<k-1;i++)
    cnt-=diff[i]-1;
  cout<<cnt<<endl; 
}

signed main(){
  ios_base::sync_with_stdio(0);
  cin.tie(nullptr); 
  cout.tie(nullptr);
  int t=1;
  //cin>>t;
  while(t--)
    solve();
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 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 388 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 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 388 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 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 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 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 388 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 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 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 15 ms 3292 KB Output is correct
17 Correct 15 ms 3392 KB Output is correct
18 Correct 15 ms 3292 KB Output is correct
19 Correct 14 ms 3292 KB Output is correct
20 Correct 15 ms 3292 KB Output is correct
21 Correct 15 ms 3292 KB Output is correct
22 Correct 15 ms 3288 KB Output is correct
23 Correct 14 ms 3292 KB Output is correct
24 Correct 18 ms 3292 KB Output is correct