| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 155688 | dolphingarlic | Ancient Books (IOI17_books) | C++14 | 2 ms | 376 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 "books.h"
#include <math.h>
bool visited[1000000];
long long minimum_walk(std::vector<int> p, int s) {
int last = s;
long long ans = 0;
for (int i = 0; i < p.size(); i++) {
if (!visited[i]) {
ans += std::abs(i - last);
last = i;
int curr = i, val = p[i];
while (!visited[curr]) {
visited[curr] = true;
ans += std::abs(curr - val);
curr = val;
val = p[curr];
}
}
}
return ans + std::abs(last - s);
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
