Submission #774647

#	Time	Username	Problem	Language	Result	Execution time	Memory
774647		vjudge1	Stone Arranging 2 (JOI23_ho_t1)	C++17	25 / 100	2084 ms	1492 KiB

Main

#include <iostream>
#include <vector>
#include <utility>
#include <sstream>
#include <climits>
#include <cstring>
#define ll long long
#define ld long double
using namespace std;
const ll mod = 1e9 + 7;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;

void solve()
{
    int n;
    cin >> n;
    vi color(n);
    for (int i = 0; i < n; i++)
    {
        cin >> color[i];
        int idx = i;
        for (int j = i - 1; j >= 0; j--)
        {
            if (color[i] == color[j])
            {
                idx = j;
                break;
            }
        }
        for (int j = idx; j < i; j++)
        {
            color[j] = color[i];
        }
    }
    for (int i = 0; i < n; i++)
    {
        cout << color[i] << "\n";
    }
}

int main()
{
    // freopen("input_text", "r", stdin);
    // freopen("output_text", "w", stdout);
    // ios_base::sync_with_stdio(NULL); cin.tie(0); cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t-- > 0)
        solve();
}

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