| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1065745 | TheQuantiX | 고대 책들 (IOI17_books) | C++17 | 609 ms | 42756 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"
#pragma GCC optimize("O3,unroll-loops")
using namespace std;
using ll = long long;
constexpr ll INF = 1000000000000000000LL;
ll n, m, q, k, x, y, a, b, c;
// map< pair< vector<int>, pair<int, int> >, ll > mp;
vector<int> perfect;
long long minimum_walk(vector<int> p, int s) {
perfect.reserve(p.size());
for (int i = 0; i < p.size(); i++) {
perfect.push_back(i);
}
if (p == perfect) {
return 0;
}
ll num = 0;
set<int> st;
vector<bool> b(p.size());
for (int i = 0; i < p.size(); i++) {
num += abs(i - p[i]);
st.insert(p[i]);
if (st.count(i)) {
st.erase(i);
}
if (st.size() == 0 || *st.rbegin() <= i) {
// cout << i << '\n';
b[i] = 1;
}
}
// cout << "DEBUG" << endl;
bool fl = 0;
for (int i = p.size() - 1; i >= 0; i--) {
if (fl && b[i]) {
num += 2;
}
if (p[i] != i) {
fl = 1;
}
}
return num;
}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... | ||||
