# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
566287 | sofapuden | 고대 책들 (IOI17_books) | C++14 | 1 ms | 340 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 "books.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll minimum_walk(vector<int> p, int s) {
ll su = 0;
int mx = 0;
int n = p.size();
vector<int> vis(n,0);
vector<int> cnt(n+1,0);
ll ans = 0;
int cn = 0;
vector<vector<int>> gr(n+1);
for(int i = 0; i < n; ++i){
if(!vis[i]){
cn++;
while(!vis[i]){
ans+=abs(i-p[i]);
vis[i] = cn;
cnt[cn]++;
i = p[i];
}
}
}
int dif = 0;
vector<int> cnt2(n+1,0);
for(int i = 0; i < n; ++i){
if(!cnt2[vis[i]]++)dif++;
if(cnt2[vis[i]] == cnt[vis[i]])dif--;
if(!dif)ans+=2;
}
return ans-2;
}
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... |