Submission #5391899

---

Source Code Expand

#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl

using namespace std;

template<typename S,typename T>auto&operator<<(ostream&o,pair<S,T>p){return o<<"{"<<p.fi<<","<<p.se<<"}";}
template<typename T>auto&operator<<(ostream&o,set<T>s){for(auto&e:s)o<<e<<" ";return o;}
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,priority_queue<S,T,U>q){while(!q.empty())o<<q.top()<<" ",q.pop();return o;}
template<typename K,typename T>auto&operator<<(ostream&o,map<K,T>m){for(auto&e:m)o<<e<<" ";return o;}
template<typename T>auto&operator<<(ostream&o,vector<T>v){for(auto&e:v)o<<e<<" ";return o;}
void ashow(){cout<<endl;}template<typename T,typename...A>void ashow(T t,A...a){cout<<t<<" ";ashow(a...);}

typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<P> vp;
typedef vector<double> vd;
typedef vector<string> vs;

const int MAX_N = 100005;

vector<int> num[MAX_N];

void MP(const vi& S, vector<int>& res){
    int n = (int)S.size(), j = 0;
    res.resize(n, 0);
    vi next(n, 0);
    for(int i = 0; i < n-1; i++){
        while(S[i+1] != S[j] && --j >= 0) j = next[j];
        res[i+1] = ++j;
        if(S[i+2] == S[j]) next[i+1] = (j > 0) ? next[j-1] : 0;
        else next[i+1] = j;
    }
}

#define getchar getchar_unlocked

inline int in() {
    int n = 0; short c;
    while ((c = getchar()) >= '0') n = n * 10 + c - '0';
    return n;
}

int main()
{
    int n = in(), j = 0;
    vi res(n, 0);
    rep(i,n) res[i] = in();
    vi a(n, 1);
    int id = 1;
    for(int i = 0; i < n-1; i++){
        for(; j >= -1;){
            if(j+1 < res[i+1]){
                cout << "No\n";
                return false;
            }else if(j+1 == res[i+1]){
                a[i+1] = (++j <= 0) ? ++id : a[j-1];
                break;
            }else if(--j >= 0){
                j = res[j];
            }
        }
    }
    vi check;
    MP(a, check);
    if(res == check){
        cout << "Yes\n";
        rep(i,n){
            cout << a[i] << " ";
        }
        cout << "\n";
    }else{
        cout << "No\n";
    }
    return 0;
}

Submission Info

Judge Result