제출 #1092825

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

Main

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ldb;
 
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ldb,ldb> pdd;
 
#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,a) for(int i = b; i >= a; i--)
#define trav(a,x) for (auto& a : x)
 
#define sz(a) (int)(a).size()
#define pb push_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

const int mod = 1000000007;
const int inf = 1e9 + 5;
const int mxN = 200005; 

int n;
int niz[mxN];

int R[mxN];

int main() {
    cin.tie(0)->sync_with_stdio(0);

    cin >> n;
    ff(i,1,n)cin >> niz[i];

    map<int,int> last;
    fb(i,n,1){
        int X = niz[i];

        if(last.count(X))R[i] = last[X];
        else last[X] = i;

    }

    ff(i,1,n){
        if(R[i] == 0)continue;

        ff(j,i,R[i])niz[j] = niz[i];
        i = R[i];

    }

    ff(i,1,n)cout << niz[i] << " ";
    cout << '\n';

    return 0;
}
/*
 
6
1 2 3 3 2 1
 
// probati bojenje sahovski
*/
 
 
 
 
 

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