oj.uz

답안 #916981

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
916981 2024-01-26T22:04:04 Z Akshat369 Stove (JOI18_stove) C++17
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>

using namespace std;
#define int long long
#define INF (int)1e18
#define endl '\n'
const int mod = 1000 * 1000 * 1000 + 7;
const int N = 100005;
#define f first
#define s second
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define rrep(i, a, b) for(int i = (a); i > (b); i--)
#define vi vector<int>
#define pii pair<int, int>

//mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

void Solve() {
    int n , k; cin>>n>>k;
    vi a(n);
    for (int i = 0; i < n; ++i) {
        cin>>a[i];
    }
    vector<int> diff;
    for (int i = 0; i < n - 1; ++i) {
        diff.push_back(a[i+1]-a[i]-1);
    }
    int ans = n;
    for (int i = 0; i < n - k; ++i) {
        ans += diff[i];
    }
    
    cout<< ans << endl;
}

int32_t main() {
 
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
 //   cin >> t;
    for (int i = 1; i <= t; i++) {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    
    return 0;
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -