| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 928997 | SuPythony | Stone Arranging 2 (JOI23_ho_t1) | C++17 | 177 ms | 12652 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;
typedef long long ll;
int main() {
int n; cin>>n;
map<int,int> f;
vector<int> cols;
for (int i=0; i<n; i++) {
int c; cin>>c;
cols.push_back(c);
f[c]=i;
}
int prev=cols[0];
cout<<cols[0]<<"\n";
for (int i=1; i<n; i++) {
if (i<=f[prev]) {
cout<<prev<<"\n";
} else {
prev=cols[i];
cout<<prev<<"\n";
}
}
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... | ||||
