Submission #1199833

#TimeUsernameProblemLanguageResultExecution timeMemory
1199833BoomydayStone Arranging 2 (JOI23_ho_t1)C++20
100 / 100
393 ms13376 KiB
// // Created by adavy on 5/11/2025. // #include <bits/stdc++.h> using namespace std; using ll = long long; int main(){ int N; cin >> N; vector<int> nums(N); map<int, int> last; for(int i=0;i<N;++i){ cin >> nums[i]; last[nums[i]] = i; } vector<int> ans(N, -1); for(int i=0;i<N;){ int x = nums[i]; for(;i<=last[x];++i){ ans[i] = x; } } for(int i=0;i<N;++i){ cout << ans[i] << endl; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...