Submission #775107

#	Time	Username	Problem	Language	Result	Execution time	Memory
775107		vjudge1	Stone Arranging 2 (JOI23_ho_t1)	C++17	100 / 100	70 ms	12884 KiB

Main

#include <bits/stdc++.h>

// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")

typedef unsigned short u16;
typedef short i16;
typedef unsigned int u32;
typedef int i32;
typedef unsigned long long u64;
typedef long long i64;
typedef float f32;
typedef double f64;
typedef long double f80;
typedef long double f128;

namespace std
{
    template <typename T, typename U>
    struct hash<pair<T, U>>
    {
        size_t operator()(const pair<T, U>& x) const { return hash<T>()(x.first) ^ hash<U>()(x.second); }
    };
}  // namespace std

struct custom_hash
{
    static u64 splitmix64(u64 x)
    {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    std::size_t operator()(u64 x) const
    {
        static const u64 rand_time = std::chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + rand_time);
    }
};

template <typename T>
using limits = std::numeric_limits<T>;

#ifdef LOCAL
#include <chrono>

#include "tools.hpp"
#define here(...)                                                                \
    std::cerr << __func__ << ':' << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; \
    _debug(__VA_ARGS__)
#else
#define here(...)
#endif

void solve()
{
    u32 n;
    std::cin >> n;
    std::vector<u32> colors(n);
    for (auto& i : colors)
    {
        std::cin >> i;
    }
    std::unordered_map<u32, u32, custom_hash> rm;
    for (u32 i = 0; i < n; i++)
    {
        rm[colors[i]] = std::max(rm[colors[i]], i);
    }
    std::vector<u32> res(n);
    u32 curr_pos{};
    while (curr_pos != n)
    {
        u32 next_pos = rm[colors[curr_pos]] + 1;
        for (u32 i = curr_pos; i < next_pos; ++i)
        {
            res[i] = colors[curr_pos];
        }
        curr_pos = next_pos;
    }
    for (auto& i : res)
    {
        std::cout << i << '\n';
    }
}

int main()
{
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
#ifdef LOCAL
    using std::chrono::duration_cast;
    using std::chrono::high_resolution_clock;
    using std::chrono::microseconds;
    auto st = high_resolution_clock::now();
    std::ifstream input("./in.txt");
    std::ofstream output("./log/bsol.txt");
    auto cin_buf = std::cin.rdbuf(input.rdbuf());
    auto cout_buf = std::cout.rdbuf(output.rdbuf());
#endif
    solve();
#ifdef LOCAL
    std::cin.rdbuf(cin_buf);
    std::cout.rdbuf(cout_buf);
    input.close();
    output.close();
    auto ed = high_resolution_clock::now();
    std::cerr << "Time elapsed: " << duration_cast<microseconds>(ed - st).count() << " microseconds\n";
#endif
    return 0;
}

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