# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
105034 | bert30702 | Ancient Books (IOI17_books) | C++17 | 37 ms | 31708 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"
#define pii pair<int, int>
#define F first
#define S second
using namespace std;
const int MX = 1e6 + 100;
int boss[MX];
int Find(int u) {
return boss[u] == u ? u : boss[u] = Find(boss[u]);
}
void merge(int a, int b) {
boss[Find(a)] = Find(b);
}
priority_queue<int> pq[MX];
long long minimum_walk(vector<int> p, int s) {
long long sum = 0;
for(int i = 0; i < p.size(); i ++) boss[i] = i;
for(int i = 0; i < p.size(); i ++) sum += abs(i - p[i]), merge(i, p[i]);
vector<pair<int, pii> > E;
for(int i = 0; i + 1 < p.size(); i ++) {
if(p[i] == i and i != s) continue;
int ptr = i + 1;
if(ptr + 1 < p.size() and Find(p[ptr + 1]) == Find(i)) ptr ++;
if(Find(ptr) != Find(i)) E.push_back({ptr - i, {i, ptr}});
}
sort(E.begin(), E.end());
for(auto it: E) {
if(Find(it.S.F) != Find(it.S.S)) {
merge(it.S.F, it.S.S);
sum += 2 * it.F;
}
}
return sum;
}
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... |