Submission #996818

#	Time	Username	Problem	Language	Result	Execution time	Memory
996818		faqinyeager	Stone Arranging 2 (JOI23_ho_t1)	C++17	0 / 100	2100 ms	348 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);
    map<int, int> tmp;
    
    for(int i = 0; i < n; i++) cin >> a[i], tmp[a[i]] += 1;
    
    int lx = 0, rx = n - 1;
    
    while(lx <= rx){
        if(a[lx] == a[rx]){
            for(int i = 0; i < rx - lx + 1; i++) cout << a[lx] << '\n';
            lx = rx + 1;
            rx = n - 1;
            if(lx >= n) break;
        }
        while(a[lx] != a[rx] && tmp[a[lx]] > 1) rx -= 1;
    }
}

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