# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
828387 | tolbi | Ancient Books (IOI17_books) | C++17 | 276 ms | 31540 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;
#include "books.h"
long long minimum_walk(std::vector<int> p, int s) {
int n = p.size();
vector<bool> vis(n,false);
vector<pair<int,int>> hehe;
for (int i = 0; i < n; i++){
if (vis[i]) continue;
int node = i;
if (p[node]==node) continue;
while (!vis[node]){
vis[node]=true;
hehe.push_back({min(node,p[node]),1});
hehe.push_back({max(node,p[node]),-1});
node=p[node];
}
}
sort(hehe.begin(), hehe.end());
long long ans = 0;
int crr = 0;
int indi = 0;
for (int i = 0; i < n-1; i++){
while (indi<hehe.size() && hehe[indi].first<=i){
crr+=hehe[indi].second;
indi++;
}
if (indi!=hehe.size() && crr==0){
ans+=2;
}
if (crr>0) ans+=crr;
}
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... |