Submission #69651056


Source Code Expand

//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
using ll = long long;
const ll INF32 = 2e9;
const ll INF64 = 4e18;

void printYN(bool ok){
    if(ok)cout << "Yes" << endl;
    else cout << "No" << endl;
    return;
}

int main() {
    int N;
    cin >> N;
    vector<int> cnt(N), a(N);
    rep(i, N){
        int ai;
        cin >> ai;
        a[i] = ai;
        ai--;
        
        if(ai>=0)cnt[ai]++;
        else continue;
        if(cnt[ai]>1){
            cout << "No" << endl;
                    return 0;
        }
    }
    int idx = 0;
    cout << "Yes" << endl;
    rep(i, N){
        if(a[i]==-1){
            while(cnt[idx])idx++;
            cout << idx+1 << " ";
            idx++;
        } 
        else {
            cout << a[i] << " ";
        }
    }
    cout << endl;
    return 0;
}

Submission Info

Submission Time
Task B - Find Permutation 2
User hokuto9982
Language C++ 23 (gcc 12.2)
Score 200
Code Size 966 Byte
Status AC
Exec Time 1 ms
Memory 3652 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 32
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 3492 KiB
00_sample_01.txt AC 1 ms 3452 KiB
00_sample_02.txt AC 1 ms 3456 KiB
01_Yes_00.txt AC 1 ms 3468 KiB
01_Yes_01.txt AC 1 ms 3652 KiB
01_Yes_02.txt AC 1 ms 3368 KiB
01_Yes_03.txt AC 1 ms 3368 KiB
01_Yes_04.txt AC 1 ms 3428 KiB
01_Yes_05.txt AC 1 ms 3480 KiB
01_Yes_06.txt AC 1 ms 3460 KiB
01_Yes_07.txt AC 1 ms 3648 KiB
01_Yes_08.txt AC 1 ms 3492 KiB
01_Yes_09.txt AC 1 ms 3488 KiB
01_Yes_10.txt AC 1 ms 3460 KiB
01_Yes_11.txt AC 1 ms 3460 KiB
01_Yes_12.txt AC 1 ms 3528 KiB
01_Yes_13.txt AC 1 ms 3468 KiB
01_Yes_14.txt AC 1 ms 3460 KiB
01_Yes_15.txt AC 1 ms 3500 KiB
01_Yes_16.txt AC 1 ms 3452 KiB
01_Yes_17.txt AC 1 ms 3364 KiB
01_Yes_18.txt AC 1 ms 3440 KiB
01_Yes_19.txt AC 1 ms 3484 KiB
01_Yes_20.txt AC 1 ms 3464 KiB
02_No_00.txt AC 1 ms 3492 KiB
02_No_01.txt AC 1 ms 3492 KiB
02_No_02.txt AC 1 ms 3532 KiB
02_No_03.txt AC 1 ms 3480 KiB
02_No_04.txt AC 1 ms 3364 KiB
02_No_05.txt AC 1 ms 3564 KiB
02_No_06.txt AC 1 ms 3488 KiB
02_No_07.txt AC 1 ms 3436 KiB