# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
117666 | sealnot123 | 고대 책들 (IOI17_books) | C++14 | 2 ms | 384 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 "grader.cpp"
#include<bits/stdc++.h>
#define x first
#define y second
#define pb push_back
#define eb emplace_back
#define all(a) (a).begin(),(a).end()
#define SZ(a) (int)(a).size()
using namespace std;
typedef long long LL;
typedef pair<LL,LL> PLL;
typedef pair<int,int> PII;
typedef double D;
typedef long double LD;
const int N = 1000007;
int n;
LL qsl[N],qsr[N];
long long minimum_walk(vector<int> p, int s) {
int a,b,c,d,i,j,k;
n = SZ(p);
for(i=0;i<n;i++){
a = p[i];
b = i;
if(a==b) continue;
if(a>b) qsl[b]++,qsl[a]--;
else qsr[a]++,qsr[b]--;
}
for(i=1;i<n;i++) qsl[i]+=qsl[i-1],qsr[i]+=qsr[i-1];
int l=0,r=n-1;
for(i=0;i<n;i++){
if(qsl[i] || qsr[i]){
l=i; break;
}
}
for(i=n-1;i>=0;i--){
if(qsl[i] || qsr[i]){
r=i; break;
}
}
if(l>r) return 0;
LL ans = 0;
for(i=s;i<=r;i++) ans += max(1ll,max(qsl[i],qsr[i]));
for(i=s-1;i>=l;i--) ans += max(1ll,max(qsl[i],qsr[i]));
return 2*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... |