제출 #791939

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

Main

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ll,ii>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n;
    cin>>n;
    ll a[n];
    ll ans[n];
    map<ll,ll>mp;
    f(i,0,n){
        cin>>a[i];
        mp[a[i]] = i;
    }
    ll pos = 0;
    while(pos < n){
        f(i,pos,mp[a[pos]]+1){
            ans[i] = a[pos];
        }
        pos = mp[a[pos]] + 1;
    }
    f(i,0,n){
        cout<<ans[i]<<"\n";
    }
}

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