제출 #915294

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

Main

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

#define endl '\n'
#define db double
#define ll __int128
#define int long long
#define pb push_back
#define fs first
#define sd second
#define Mod long(1e9 + 7)
#define all(x) x.begin(), x.end()
#define unvisited long(-1)
#define Eps double(1e-9)
#define _for(i, n) for(int i = 0; i < (n); i++)
#define dbg(x) cout << #x ": " << x << endl;

const int Max = 1e6 + 7, Inf = 1e9 + 7;

void print(bool x) { cout << (x ? "YES" : "NO") << endl; }

string tostring (__int128 x)
{
    string ans = "";
    while(x > 0)
    {
        ans += (x % 10 + '0');
        x /= 10;
    }
    reverse(all(ans));
    return ans;
}

struct DSU
{
    vector <int> link, size, mn;

    int find(int x)
    {
        while (x != link[x]) x = link[x];
        return x;
    }

    int query(int x)
    {
        return mn[find(x)];
    }

    void unite(int a, int b)
    {
        a = find(a); b = find(b);
        if(a == b) return;
        if(size[a] < size[b]) swap(a, b);
        mn[a] = min(mn[a], mn[b]);
        size[a] += size[b];
        link[b] = a; 
    }

    DSU(int n)
    {
        link.assign(n+1, 0);
        size.assign(n+1, 1);
        mn.assign(n+1, 0);
        _for(i, n+1) link[i] = mn[i] = i;
    }
};

void solve()
{
    int n; cin >> n; 
    vector <int> v(n);
    map <int, int> mp;
    DSU St(n);
    for(int i = 0; i < n; i++) 
    {
        cin >> v[i]; 
        int x = St.query(mp[v[i]]);
        if(v[x] == v[i])
        {
            int j = i;
            while ((j = St.query(j)) != x)
            {
                St.unite(j, j - 1);
            }
        }
        mp[v[i]] = i;
    }

    for(int i = 0; i < n; i++)
        cout << v[St.query(i)] << " ";
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int Q = 1; //cin >> Q;

    while (Q--)
    {
        solve();
    }

    return 0;
}

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