제출 #925233

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
925233		Akshat369	Stone Arranging 2 (JOI23_ho_t1)	C++17	25 / 100	2028 ms	3928 KiB

Main

#include <bits/stdc++.h>

using namespace std;
#define int long long
#define INF (int)1e18
#define endl '\n'
const int mod = 1000 * 1000 * 1000 + 7;
const int N = 100005;
#define f first
#define s second
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define rrep(i, a, b) for(int i = (a); i > (b); i--)
#define vi vector<int>
#define pii pair<int, int>

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

void Solve() {
    int n; cin>>n;
    vi a(n);
    for (int i = 0; i < n; ++i) {
        cin>>a[i];
    }
    vi ans(n);
    for (int i = 0; i < n; ++i) {
        int idx = -1;
        for (int j = 0; j < i; ++j) {
            if (a[j]==a[i]){
                idx = max(idx,j);
            }
        }
        if (idx!=-1) {
            for (int j = idx; j < i; j++) {
                ans[j] = a[i];
                a[j] = a[i];
            }
        }
        ans[i] = a[i];
    }
    for (int i = 0; i < n; ++i) {
        cout<< ans[i] << endl;
    }
}

int32_t main() {
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(false);
    cin.tie(0);



    int t = 1;
  //  cin >> t;
    for (int i = 1; i <= t; i++) {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n";
    return 0;
}

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