제출 #947664

#제출 시각아이디문제언어결과실행 시간메모리
947664biankStone Arranging 2 (JOI23_ho_t1)C++14
100 / 100
150 ms14724 KiB
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector<int> a(n); map<int, int> last; for (int i = 0; i < n; i++) { cin >> a[i]; last[a[i]] = i; } for (int i = 0; i < n; i = last[a[i]] + 1) { for (int j = i; j < last[a[i]]; j++) { a[j] = a[i]; } } for (int i = 0; i < n; i++) { cout << a[i] << '\n'; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...