Submission #1320606

#TimeUsernameProblemLanguageResultExecution timeMemory
1320606feev1xStone Arranging 2 (JOI23_ho_t1)C++20
100 / 100
148 ms12468 KiB
#include <bits/stdc++.h> int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); int n; std::cin >> n; std::vector<int> a(n); std::map<int, int> r; int nw = 0; for (auto &u: a) { std::cin >> u; r[u] = nw; nw++; } for (int i = 0; i < n; ++i) { int cnt = r[a[i]] - i; while (cnt--) { std::cout << a[i] << '\n'; } if (r[a[i]] == i) { std::cout << a[i] << '\n'; continue; } i = r[a[i]] - 1; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...