oj.uz

답안 #1102415

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1102415 2024-10-18T05:49:26 Z adiyer Stove (JOI18_stove) C++17
100 / 100
 20 ms 3320 KB 
#pragma optimize ("g",on)
#pragma GCC optimize("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
// #pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
 
#include <bits/stdc++.h>

#define file(s) freopen(s".in", "r", stdin); freopen(s".out", "w", stdout);
#define adiyer(); ios_base::sync_with_stdio(0); cin.tie(0);
#define bitcount(n) __builtin_popcountll(n)
#define puts(x) a << (x ? "YES\n" : "NO\n");
#define ent (i == n ? '\n' : ' ')
#define all(x) x.begin(), x.end()
#define md ((l + r) >> 1)
#define rv(v) ((v << 1) | 1)
#define lv(v) (v << 1)
#define rs(v) rv(v), md + 1, r
#define ls(v) lv(v), l, md
#define len(s) (int) s.size()
 
#define yes {cout << "YES\n"; return; }
#define no {cout << "no\n"; return; } 
#define skip continue
#define pb push_back
#define S second
#define F first
#define ne !=

// #define int long long
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef vector < ll > vll;
typedef pair < ll, ll > pll;
typedef vector < pair < ll, ll > > vpll;

const int dx[8] = {-1, 0, 1, 0, 1, 1, -1, -1};
const int dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};
const int N = 1e5 + 12;
const int K = 5e3 + 12;
const int MAX = 5e3;
const int mod = 1e9 + 7;
const ll inf = 2e18 + 10;
const ll o = 1;
 
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

ll n, k, ans;
ll a[N];

vll v;

void output(){
	cin >> n >> k;
	for(ll i = 1; i <= n; i++) cin >> a[i];
	for(ll i = 2; i <= n; i++) v.pb(a[i] - a[i - 1] - 1);
	sort(all(v));
	reverse(all(v));
	for(ll i = 0; i < min(len(v) + 0ll, k - 1); i++) ans += v[i];
	cout << a[n] - a[1] + 1 - ans;
}
   
const bool cases = 0;

signed main(){
    // file("disrupt");
    adiyer();
	int tt = 1;
    if(cases) cin >> tt;
    for(int i = 1; i <= tt; i++){
        // cout << "Case " << i << ":\n";
    	output();
    }
}

Compilation message

stove.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize ("g",on)
      |

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 760 KB Output is correct
16 Correct 17 ms 3296 KB Output is correct
17 Correct 16 ms 3284 KB Output is correct
18 Correct 16 ms 3260 KB Output is correct
19 Correct 15 ms 3284 KB Output is correct
20 Correct 20 ms 3284 KB Output is correct
21 Correct 16 ms 3284 KB Output is correct
22 Correct 15 ms 3284 KB Output is correct
23 Correct 16 ms 3320 KB Output is correct
24 Correct 15 ms 3284 KB Output is correct