제출 #933967

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
933967		dwuy	Stone Arranging 2 (JOI23_ho_t1)	C++14	100 / 100	165 ms	142980 KiB

Main

#include <bits/stdc++.h>

#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL)
#define file(a) freopen(a".inp","r",stdin); freopen(a".out", "w",stdout)
#define fi first
#define se second
#define endl "\n"
#define len(s) int32_t(s.length())
#define MASK(k)(1LL<<(k))
#define TASK "test"

using namespace std;

typedef tuple<int, int, int> tpiii;
typedef pair<double, double> pdd;
typedef pair<int, int> pii;
typedef long long ll;

const long long OO = 1e18;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const int MX = 200005;

int n;
int a[MX];
int ans[MX];
stack<int> pos[MX];
vector<int> val;

void nhap(){
    cin >> n;
    val.resize(n);
    for(int i=1; i<=n; i++) cin >> a[i], val[i-1] = a[i];
    sort(val.begin(), val.end());
    val.erase(unique(val.begin(), val.end()), val.end());
    for(int i=1; i<=n; i++) a[i] = lower_bound(val.begin(), val.end(), a[i]) - val.begin() + 1;
}

void solve(){
    stack<int> cur;
    for(int i=1; i<=n; i++){
        if(pos[a[i]].size() == 0){
            pos[a[i]].push(i);
            cur.push(i);
            continue;
        }
        while(cur.size() && cur.top() > pos[a[i]].top()){
            pos[a[cur.top()]].pop();
            cur.pop();
        }
        cur.push(i);
        pos[a[i]].push(i);
    }
    while(cur.size()) ans[cur.top()] = a[cur.top()], cur.pop();
    for(int i=1, vl=0; i<=n; i++){
        if(ans[i]) vl = val[ans[i]-1];
        cout << vl << '\n';
    }
}

int32_t main(){
    fastIO;
    //file(TASK);

    nhap();
    solve();

    return 0;
}

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