#include<bits/stdc++.h>
using namespace std;
#define _ int v, int tl, int tr, int l, int r
#define tm (tl+tr >> 1)
#define sol v+v,tl,tm,l,r
#define sag v+v+1,tm+1,tr,l,r
#define mp make_pair
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef pair < ll , ll > pp;
const int mod = 1e9 + 7;
const int N = 1e6 + 6;
ll H[N],A[N],B[N],L[N],R[N],n,i,l,r,t,x;
ll minimum_walk(vector < int > p , int s){
memset(H , 0 , sizeof H);
x = t = 0;
n = p.size();
for(i=0;i<n;i++){
x += abs(p[i] - i);
if(H[i]) continue;
l = r = i;
for(x=i; !H[x] ; x = p[x]){
H[x] = 1;
l = min(l , i);
r = max(r , i);
}
A[l] = r;
B[r] = l;
}
for(r=-1,i=0;i<n;i++){
r = max(r , A[i]);
R[i] = r;
}
for(l=n,i=n-1; i>=0 ;i--){
l = min(l , B[i]);
L[i] = l;
}
for(i=n-1; i>=0 && p[i] == i ; i--);
for(x=R[s]+1; x <= i; x = R[x]+1){
t++;
}
for(i=0; i<n && p[i] == i ; i++);
for(x=L[s]-1; x >= i ; x = L[x]-1){
t++;
}
return x + 2 * t;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2050 ms |
8184 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2050 ms |
8184 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2050 ms |
8184 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2025 ms |
8184 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2050 ms |
8184 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |