Submission #730451

#TimeUsernameProblemLanguageResultExecution timeMemory
730451stevancvStone Arranging 2 (JOI23_ho_t1)C++14
100 / 100
304 ms12544 KiB
#include <bits/stdc++.h> #define ll long long #define ld long double #define sp ' ' #define en '\n' #define smin(a, b) a = min(a, b) #define smax(a, b) a = max(a, b) using namespace std; const int N = 1e5 + 2; const int inf = 2e9; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin >> n; vector<int> a(n); map<int, int> lst; for (int i = 0; i < n; i++) { cin >> a[i]; lst[a[i]] = i; } for (int i = 0; i < n; i++) { for (int j = i; j <= lst[a[i]]; j++) cout << a[i] << en; i = lst[a[i]]; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...