# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
805028 | Ellinor | Ancient Books (IOI17_books) | C++14 | 111 ms | 20944 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;
#define rep(i,a,b) for (int i = (a); i < (b); i++)
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
#include "books.h"
long long minimum_walk(std::vector<int> p, int s)
{
int cycles = 0;
vector<int> cycle(p.size(), -1);
vector<pii> lohi;
ll base = 0;
rep(i,0,p.size())
{
if (p[i] == i) cycle[i] = -1;
else if (cycle[i] == -1)
{
cycle[i] = cycles;
base += abs(i - p[i]);
int at = p[i], low = i, high = i;
while (at != i)
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... |