Submission #1147671

#	Time	Username	Problem	Language	Result	Execution time	Memory
1147671		SSSM	Stone Arranging 2 (JOI23_ho_t1)	C++20	100 / 100	186 ms	16540 KiB

Main

#include <bits/stdc++.h>

/*
#pragma GCC optimize("O3")
*/
#pragma GCC optimize("Ofast")
#pragma GCC target ("avx2")


using namespace std;

/*
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds;
template<class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
*/

#define F first
#define S second
#define pb push_back
#define md(a) (a%mod)
#define all(a) a.begin(), a.end()
#define MP make_pair
#define lc (id<<1)
#define rc (lc|1)
#define mid (l+r)/2
#define kill(a) cout << a << "\n", exit(0)
#define SZ(a) (ll)a.size()

typedef pair<int,int> pii;
typedef pair<long long ,long long> pll;
typedef long long ll;
typedef long double ld;
typedef vector<vector<ll>> matrix;
mt19937_64  rng(chrono::steady_clock::now().time_since_epoch().count());

ll const maxn=2e5+10, mod=1e9+7, INF=1e18, LOG=31, sq=65;

ll poww(ll a, ll b, ll mod) {
 if (b == 0) return 1;
 return 1 * poww(1 * a * a % mod, b / 2, mod) * ((b % 2 == 1) ? a : 1) % mod;
}

ll n, A[maxn];
map<ll, ll> mp;
int main()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

    cin>>n;
    for(ll i=1;i<=n;i++)
    {
        cin>>A[i];
        mp[A[i]]=i;
    }
    ll x=1;
    while(x<=n)
    {
        for(ll i=x;i<=mp[A[x]];i++) cout<<A[x]<<"\n";
        x=mp[A[x]]+1;
    }

    return 0;
}

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