제출 #237542

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
237542		VEGAnn	Karte (COCI18_karte)	C++14	120 / 120	138 ms	6776 KiB

karte

#include <bits/stdc++.h>
#define PB push_back
#define sz(x) ((int)x.size())
using namespace std;
typedef long long ll;
const int N = 500100;
int n, k, a[N], b[N];

int get(int kl){
    for (int i = n - kl, j = 0; i < n; i++, j++)
        b[j] = a[i];

    for (int i = 0, j = kl; i < n - kl; i++, j++)
        b[j] = a[i];

    int cnt = 0;
    bool ok = 1;

    for (int i = 0; i < kl && ok; i++)
        if (b[i] > cnt)
            cnt++;

    return cnt;
}

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

#ifdef _LOCAL
    freopen("in.txt","r",stdin);
#endif // _LOCAL

    cin >> n >> k;

    for (int i = 0; i < n; i++)
        cin >> a[i];

    sort(a, a + n);

    int l = k, r = n;

    while (l < r){
        int md = (l + r) >> 1;

        if (get(md) >= k)
            r = md;
        else l = md + 1;
    }

    int kl = l;

    for (int i = n - kl, j = 0; i < n; i++, j++)
        b[j] = a[i];

    for (int i = 0, j = kl; i < n - kl; i++, j++)
        b[j] = a[i];

    int cnt = 0;
    bool ok = 1;

    for (int i = 0; i < n && ok; i++) {
        if (b[i] > cnt) {
            if (i >= kl)
                ok = 0;
            else cnt++;
        }
    }

    if (cnt == k && ok) {
        for (int i = n - 1; i >= 0; i--)
            cout << b[i] << " ";
        return 0;
    }

    cout << -1;

    return 0;
}

• Subtask 1: 12 / 12
• Subtask 2: 12 / 12
• Subtask 3: 12 / 12
• Subtask 4: 12 / 12
• Subtask 5: 12 / 12
• Subtask 6: 12 / 12
• Subtask 7: 12 / 12
• Subtask 8: 12 / 12
• Subtask 9: 12 / 12
• Subtask 10: 12 / 12