Submission #996810

#	Time	Username	Problem	Language	Result	Execution time	Memory
996810		faqinyeager	Stone Arranging 2 (JOI23_ho_t1)	C++17	35 / 100	29 ms	2804 KiB

Main

#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;
using ll = long long;

ll n;
vector<ll> a;


int main(){
    cin >> n;
    
    a.resize(n);
    
    for(int i = 0; i < n; i++) cin >> a[i];
    
    if(a[0] == a[n - 1]){
        for(int i = 0; i < n; i++) cout << a[0] << '\n';
    }else{
        int ind = n - 1;
        while(a[0] != a[ind]) ind -= 1;
        for(int i = 0; i <= ind; i++) cout << a[0] << '\n';
        for(int i = ind + 1; i < n; i++) cout << a[n - 1] << '\n';
    }
}

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