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<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
tree<int,null_type,greater<int>,rb_tree_tag,tree_order_statistics_node_update>st;
#include "books.h"
//#include"grader.cpp"
long long minimum_walk(vector<int> p, int s) {
st.clear();
long long res=0,mx=0;
for(auto&x:p){
int temp=2*st.order_of_key(x);
if(temp)mx=max(mx,1LL*x);
res+=temp;
st.insert(x);
}
res+=mx*2;
return res;
}
# | 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... |