Submission #774661

#	Time	Username	Problem	Language	Result	Execution time	Memory
774661		vjudge1	Stone Arranging 2 (JOI23_ho_t1)	C++17	0 / 100	0 ms	212 KiB

Main

#include <bits/stdc++.h>

using namespace std;

int n;
vector<int> v;
map<int, vector<int>> indexes;
vector<pair<int, int>> results;

int main()
{
    // freopen("inp.txt", "r", stdin);

    ios::sync_with_stdio(false);

    cin >> n;
    v.resize(n + 1);
    for (int i = 1; i <= n; i++)
    {
        cin >> v[i];
        indexes[v[i]].push_back(i);
    }

    for (int i = 1; i <= n;)
    {
        auto p = &indexes[v[i]];
        auto itr = ++lower_bound(p->begin(), p->end(), i);
        if (itr != p->end())
        {
            results.emplace_back(*itr - i + 1, v[i]);
            i = *itr + 1;
        }
        else
        {
            results.emplace_back(1, v[i]);
            i++;
        }
    }

    for (auto &result : results)
        for (int i = 0; i < result.first; i++)
            cout << result.second << '\n';
}

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