# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
384785 | kshitij_sodani | Ancient Books (IOI17_books) | C++14 | 17 ms | 23916 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.
//#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
#define endl '\n'
#include "books.h"
llo ans=0;
llo n;
vector<llo> adj[1000001];
llo vis[1000001];
vector<llo> ss;
void dfs(int no){
vis[no]=1;
ss.pb(no);
for(auto j:adj[no]){
if(vis[j]==0){
dfs(j);
}
}
}
long long minimum_walk(std::vector<int> p, int s) {
n=p.size();
for(int i=0;i<n;i++){
adj[i].pb(p[i]);
}
llo co=0;
llo ans=0;
for(int i=0;i<n;i++){
if(vis[i]==0){
ss.clear();
dfs(i);
co++;
for(int j=0;j+1<ss.size();j++){
ans+=abs(ss[j]-ss[j+1]);
}
/* for(auto j:ss){
cout<<j<<",,";
}
cout<<endl;*/
ans+=(abs(ss[0]-ss.back()));
}
}
ans+=2*(co-1);
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... |