Submission #827724

#TimeUsernameProblemLanguageResultExecution timeMemory
827724CSQ31Stone Arranging 2 (JOI23_ho_t1)C++17
100 / 100
136 ms15156 KiB
#include<bits/stdc++.h> using namespace std; #define pb push_back #define fi first #define se second #define sz(a) (int)(a.size()) #define all(a) a.begin(),a.end() #define lb lower_bound #define ub upper_bound #define owo ios_base::sync_with_stdio(0);cin.tie(0); #define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr) #define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\ debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC)) typedef long long int ll; typedef long double ld; typedef pair<ll,ll> PII; typedef pair<int,int> pii; typedef vector<vector<int>> vii; typedef vector<vector<ll>> VII; ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);} int main() { owo int n; cin>>n; vector<pii>a; multiset<int>s; for(int i=0;i<n;i++){ int x; cin>>x; if(s.find(x) == s.end()){ a.pb({i,x}); s.insert(x); }else{ while(!a.empty() && a.back().se != x){ s.erase(s.find(a.back().se)); a.pop_back(); } a.back().fi = i; } } int last = -1; for(auto x:a){ for(int i=last+1;i<=x.fi;i++)cout<<x.se<<'\n'; last = x.fi; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...