# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1225611 | TadijaSebez | Stone Arranging 2 (JOI23_ho_t1) | C++20 | 132 ms | 13240 KiB |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
scanf("%i",&n);
vector<pair<int,int>> stk;
set<int> all;
for(int i=1;i<=n;i++){
int x;
scanf("%i",&x);
if(all.find(x)!=all.end()){
while(stk.back().first!=x){
all.erase(stk.back().first);
stk.pop_back();
}
}else{
stk.push_back({x,i});
all.insert(x);
}
}
for(int i=0;i<stk.size();i++){
int from=stk[i].second;
int to=i+1==stk.size()?n:stk[i+1].second-1;
for(int j=from;j<=to;j++)printf("%i\n",stk[i].first);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |