Submission #1196126

#TimeUsernameProblemLanguageResultExecution timeMemory
1196126CELD_07Stone Arranging 2 (JOI23_ho_t1)C++20
100 / 100
170 ms17992 KiB
#include<bits/stdc++.h> #include<ext/pb_ds/assoc_container.hpp> typedef long long ll; typedef long double ld; #define endl "\n" #define vll vector<ll> #define sd second #define ft first #define all(x) x.begin(),x.end() #define allr(x) x.rbegin(),x.rend() #define pll pair<ll, ll> #define mod 998244353 #define _set tree<pll, null_type, less<pll>, rb_tree_tag, tree_order_statistics_node_update> #define inf (ll)1e15 #define PRESICION(x) cout.setf(ios::fixed,ios::floatfield); cout.precision(x); #define dgb(x) cout<<#x<<" : "<<x<<"\n" using namespace std; using namespace __gnu_pbds; ll dx[]={1, -1, 0, 0}; ll dy[]={0, 0, 1, -1}; inline ll sm(ll a, ll b){ return ((a%mod)+(b%mod))%mod; } inline ll ml(ll a, ll b){ return ((a%mod)*(b%mod))%mod; } inline ll rs(ll a, ll b){ return ((a%mod)-(b%mod)+mod)%mod; } ll bpow(ll a , ll b) { if (b==0)return 1; if (b%2!=0)return ((bpow(a, b-1)%mod)*(a%mod))%mod; ll r=bpow (a ,b/ 2) ; return ((r%mod)*(r%mod))%mod; } inline ll q(vector<ll>& v1, ll l, ll r){ return (l==0 ? v1[r]: v1[r]-v1[l-1]); } inline void solve(){ ll a, b, c=0 , d=0, e, f=0, g=0, h=1; cin>>a; vector<ll> v(a), v1; for(int i=0; i<a; i++)cin>>v[i]; map<ll, ll> m; for(int i=0; i<a; i++){ m[v[i]]=i; } vector<ll> res(a); ll i=0; while(i<a){ for(int j=i; j<=m[v[i]]; j++)res[j]=v[i]; i=m[v[i]]+1; } for(auto y: res)cout<<y<<endl; } int main(){ //freopen("time.in", "r", stdin);freopen("time.out", "w", stdout); ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr); //PRESICION(15) //int t;cin>>t;while(t--) solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...