Submission #1333222

#TimeUsernameProblemLanguageResultExecution timeMemory
1333222mtilordStone Arranging 2 (JOI23_ho_t1)C++20
35 / 100
15 ms1616 KiB
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ll long long
#define endl '\n'
#define pb push_back
#define fi first
#define se second
#define pii pair<int, int>
using namespace std;

int mas[200001];

int main()
{

    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n, s, b;
    cin >> n;
    cin >> mas[1];
    if(mas[1]==1)
        s=1;
    else
        s=2;
    for(int i=2; i<=n; i++)
    {
        cin >>   mas[i];
    }
    for(int i=n; i>=1; i--)
    {
        if(mas[i]==s)
        {
            b=i;
            break;
        }
    }
    for(int i=1; i<=b; i++)
        cout << s << endl;
    int x;
    if(s==1)
        x=2;
    else
        x=1;
    for(int i=b+1; i<=n; i++)
        cout << x << endl;



    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...