Submission #1145475

#TimeUsernameProblemLanguageResultExecution timeMemory
1145475fabijan_cikacStone Arranging 2 (JOI23_ho_t1)C++20
100 / 100
124 ms12228 KiB
#include <bits/stdc++.h> using namespace std; const int N = 2 * 1e5 + 100; int n, a[N]; unordered_map<int, int> last; int main(){ cin >> n; for (int i = 1; i <= n; ++i){ cin >> a[i]; last[a[i]] = i; } int x = 1; while (x <= n){ int y = last[a[x]] + 1; for (int i = x; i < y; ++i) cout << a[x] << '\n'; x = y; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...