| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 775816 | Jomnoi | Ancient Books (IOI17_books) | C++17 | 95 ms | 18808 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>
#include "books.h"
using namespace std;
const int MAX_N = 1e6 + 5;
int qs[MAX_N];
long long minimum_walk(vector <int> p, int s) {
for (int i = 0; i < p.size(); i++) {
qs[min(i, p[i])]++;
qs[max(i, p[i])]--;
}
long long ans = 0;
int sum = 0, cnt = 0;
for (int i = 0; i < p.size(); i++) {
sum += qs[i];
ans += sum;
if (sum == 0) cnt++;
else ans += 2 * cnt, cnt = 0;
}
return ans;
}
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... | ||||
