제출 #857052

#제출 시각아이디문제언어결과실행 시간메모리
857052NotLinuxStone Arranging 2 (JOI23_ho_t1)C++17
100 / 100
175 ms13396 KiB
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt") void solve(){ int n;cin >> n; vector < int > arr(n),ans(n); for(auto &inp : arr)cin >> inp; map < int , int > ind; for(int i = 0;i<n;i++)ind[arr[i]] = i; for(int i = 0;i<n;i++){ for(int j = i;j<=ind[arr[i]];j++){ ans[j] = arr[i]; } i = ind[arr[i]]; } for(auto itr : ans)cout << itr << '\n'; } signed main(){ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); int testcase = 1;//cin >> testcase; while(testcase--)solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...