Submission #682637

#	Time	Username	Problem	Language	Result	Execution time	Memory
682637		as111	Karte (COCI18_karte)	C++14	12 / 120	187 ms	8816 KiB

karte

#include <iostream>
#include <vector>
#include <algorithm>

#define MAXN 500000

using namespace std;
int N, K;
vector<int> cards;
int sorted[MAXN + 5];
int f[MAXN + 5]; // # false below including itself
int main() {
	cin >> N >> K;
	for (int i = 0; i < N; i++) {
		int c;
		cin >> c;
		cards.push_back(c);
	}
	sort(cards.begin(), cards.end());
	
	for (int i = 1; i <= N; i++) {
		sorted[i] = cards[i - 1];
		f[i] = f[i - 1];
		if (sorted[i] > f[i - 1]) f[i]++;
	}
	bool works = true;
	int start = 0;
	int cnt = K;
	for (int i = N; i >= 1; i--) {
		if (cnt == 0) {
			if (sorted[i] > K) works = false; // next card will be false no matter if it is placed before/after the K incorrect
			start = i + 1;
			break;
		}
		if (sorted[i] > cnt-1) { // count as false
			cnt--;
		}
	}
	if (cnt > 0)works = false;
	if (works) {
		for (int i = start; i <= N; i++) {
			cout << sorted[i] << " ";
		}
		for (int i = 1; i < start; i++) {
			cout << sorted[i] << " ";
		}
	}
	else {
		cout << -1;
	}
}

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