| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1026240 | overwatch9 | Stone Arranging 2 (JOI23_ho_t1) | C++17 | 163 ms | 12484 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> nums(n);
for (int i = 0; i < n; i++)
cin >> nums[i];
map <int, int> nxt;
for (int i = 0; i < n; i++) {
nxt[nums[i]] = i;
}
for (int i = 0; i < n; ) {
int p = nxt[nums[i]];
while (i <= p) {
cout << nums[p] << '\n';
i++;
}
}
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
