Submission #977958

#TimeUsernameProblemLanguageResultExecution timeMemory
977958Angus_YeungStone Arranging 2 (JOI23_ho_t1)C++17
35 / 100
24 ms4444 KiB
#include <bits/stdc++.h> #define x first #define y second #define pii pair<ll, ll> typedef long long ll; const ll MOD = 1000000007LL; const ll INF = 1e15; using namespace std; ll n, a[200010]; map<ll, ll> f; stack<ll> stk; int main() { cin.tie(0); cout.tie(0); ios::sync_with_stdio(0); cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; if (!f[a[i]]) stk.push(i), f[a[i]]++; else { while (!stk.empty() && a[stk.top()] != a[i]) f[a[stk.top()]]--, a[stk.top()] = a[i], stk.pop(); stk.push(i), f[a[i]]++; } } for (int i = 1; i <= n; i++) cout << a[i] << "\n"; return 0; } /* */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...