Submission #69696923
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
const int N = 15;
int n;
int a[N], len;
bool vis[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (vis[a[i]] && a[i] != -1) {
cout << "No" << '\n';
return 0;
}
vis[a[i]] = true;
}
cout << "Yes\n";
for (int i = 1; i <= n; i++) {
if (a[i] == -1) {
for (int j = 1; j <= n; j++)
if (!vis[j]) {
cout << j << ' ';
vis[j] = true;
break;
}
} else {
cout << a[i] << ' ';
}
}
cout << "\n";
return 0;
}
Submission Info
| Submission Time | |
|---|---|
| Task | B - Find Permutation 2 |
| User | zhangyongran |
| Language | C++ 20 (gcc 12.2) |
| Score | 200 |
| Code Size | 618 Byte |
| Status | AC |
| Exec Time | 1 ms |
| Memory | 3620 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 200 / 200 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt |
| All | 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_Yes_00.txt, 01_Yes_01.txt, 01_Yes_02.txt, 01_Yes_03.txt, 01_Yes_04.txt, 01_Yes_05.txt, 01_Yes_06.txt, 01_Yes_07.txt, 01_Yes_08.txt, 01_Yes_09.txt, 01_Yes_10.txt, 01_Yes_11.txt, 01_Yes_12.txt, 01_Yes_13.txt, 01_Yes_14.txt, 01_Yes_15.txt, 01_Yes_16.txt, 01_Yes_17.txt, 01_Yes_18.txt, 01_Yes_19.txt, 01_Yes_20.txt, 02_No_00.txt, 02_No_01.txt, 02_No_02.txt, 02_No_03.txt, 02_No_04.txt, 02_No_05.txt, 02_No_06.txt, 02_No_07.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| 00_sample_00.txt | AC | 1 ms | 3480 KiB |
| 00_sample_01.txt | AC | 1 ms | 3420 KiB |
| 00_sample_02.txt | AC | 1 ms | 3364 KiB |
| 01_Yes_00.txt | AC | 1 ms | 3428 KiB |
| 01_Yes_01.txt | AC | 1 ms | 3476 KiB |
| 01_Yes_02.txt | AC | 1 ms | 3408 KiB |
| 01_Yes_03.txt | AC | 1 ms | 3476 KiB |
| 01_Yes_04.txt | AC | 1 ms | 3432 KiB |
| 01_Yes_05.txt | AC | 1 ms | 3476 KiB |
| 01_Yes_06.txt | AC | 1 ms | 3584 KiB |
| 01_Yes_07.txt | AC | 1 ms | 3436 KiB |
| 01_Yes_08.txt | AC | 1 ms | 3436 KiB |
| 01_Yes_09.txt | AC | 1 ms | 3360 KiB |
| 01_Yes_10.txt | AC | 1 ms | 3428 KiB |
| 01_Yes_11.txt | AC | 1 ms | 3540 KiB |
| 01_Yes_12.txt | AC | 1 ms | 3620 KiB |
| 01_Yes_13.txt | AC | 1 ms | 3472 KiB |
| 01_Yes_14.txt | AC | 1 ms | 3484 KiB |
| 01_Yes_15.txt | AC | 1 ms | 3360 KiB |
| 01_Yes_16.txt | AC | 1 ms | 3480 KiB |
| 01_Yes_17.txt | AC | 1 ms | 3436 KiB |
| 01_Yes_18.txt | AC | 1 ms | 3496 KiB |
| 01_Yes_19.txt | AC | 1 ms | 3432 KiB |
| 01_Yes_20.txt | AC | 1 ms | 3484 KiB |
| 02_No_00.txt | AC | 1 ms | 3424 KiB |
| 02_No_01.txt | AC | 1 ms | 3480 KiB |
| 02_No_02.txt | AC | 1 ms | 3476 KiB |
| 02_No_03.txt | AC | 1 ms | 3484 KiB |
| 02_No_04.txt | AC | 1 ms | 3408 KiB |
| 02_No_05.txt | AC | 1 ms | 3488 KiB |
| 02_No_06.txt | AC | 1 ms | 3432 KiB |
| 02_No_07.txt | AC | 1 ms | 3548 KiB |