Submission #4669987

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int n;
vector<int> b;
queue<int> qu;
vector<int> ans;

void solve();

int main() {
  cin >> n;
  for(int i = 0; i < n; ++i) {
    int x;
    cin >> x;
    b.push_back(x);
  }
  solve();
  for(int i = 0; i < ans.size(); ++i)
    cout << ans[i] << endl;
  return 0;
}

void solve() {
  vector<int> dummy;
  dummy.push_back(-1);
  while(n > 0) {
    bool ch = 0;
    for(int i = n - 1; i >= 0; --i)
      if(i + 1 == b[i]) {
        ans.push_back(i + 1);
        b.erase(b.begin() + i);
        ch = 1;
        --n;
        break;
      }
    if(!ch) {
      ans = dummy;
      return;
    }
  }
  reverse(ans.begin(), ans.end());
}

Submission Info

Judge Result