oj.uz

답안 #1092433

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1092433 2024-09-24T05:16:19 Z vjudge1 Stove (JOI18_stove) C++17
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define stdI freopen("input.txt", "r", stdin);
#define stdO freopen("output.txt", "w", stdout);
#define all(x) x.begin(), x.end()
#define mp(x, y) make_pair(x, y)
#define int long long
#define F first
#define S second
using namespace std;
using namespace __gnu_pbds;

typedef tree<int,
    null_type,less<int>,
    rb_tree_tag,
    tree_order_statistics_node_update> ordered_set;

typedef pair<int, int> pii;

const int MAXN = 2e5 + 100, INF = 1e18, MOD = 1e9 + 7;

void solve()
{
    vector<pii> v;
    int n, k;
    cin >> n >> k;
    int a[n];
    for(int i = 0; i < n; i++)
    {
        cin >> a[i];
    }
    sort(a, a + n);
    int f = a[0], s = a[0] + 1;
    for(int i = 1; i < n; i++)
    {
        if(a[i] - a[i - 1] <= 2)
        {
            s = a[i] + 1;
        }
        else
        {
            v.push_back(mp(f, s));
            f = a[i], s = a[i] + 1;
        }
    }
    v.push_back(mp(f, s));
    reverse(all(v));
    int ans = 0;
    while(min((int)v.size(), k - 1))
    {
        pii x = v.back(); v.pop_back();
        ans += x.S - x.F;
    }
    if(k == 0 && v.size())
    {
        int q = v[0].S, w = v.back().F;
        ans += q - w;
    }
    cout << ans << "\n";
}

int32_t main()
{
    IOS;
    int t = 1;
    //cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 30.0

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

Subtask #3
0 / 50.0

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