Submission #925472

#TimeUsernameProblemLanguageResultExecution timeMemory
925472jcelinStone Arranging 2 (JOI23_ho_t1)C++14
100 / 100
142 ms16064 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int,int> ii; typedef pair<ll,ll> pll; typedef vector<int> vi; typedef vector<ii> vii; typedef vector<ll> vll; typedef vector<pll> vpll; #define PB push_back #define PF push_front #define PPB pop_back #define PPF pop_front #define X first #define Y second #define MP make_pair #define all(x) (x).begin(), (x).end() const int mod = 1e9 + 7; //998244353; const int inf = 1e9 + 7; const ll INF = 1e18 + 7; const int logo = 20; const int MAXN = 1e6 + 7; const int off = 1 << logo; const int trsz = off << 1; const int dx[] = {1, -1, 0, 0}; const int dy[] = {0, 0, -1, 1}; map<int, int> f; int arr[MAXN]; vi st; void solve(){ int n; cin >> n; for(int i=1; i<=n; i++){ int x; cin >> x; if(f[x] != 0){ while(1){ int u = st.back(); st.PPB(); f[arr[u]]--; if(arr[u] == x) break; } } st.PB(i); f[x] = 1; arr[i] = x; } int j = 0; for(int i=1; i<=n; i++){ if(i > st[j]) j++; cout << arr[st[j]] << "\n"; } } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int tt = 1; //cin >> tt; while(tt--) solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...