제출 #1021727

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1021727		Bzslayed	Stone Arranging 2 (JOI23_ho_t1)	C++17	100 / 100	110 ms	42460 KiB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 

using namespace std;
using namespace __gnu_pbds; 

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#define ll long long
#define ull unsigned long long
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>
#define coutpair(p) cout << p.first << " " << p.second << "|"

template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n; cin >> n;
    vector<ll> stone(n);
    gp_hash_table<ll, vector<ll>> pos;
    for (int i=0; i<n; i++){
        cin >> stone[i];
        pos[stone[i]].push_back(i);  
    }

    vector<ll> ans(n);
    int idx = 0, curidx = 0;
    while (curidx < n && idx < n){
        for (curidx = idx; curidx<=pos[stone[idx]].back(); curidx++) ans[curidx] = stone[idx];
        idx = curidx;
    }

    for (auto &it : ans) cout << it << "\n";

    return 0;
}

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