Submission #774777

#TimeUsernameProblemLanguageResultExecution timeMemory
774777vjudge1Stone Arranging 2 (JOI23_ho_t1)C++17
100 / 100
147 ms13384 KiB
#include<bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 10; int n; int a[MAXN]; map<int, int> tout; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n; for(int i = 1; i <= n; i++){ cin >> a[i]; tout[a[i]] = i; } for(int i = 1; i <= n; i++){ int tmp = a[i]; for(; i < tout[tmp]; i++){ cout << tmp << '\n'; } cout << tmp << '\n'; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...