| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1014715 | snpmrnhlol | Stone Arranging 2 (JOI23_ho_t1) | C++17 | 175 ms | 14472 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
const int N = 2e5;
int v[N];
map<int,int>f;
int main(){
int n;
cin>>n;
for(int i = 0;i < n;i++){
cin>>v[i];
f[v[i]] = i;
}
int i = 0;
while(i < n){
int j = f[v[i]];
while(i <= j){
cout<<v[j]<<'\n';
i++;
}
}
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
