Submission #1088114

#	Time	Username	Problem	Language	Result	Execution time	Memory
1088114		LucasLe	Stove (JOI18_stove)	C++17	100 / 100	15 ms	3360 KiB

stove

#include <bits/stdc++.h>


#define                int  long long
#define              moony  long long
#define                pii  pair<int, int>
#define                 fi  first
#define                 se  second
#define                 ld  long double
#define                 vi  vector<int>
#define                vii  vector<vector<int>>
#define             all(v)  (v).begin(), (v).end()
#define       rep(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i)
#define       per(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i)

using namespace std;

const int MOD = 1e9 + 7;

int add(int a, int b) {
  a += b;
  if (a >= MOD) a -= MOD;
  return a;
}

int mul(int a, int b) {
  (a *= b) %= MOD;
  return a;
}

int ceil(int x, int y) {
  return (x + y - 1) / y;
}

int bin_pow(int x, int y) {
  int res=1;
  while(y){if(y&1)res=res*x%MOD;x=x*x%MOD;y>>=1;}
  return res;
}

const int INF = 1e17;
const int maxn = 1e6 + 5;

int n, k;
int t[maxn + 5];

void solve(int tc) {
//    (t[j] - t[1]) + (t[k] - t[j + 1]) + (t[z] - t[k + 1]) + (t[n] - t[z + 1])
//  = (t[n] - t[1]) + (t[j] - t[j + 1]) + (t[k] - t[k + 1]) + (t[z] - t[z + 1])
  cin >> n >> k;
  for (int i = 1; i <= n; ++i) cin >> t[i];
  int ans = t[n] - t[1] + 1;
  if (n == 2) {
    if (k == 2) ans = min(ans, 2ll);
    cout << ans;
    return;
  }
  vector<int> vec;
  for (int i = 1; i + 1 <= n; ++i)
    vec.push_back(t[i] - t[i + 1] + 1);
  sort(all(vec));
  for (int i = 0; i < min(k - 1, (int)vec.size()); ++i)
    ans += vec[i];
  cout << ans;
}

signed main() {

  ios_base::sync_with_stdio(false);
  cin.tie(0); cout.tie(0);

  int tc = 1;
  //cin >> tc;

  for (int i = 1; i <= tc; ++i) {
    solve(i);
  }
}

• Subtask 1: 20 / 20
• Subtask 2: 30 / 30
• Subtask 3: 50 / 50