提出 #4669890

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
#define _MACRO(_1, _2, _3, NAME, ...) NAME
#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define _rep(i,n) _repl(i,0,n)
#define rep(...) _MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)
#define pb push_back
#define all(x) begin(x),end(x)
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#ifdef LOCAL
#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
void _dbg(string){cerr<<endl;}
template<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cerr<<s.substr(0,l)<<" = "<<h<<", ";_dbg(s.substr(l+1),t...);}
template<class T,class U> ostream& operator<<(ostream &o, const pair<T,U> &p){o<<"("<<p.first<<","<<p.second<<")";return o;}
template<class T> ostream& operator<<(ostream &o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}
#else
#define dbg(...) {}
#endif

int main(){
  int n;
  cin>>n;
  vector<int> v(n);
  rep(i,n) cin>>v[i];

  vector<int> ans;
  int cur = -1;
  vector<bool> used(n, false);
  do {
    int p = 1;
    int u = -1;
    rep(i,n) if(!used[i]){
      dbg(i,p);
      if(v[i] == p) {
        cur = p;
        u = i;
      }
      p++;
    }
    if(cur == -1) break;
    ans.push_back(cur);
    cur = -1;
    used[u] = true;
    dbg(ans);
  } while(ans.size() < n);

  if(ans.size() != n) cout << -1 << endl;
  else {
    reverse(all(ans));
    rep(i,n) cout << ans[i] << "\n";
  }

  return 0;
}

提出情報

ジャッジ結果