Submission #1693216
Source Code Expand
#include <iostream> #include <cstdio> #include <cstdlib> #include <cstring> #include <algorithm> #include <vector> #include <queue> #include <stack> #include <cmath> #include <queue> using namespace std; const int MAXN = 500 + 100; int n, p[MAXN]; int ans[MAXN * MAXN]; struct Cmp { bool operator () (int x, int y) const { return p[x] < p[y]; } }; int cnt[MAXN]; priority_queue<int, vector<int>, Cmp> pq; queue<int> que; void no() { cout << "No" << endl; exit(0); } void yes() { cout << "Yes" << endl; for(int i = 1; i <= n * n; i++) cout << ans[i] << ' '; cout << endl; exit(0); } int main() { ios::sync_with_stdio(false); // freopen("1.in", "r", stdin); // freopen("1.out", "w", stdout); cin >> n; for(int i = 1; i <= n; i++) cin >> p[i]; for(int i = 1; i <= n; i++) { cnt[i] = n - i; for(int j = 1; j <= n - i; j++) pq.push(i); ans[p[i]] = i; } for(int i = n * n; i >= 1; i--) if(ans[i]) { // cerr << i << ' ' << ans[i] << endl; if(cnt[ans[i]]) no(); for(int j = 1; j <= ans[i] - 1; j++) que.push(ans[i]); } else { if(!pq.empty()) cnt[pq.top()]--, ans[i] = pq.top(), pq.pop(); else if(!que.empty()) ans[i] = que.front(), que.pop(); else no(); } yes(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - K-th K |
User | ct123098 |
Language | C++14 (GCC 5.4.1) |
Score | 800 |
Code Size | 1340 Byte |
Status | AC |
Exec Time | 33 ms |
Memory | 3192 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 800 / 800 | ||||
Status |
|
|
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 | 33 ms | 2808 KB |
1_02.txt | AC | 33 ms | 3192 KB |
1_03.txt | AC | 33 ms | 3064 KB |
1_04.txt | AC | 33 ms | 3192 KB |
1_05.txt | AC | 33 ms | 2808 KB |
1_06.txt | AC | 33 ms | 3192 KB |
1_07.txt | AC | 32 ms | 2808 KB |
1_08.txt | AC | 33 ms | 3192 KB |
1_09.txt | AC | 15 ms | 1400 KB |
1_10.txt | AC | 3 ms | 892 KB |
1_11.txt | AC | 3 ms | 892 KB |
1_12.txt | AC | 15 ms | 1400 KB |
1_13.txt | AC | 3 ms | 892 KB |
1_14.txt | AC | 3 ms | 892 KB |
1_15.txt | AC | 23 ms | 2040 KB |
1_16.txt | AC | 8 ms | 1400 KB |
1_17.txt | AC | 5 ms | 1276 KB |
1_18.txt | AC | 30 ms | 2552 KB |
1_19.txt | AC | 31 ms | 2808 KB |
1_20.txt | AC | 25 ms | 2296 KB |
1_21.txt | AC | 31 ms | 2808 KB |
1_22.txt | AC | 27 ms | 2424 KB |
1_23.txt | AC | 8 ms | 1276 KB |
1_24.txt | AC | 31 ms | 2808 KB |
1_25.txt | AC | 24 ms | 2296 KB |
1_26.txt | AC | 7 ms | 1276 KB |
1_27.txt | AC | 3 ms | 1276 KB |
1_28.txt | AC | 15 ms | 1912 KB |
1_29.txt | AC | 12 ms | 1656 KB |
1_30.txt | AC | 29 ms | 2552 KB |
1_31.txt | AC | 32 ms | 2808 KB |
1_32.txt | AC | 13 ms | 1528 KB |
1_33.txt | AC | 31 ms | 2552 KB |
1_34.txt | AC | 15 ms | 1784 KB |
1_35.txt | AC | 4 ms | 1276 KB |
1_36.txt | AC | 30 ms | 2552 KB |
1_37.txt | AC | 29 ms | 2552 KB |
1_38.txt | AC | 32 ms | 2680 KB |
1_39.txt | AC | 13 ms | 1656 KB |
1_40.txt | AC | 13 ms | 1404 KB |
1_41.txt | AC | 3 ms | 1400 KB |
1_42.txt | AC | 20 ms | 1912 KB |
1_43.txt | AC | 29 ms | 2424 KB |
1_44.txt | AC | 10 ms | 1276 KB |
1_45.txt | AC | 14 ms | 1656 KB |
1_46.txt | AC | 15 ms | 1912 KB |