Submission #1513595


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n;
	cin >> n;
	vector<int> x(n + 1);
	x[0] = -1;
	for (int i = 1; i <= n; i++) {
		cin >> x[i];
		x[i]--;
	}

	bool ans = true;
	vector<int> a, idx(n + 1);
	deque<int> b;
	for (int i = 0; i <= n; i++) idx[i] = i;
	sort(idx.begin(), idx.end(), [&](const int& i1, const int& i2) {return x[i1] < x[i2];});

	for (int i = 1; i <= n; i++) {
		for (int j = 1; j < idx[i]; j++) {
			b.push_back(idx[i]);
		}
	}
	
	for (int i = 1; i <= n; i++) {
		for (int j = x[idx[i] - 1] + 1; j < x[idx[i]]; j++) {
			if (b.empty()) {
				ans = false;
				break;
			}
			a.push_back(b.front());
			b.pop_front();
		}
		if (!ans) break;
		a.push_back(idx[i]);
		for (int j = 0; j < n - idx[i]; j++) {
			b.push_back(idx[i]);
		}
	}

	if (ans) {
		while (!b.empty()) {
			a.push_back(b.front());
			b.pop_front();
		}
		cout << "Yes" << endl;
		cout << a[0];
		for (int i = 1; i < n * n; i++) {
			cout << " " << a[i];
		}
		cout << endl;
	} else {
		cout << "No" << endl;
	}
	return 0;
}

Submission Info

Submission Time
Task D - K-th K
User fine
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1133 Byte
Status WA
Exec Time 21 ms
Memory 3316 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 800
Status
AC × 2
AC × 26
WA × 23
Set Name Test Cases
Sample 0_00.txt, 0_01.txt
All 0_00.txt, 0_01.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 20 ms 2932 KB
1_02.txt AC 21 ms 2804 KB
1_03.txt AC 21 ms 2932 KB
1_04.txt AC 20 ms 2804 KB
1_05.txt WA 21 ms 3316 KB
1_06.txt WA 4 ms 2424 KB
1_07.txt WA 4 ms 2424 KB
1_08.txt WA 20 ms 3316 KB
1_09.txt WA 20 ms 3316 KB
1_10.txt AC 2 ms 1404 KB
1_11.txt AC 3 ms 2296 KB
1_12.txt WA 20 ms 3316 KB
1_13.txt AC 4 ms 2424 KB
1_14.txt AC 4 ms 2424 KB
1_15.txt WA 2 ms 1276 KB
1_16.txt AC 3 ms 1912 KB
1_17.txt AC 2 ms 1404 KB
1_18.txt WA 3 ms 1912 KB
1_19.txt WA 3 ms 1912 KB
1_20.txt WA 2 ms 1292 KB
1_21.txt WA 3 ms 1912 KB
1_22.txt WA 2 ms 1408 KB
1_23.txt AC 2 ms 1408 KB
1_24.txt WA 3 ms 1912 KB
1_25.txt WA 2 ms 1276 KB
1_26.txt AC 2 ms 1312 KB
1_27.txt AC 2 ms 1276 KB
1_28.txt AC 3 ms 1912 KB
1_29.txt AC 3 ms 2044 KB
1_30.txt WA 3 ms 1912 KB
1_31.txt WA 3 ms 1924 KB
1_32.txt AC 2 ms 1416 KB
1_33.txt WA 3 ms 1912 KB
1_34.txt AC 3 ms 1912 KB
1_35.txt AC 2 ms 1276 KB
1_36.txt WA 3 ms 1912 KB
1_37.txt WA 3 ms 1912 KB
1_38.txt WA 3 ms 1912 KB
1_39.txt AC 3 ms 1912 KB
1_40.txt WA 2 ms 896 KB
1_41.txt AC 3 ms 1948 KB
1_42.txt WA 2 ms 1284 KB
1_43.txt WA 3 ms 1912 KB
1_44.txt AC 2 ms 1276 KB
1_45.txt AC 3 ms 1912 KB
1_46.txt AC 3 ms 1912 KB