Submission #899442

#	Time	Username	Problem	Language	Result	Execution time	Memory
899442		Ice_man	Stone Arranging 2 (JOI23_ho_t1)	C++14	100 / 100	67 ms	14044 KiB

Main

#include <iostream>
#include <chrono>
#include <unordered_map>

#define maxn 300005
#define maxlog 20
#define INF 1000000010
#define LINF 1000000000000000005
#define endl '\n'
#define pb(x) push_back(x)
#define X first
#define Y second
#define control cout<<"passed"<<endl;

#pragma GCC optimize("O3" , "Ofast" , "unroll-loops" , "fast-math")
#pragma GCC target("avx2")

using namespace std;

std::chrono::high_resolution_clock::time_point startT, currT;
constexpr double TIME_MULT = 1;

double timePassed()
{
    using namespace std::chrono;
    currT = high_resolution_clock::now();
    double time = duration_cast<duration<double>>(currT - startT).count();
    return time * TIME_MULT;
}

int n;
int a[maxn];

unordered_map <int , int> r;

void read()
{
    cin >> n;

    for(int i = 1; i <= n; i++)
        cin >> a[i];

    for(int i = 1; i <= n; i++)
        r[a[i]] = i;
}


void solve()
{
    int j;

    for(int i = 1; i <= n; i++)
    {
        j = r[a[i]];

        for(int k = i; k <= j; k++)
            cout << a[i] << endl;

        i = j;


    }

}




int main()
{

/**#ifdef ONLINE_JUDGE
    freopen("taxi.in", "r", stdin);
    freopen("taxi.out", "w", stdout);
#endif*/

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    startT = std::chrono::high_resolution_clock::now();

    read();
    solve();


    return 0;
}

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