Submission #769315

#	Time	Username	Problem	Language	Result	Execution time	Memory
769315		tch1cherin	Stone Arranging 2 (JOI23_ho_t1)	C++17	35 / 100	40 ms	1076 KiB

Main

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

int main() {
  int n;
  cin >> n;
  vector<pair<int, int>> S;
  vector<bool> in_stack(n);
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    if (in_stack[--x]) {
      while (!S.empty() && S.back().first != x) {
        in_stack[S.back().first] = false;
        S.pop_back();
      }
    } else {
      in_stack[x] = true;
      S.emplace_back(x, i); 
    }
  }
  S.emplace_back(-1, n);
  for (int i = 0; i < (int)S.size() - 1; i++) {
    for (int j = S[i].second; j < S[i + 1].second; j++) {
      cout << 1 + S[i].first << "\n"; 
    }
  }
}

• Subtask 1: 0 / 25
• Subtask 2: 35 / 35
• Subtask 3: 0 / 40