Submission #739047

#	Time	Username	Problem	Language	Result	Execution time	Memory
739047		Toxtaq	Stone Arranging 2 (JOI23_ho_t1)	C++17	35 / 100	58 ms	2536 KiB

Main

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin >> n;
    vector<int>v(n);
    stack<int>ones, twos;
    for(int i = 0;i < n;++i){
        cin >> v[i];
        if(v[i] == 1){
            while(twos.size() && ones.size() && twos.top() > ones.top()){
                v[twos.top()] = 1;
                twos.pop();
            }
            ones.push(i);
        }
        else{
            while(ones.size() && twos.size() && ones.top() > twos.top()){
                v[ones.top()] = 2;
                ones.pop();
            }
            twos.push(i);
        }
    }
    for(int i : v)cout << i << "\n";
}

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