Submission #1078090
Source Code Expand
#include <cstdio> #include <vector> #include <algorithm> #include <functional> #include <tuple> #include <map> #include <unordered_map> #include <set> #include <unordered_set> #include <array> #include <valarray> using namespace std; int main() { int N; scanf("%d\n", &N); const int NN = N * N; vector<int> X(N); map<int, int> Xmap; vector<int> A(NN, -1); for (int i = 0; i < N; ++i){ int Xi; scanf("%d", &Xi); --Xi; getchar(); X[i] = Xi; Xmap.emplace(Xi, i); A[Xi] = i; } { int j = 0; for (auto& elem : Xmap){ int Xi = elem.first; int i = elem.second; for (int k = 0; k < i; ++k){ while (A[j] != -1){ if (j == Xi){ puts("No"); return 0; } ++j; } A[j] = i; } } } { int j = NN - 1; for (auto rit = Xmap.rbegin(), rend = Xmap.rend(); rit != rend; ++rit){ int Xi = rit->first; int i = rit->second; for (int k = 0; k < N - 1 - i; ++k){ while (A[j] != -1){ if (j == Xi){ puts("No"); return 0; } --j; } A[j] = i; } } } puts("Yes"); for (int j = 0; j < NN - 1; ++j){ printf("%d ", A[j] + 1); } printf("%d\n", A[NN - 1] + 1); }
Submission Info
Submission Time | |
---|---|
Task | D - K-th K |
User | painfulness |
Language | C++14 (GCC 5.4.1) |
Score | 800 |
Code Size | 1659 Byte |
Status | AC |
Exec Time | 28 ms |
Memory | 2176 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:18:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d\n", &N); ^ ./Main.cpp:25:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &Xi); --Xi; getchar(); ^
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 | 2 ms | 256 KB |
0_01.txt | AC | 2 ms | 256 KB |
1_00.txt | AC | 2 ms | 256 KB |
1_01.txt | AC | 24 ms | 2176 KB |
1_02.txt | AC | 25 ms | 2176 KB |
1_03.txt | AC | 25 ms | 2176 KB |
1_04.txt | AC | 24 ms | 2176 KB |
1_05.txt | AC | 25 ms | 2176 KB |
1_06.txt | AC | 24 ms | 2176 KB |
1_07.txt | AC | 24 ms | 2176 KB |
1_08.txt | AC | 24 ms | 2176 KB |
1_09.txt | AC | 4 ms | 1280 KB |
1_10.txt | AC | 4 ms | 1280 KB |
1_11.txt | AC | 4 ms | 1280 KB |
1_12.txt | AC | 4 ms | 1280 KB |
1_13.txt | AC | 4 ms | 1280 KB |
1_14.txt | AC | 4 ms | 1280 KB |
1_15.txt | AC | 17 ms | 1536 KB |
1_16.txt | AC | 4 ms | 1152 KB |
1_17.txt | AC | 4 ms | 1152 KB |
1_18.txt | AC | 22 ms | 1920 KB |
1_19.txt | AC | 23 ms | 2048 KB |
1_20.txt | AC | 18 ms | 1664 KB |
1_21.txt | AC | 22 ms | 2048 KB |
1_22.txt | AC | 20 ms | 1792 KB |
1_23.txt | AC | 4 ms | 1024 KB |
1_24.txt | AC | 28 ms | 2048 KB |
1_25.txt | AC | 18 ms | 1536 KB |
1_26.txt | AC | 4 ms | 1024 KB |
1_27.txt | AC | 3 ms | 896 KB |
1_28.txt | AC | 4 ms | 1152 KB |
1_29.txt | AC | 4 ms | 1280 KB |
1_30.txt | AC | 21 ms | 1920 KB |
1_31.txt | AC | 23 ms | 2048 KB |
1_32.txt | AC | 3 ms | 1024 KB |
1_33.txt | AC | 22 ms | 2048 KB |
1_34.txt | AC | 4 ms | 1152 KB |
1_35.txt | AC | 3 ms | 896 KB |
1_36.txt | AC | 22 ms | 1920 KB |
1_37.txt | AC | 21 ms | 1920 KB |
1_38.txt | AC | 23 ms | 2048 KB |
1_39.txt | AC | 4 ms | 1024 KB |
1_40.txt | AC | 11 ms | 1024 KB |
1_41.txt | AC | 4 ms | 1280 KB |
1_42.txt | AC | 15 ms | 1408 KB |
1_43.txt | AC | 21 ms | 1920 KB |
1_44.txt | AC | 3 ms | 896 KB |
1_45.txt | AC | 3 ms | 1152 KB |
1_46.txt | AC | 4 ms | 1152 KB |