提出 #69650642

---

ソースコード 拡げる

#include <bits/stdc++.h>

#include <atcoder/all>

using namespace std;
using namespace atcoder;

#define int long long
#define ALL(x) (x).begin(), (x).end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))

typedef pair<int, int> PI;
typedef pair<int, pair<int, int>> PII;
static const int INF = 1010000000000000017LL;
static const double eps = 1e-12;
static const double pi = 3.14159265358979323846;
static const int dx[4] = {1, -1, 0, 0};
static const int dy[4] = {0, 0, 1, -1};
static const int ddx[8] = {1, -1, 0, 0, 1, 1, -1, -1};
static const int ddy[8] = {0, 0, 1, -1, 1, -1, 1, -1};

template <class T>
inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int N;

signed main() {
    cin >> N;
    vector<int> A(N);
    for (int i = 0; i < N; ++i) {
        cin >> A[i];
    }
    vector<int> P(N);
    for (int i = 0; i < N; ++i) {
        P[i] = i + 1;
    }
    do {
        bool ok = true;
        for (int i = 0; i < N; ++i) {
            if (A[i] == -1) continue;
            if (A[i] != P[i]) ok = false;
        }
        if (ok) {
            cout << "Yes" << endl;
            for (int i = 0; i < N; ++i) {
                cout << P[i] << " ";
            }
            cout << endl;
            return 0;
        }
    } while (next_permutation(P.begin(), P.end()));
    cout << "No" << endl;
}

提出情報

ジャッジ結果