Submission #759659

#TimeUsernameProblemLanguageResultExecution timeMemory
759659raysh07Stone Arranging 2 (JOI23_ho_t1)C++17
100 / 100
176 ms18308 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define INF (int)1e18 #define f first #define s second mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count()); void Solve() { 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; } int p = 0; while (p < n){ int lol = last[a[p]]; for (int i = p; i <= lol; i++) a[i] = a[p]; p = lol + 1; } for (int i = 0; i < n; i++) cout << a[i] << "\n"; } int32_t main() { auto begin = std::chrono::high_resolution_clock::now(); ios_base::sync_with_stdio(0); cin.tie(0); int t = 1; // cin >> t; for(int i = 1; i <= t; i++) { //cout << "Case #" << i << ": "; Solve(); } auto end = std::chrono::high_resolution_clock::now(); auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin); cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...