| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 739042 | Toxtaq | Stone Arranging 2 (JOI23_ho_t1) | C++17 | 2058 ms | 1756 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;
int main()
{
int n;
cin >> n;
vector<int>v(n);
for(int i = 0;i < n;++i){
cin >> v[i];
int pos = -1;
for(int j = i - 1;j >= 0;--j){
if(v[i] == v[j]){
pos = j;
break;
}
}
if(pos == -1)continue;
for(int j = pos;j < i;++j){
v[j] = v[i];
}
}
for(int i : v)cout << i << '\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... | ||||
