#include "books.h"
#include<bits/stdc++.h>
#define ii pair<int,int>
#define st first
#define nd second
#define pb push_back
#define all(x) x.begin(),x.end()
#define ll long long
#define sz(x) ((int)x.size())
using namespace std;
long long minimum_walk(std::vector<int> p, int s) {
if(s!=0) return 12312;
ll ans=0;
int n=sz(p);
int last=0;
while(1) {
int go=-1;
for(int i=0;i<n;i++) {
if(p[i]>i) {
go=i;
break ;
}
}
if(go==-1) break ;
ans+=go-last+1;
s=go;
last=go;
int hand=p[s];
p[s]=-1;
int way=0;
s++;
while(1) {
/*for(int i=0;i<n;i++) cerr<<p[i]<<' ';
cerr<<endl;
cerr<<"way is-->"<<way<<endl<<"hand is-->"<<hand<<endl<<"s is-->"<<s<<endl;
getchar();*/
if(way==0) {
if(hand==s) {
swap(hand,p[s]);
if(hand<s && hand!=-1) way=1;
else if(hand>s) way=0;
else break ;
continue ;
}
if(p[s]>hand) swap(hand,p[s]);
s++;
}
else {
if(hand==s) {
swap(hand,p[s]);
if(hand<s && hand!=-1) way=1;
else if(hand>s) way=0;
else break ;
continue ;
}
if(p[s]<hand) swap(hand,p[s]);
s--;
}
ans++;
}
}
return ans+s;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Incorrect |
2 ms |
540 KB |
3rd lines differ - on the 1st token, expected: '8', found: '10' |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Incorrect |
2 ms |
540 KB |
3rd lines differ - on the 1st token, expected: '8', found: '10' |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Incorrect |
2 ms |
540 KB |
3rd lines differ - on the 1st token, expected: '8', found: '10' |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
540 KB |
3rd lines differ - on the 1st token, expected: '3304', found: '12312' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Incorrect |
2 ms |
540 KB |
3rd lines differ - on the 1st token, expected: '8', found: '10' |
4 |
Halted |
0 ms |
0 KB |
- |