Submission #59569

#	Time	Username	Problem	Language	Result	Execution time	Memory
59569		Benq	Karte (COCI18_karte)	C++14	120 / 120	264 ms	16308 KiB

karte

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

int N,K;

int get(vi v) {
    int ret = 0;
    for (int i: v) if (i > ret) ret ++;
    return ret;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> K;
    vi v(N); F0R(i,N) cin >> v[i];
    sort(all(v)); reverse(all(v)); // min possible
    // 5 4 3 2 1
    // ...
    // 5 1 2 3 4
    // 1 2 3 4 5 // max possible
    int lo = 0, hi = sz(v);
    while (lo < hi) {
    	int mid = (lo+hi+1)/2;
    	vi V = v; reverse(V.end()-mid,V.end());
    	if (get(V) <= K) lo = mid;
    	else hi = mid-1;
    }
    vi V = v; reverse(V.end()-lo,V.end());
    if (get(V) != K) {
    	cout << -1;
    	exit(0);
    }
    reverse(all(V));
    for (int i: V) cout << i << " ";
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

• 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