| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1333223 | ricardsjansons | Stone Arranging 2 (JOI23_ho_t1) | C++20 | 57 ms | 12816 KiB |
#include <bits/stdc++.h>
#define umap unordered_map
using namespace std;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int n;cin>>n;
vector<array<int,2>>v;
umap<int,int>m;
for(int i=0;i<n;i++){
int a;cin>>a;
if(m[a]){
while(v.back()[0]!=a){
m[v.back()[0]]--;
v.pop_back();
}
}else{
v.push_back({a,i});
m[a]++;
}
}
reverse(v.begin(),v.end());
int c=0;
for(int i=0;i<n;i++){
if(v.size()&&v.back()[1]==i){
c=v.back()[0];
v.pop_back();
}
cout<<c<<"\n";
}
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
