제출 #922698

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

Main

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
 
#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 1ll<<60
#define rep(i,a,b) for (ll i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
#define endl "\n"
void inc(ll &a,ll b) {a=(a+b)%mod;}
void dec(ll &a,ll b) {a=(a-b+mod)%mod;}
int prod(ll a,ll b) {return ll(a)*ll(b)%mod;}
int lowbit(ll x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}


const ll maxn=222222;
ll a[maxn];
map<ll,ll>mp;

signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	ll n;cin>>n;
	rep(i,1,n+1)cin>>a[i],mp[a[i]]=i;
	rep(i,1,n+1){
		rep(j,i,mp[a[i]]+1){
			cout<<a[i]<<endl;
		}
		i=mp[a[i]];
	}
	
	return 0;
}
/*
10
1
1
2
2
1
2
2
1
1
2
*/

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