Submission #1187898

#	Time	Username	Problem	Language	Result	Execution time	Memory
1187898		yhx3	Stone Arranging 2 (JOI23_ho_t1)	C++20	35 / 100	143 ms	2260 KiB

Main

#include <iostream>
#include <bits/stdc++.h>
#include <iomanip>
#include <numeric>
 
using namespace std;
 
#define ll long long
 
bool comp(const pair<int,int> &a,pair<int,int> &vl)
{
    return a.second > vl.first;
}
 
bool scomp(const pair<int,int> &a,pair<int,int> &vl)
{
    return a.first >= vl.first;
}
 

void solve() {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
    }
    
    vector<int> ans(n);
    if (a[0] == 1) {
        bool ok = false;
        for (int i = n - 1; i >= 0; i--)
        {
            if (ok) {
                ans[i] = 1;
                continue;
            }
            if (a[i] == 1){
                ans[i] = 1;
                ok = true;
            } else {
                ans[i] = 2;
            }
        }
    } else {
        bool ok = false;
        for (int i = n - 1; i >= 0; i--)
        {
            if (ok) {
                ans[i] = 2;
                continue;
            }
            if (a[i] == 2){
                ans[i] = 2;
                ok = true;
            } else {
                ans[i] = 1;
            }
        }
    }
    for (int i = 0; i < n; i++)
    {
        cout << ans[i] << endl;
    }
    
}

int main() {
    int t = 1;
    // cin>>t;

    while(t--) {
        solve();
    }
    return 0;

}

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