Submission #1460148
Source Code Expand
#include "bits/stdc++.h" using namespace std; #define maxn 501 #define rep(i,n) for(int i=0; i<int(n); ++i) #define pb push_back #define mp make_pair #define mod 1000000007 int n, m, k, x, y, z; vector<pair<int, int>> a; int b[maxn]; void solve(){ cin >> n; for (int i = 1; i <= n; ++i){ cin >> x; a.pb(mp(x, i)); } sort(a.begin(), a.end()); int l = 0; rep(i, n){ int pos = a[i].first; int num = a[i].second; if (b[pos] > 0){ cout << "No"; return; } b[pos] = num; rep(_, num - 1){ while (b[++l] > 0); b[l] = num; } if (l > pos){ cout << "No"; return; } } int r = n*n + 1; reverse(a.begin(), a.end()); for (auto p : a){ int pos = p.first; int num = p.second; rep(_, n - num){ while (b[--r] > 0) {} b[r] = num; } //cout << pos << ' ' << num << ' ' << n - num << ' ' << r << endl; if (r < pos){ cout << "No"; return; } } cout << "Yes" << endl; for (int i = 1; i <= n*n; ++i){ cout << b[i] << ' '; } } int main(int argc, char const *argv[]) { ios_base::sync_with_stdio(0); solve(); }
Submission Info
Submission Time | |
---|---|
Task | D - K-th K |
User | hehaodele |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1135 Byte |
Status | RE |
Exec Time | 97 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | RE | 95 ms | 256 KB |
1_02.txt | RE | 95 ms | 256 KB |
1_03.txt | RE | 95 ms | 256 KB |
1_04.txt | RE | 96 ms | 256 KB |
1_05.txt | RE | 95 ms | 256 KB |
1_06.txt | RE | 96 ms | 256 KB |
1_07.txt | RE | 95 ms | 256 KB |
1_08.txt | RE | 95 ms | 256 KB |
1_09.txt | AC | 1 ms | 256 KB |
1_10.txt | RE | 96 ms | 256 KB |
1_11.txt | AC | 1 ms | 256 KB |
1_12.txt | AC | 1 ms | 256 KB |
1_13.txt | RE | 96 ms | 256 KB |
1_14.txt | AC | 1 ms | 256 KB |
1_15.txt | RE | 96 ms | 256 KB |
1_16.txt | RE | 96 ms | 256 KB |
1_17.txt | RE | 95 ms | 256 KB |
1_18.txt | RE | 95 ms | 256 KB |
1_19.txt | RE | 96 ms | 256 KB |
1_20.txt | RE | 95 ms | 256 KB |
1_21.txt | RE | 95 ms | 256 KB |
1_22.txt | RE | 96 ms | 256 KB |
1_23.txt | RE | 96 ms | 256 KB |
1_24.txt | RE | 96 ms | 256 KB |
1_25.txt | RE | 95 ms | 256 KB |
1_26.txt | RE | 96 ms | 256 KB |
1_27.txt | RE | 95 ms | 256 KB |
1_28.txt | RE | 96 ms | 256 KB |
1_29.txt | RE | 96 ms | 256 KB |
1_30.txt | RE | 96 ms | 256 KB |
1_31.txt | RE | 95 ms | 256 KB |
1_32.txt | RE | 95 ms | 256 KB |
1_33.txt | RE | 96 ms | 256 KB |
1_34.txt | RE | 95 ms | 256 KB |
1_35.txt | RE | 96 ms | 256 KB |
1_36.txt | RE | 96 ms | 256 KB |
1_37.txt | RE | 96 ms | 256 KB |
1_38.txt | RE | 96 ms | 256 KB |
1_39.txt | RE | 96 ms | 256 KB |
1_40.txt | RE | 96 ms | 256 KB |
1_41.txt | RE | 95 ms | 256 KB |
1_42.txt | RE | 96 ms | 256 KB |
1_43.txt | RE | 95 ms | 256 KB |
1_44.txt | RE | 96 ms | 256 KB |
1_45.txt | RE | 95 ms | 256 KB |
1_46.txt | RE | 97 ms | 256 KB |