제출 #1021730

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1021730		Shuhxin	Stone Arranging 2 (JOI23_ho_t1)	C++14	25 / 100	2082 ms	2396 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define str string
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
int main() {
    fastio;
    ll n, x;
    deque<ll> d;
    cin >> n;
    for(ll i=0; i<n; i++) {
        cin >> x;
        auto it = find(d.begin(), d.end(), x);
        if (it != d.end()) {
            for (ll j=0; j<it-d.begin(); j++) {
                d[j] = x;
            }
        }
        d.push_front(x);
    }
    for(ll i=n-1; i>=0; i--) cout << d[i] << "\n";
}

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