Submission #1102555

#TimeUsernameProblemLanguageResultExecution timeMemory
1102555ramzialoulouStone Arranging 2 (JOI23_ho_t1)C++17
60 / 100
2077 ms5328 KiB
#include <bits/stdc++.h> using namespace std; #ifdef Ramzi #include "debug.h" #else #define debug(...) #endif int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } map<int, int> pos; for (int i = 0; i < n; i++) { int j = n - 1; while (j >= 0 && a[j] != a[i]) { --j; } pos[a[i]] = j; } for (int i = 0; i < n; i++) { for (int j = i; j < pos[a[i]]; j++) { a[j] = a[i]; } i = pos[a[i]]; debug(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...