# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
565287 | hoanghq2004 | Ancient Books (IOI17_books) | C++14 | 180 ms | 35388 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>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "books.h"
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
long long minimum_walk(vector<int> p, int s) {
int n = p.size();
vector <int> vis(n, 0);
vector <pair <int, int>> S;
long long tot = 0;
int last = 0;
if (is_sorted(p.begin(), p.end())) return 0;
for (int i = n - 1; i >= 0; --i) {
if (p[i] != i) {
last = i + 1;
break;
}
}
for (int u = 0; u < n; ++u) {
tot += abs(u - p[u]);
if (vis[u]) continue;
int v = u;
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... |