Submission #1308225

#	Time	Username	Problem	Language	Result	Execution time	Memory
1308225		xosqedemrufo	Stone Arranging 2 (JOI23_ho_t1)	C++20	25 / 100	2094 ms	2340 KiB

Main

//Author RufatM
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<string> vs;
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define endl '\n'
#define pb push_back
#define pf push_front
#define eb emplace_back
#define ff first
#define ss second
#define all(x) begin(x),end(x)
#define rall(x) rbegin(x),rend(x)
#define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
const int MOD=1e9+7;
const int INF=1e9;
const ll LINF=1e18;
const int MAXN=2e5+5;
void solve(){
    int n;
    cin >> n;
    vi a(n);
    for(int i=0;i<n;i++){
        cin >> a[i];
    }
    vi col(n);
    for(int i=0;i<n;i++){
        col[i] = a[i];
        int last = -1;
        for(int j=i-1;j>=0;j--){
            if(col[j]==a[i]){
                last = j;
                break;
            }
        }
        if(last != -1){
            for(int j=last+1;j<i;j++){
                col[j] = a[i];
            }
        }
    }
    for(int i=0;i<n;i++){
        cout << col[i] << endl;
    }
}
signed main(){
    fastio;
    int t=1;
    //cin >> t;
    while(t--){
        solve();
    }
}

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