제출 #261215

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
261215		Valera_Grinenko	Stove (JOI18_stove)	C++17	100 / 100	30 ms	2304 KiB

stove

#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <iomanip>
#include <cmath>
#include <queue>
#include <bitset>
#include <numeric>
#include <array>
#include <cstring>
#include <random>
#include <chrono>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
typedef long long ll;
typedef long double ld;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {

  ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

  int n = 0, k = 0;

  cin >> n >> k;

  k--;

  vector<int> segs, t(n);

  cin >> t[0];

  for(int i = 1; i < n; i++) {
    cin >> t[i];
    if(t[i] - t[i - 1] - 1 > 0) segs.pb(t[i] - t[i - 1] - 1);
  }

  sort(rall(segs));

  int ans = t.back() + 1 - t[0];

  for(int i = 0; i < min((int)segs.size(), k); i++)
    ans -= segs[i];

  cout << ans;

  return 0;
}
/*

*/

컴파일 시 표준 에러 (stderr) 메시지

stove.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("unroll-loops")

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