Submission #581818

#	Time	Username	Problem	Language	Result	Execution time	Memory
581818		Koosha_mv	Ancient Books (IOI17_books)	C++14	0 / 100	1 ms	340 KiB

books

#include "books.h"
#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<x.F<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
 
const int N=1e6+99;
const ll inf=1e15;
 
int n,p[N],vis[N];
ll Max[N];
 
ll minimum_walk(vector<int> p, int s) {
	ll mx=0,sum=0,ans=0;
	n=p.size();
	int l=n,r=0;
	f(i,0,n){
		sum+=abs(p[i]-i);
		if(p[i]!=i) minm(l,i),maxm(r,i);
	}
	l=r=s;
	while(l!=0 || r!=n-1){
		int len=r-l;
		f(i,l,r+1) minm(l,p[i]),maxm(r,p[i]);
		if(r-l==len) ans+=2,l--;
	}
	return ans+sum;
}

Compilation message (stderr)

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:31:5: warning: unused variable 'mx' [-Wunused-variable]
   31 |  ll mx=0,sum=0,ans=0;
      |     ^~

• Subtask 1: 0 / 12
• Subtask 2: 0 / 10
• Subtask 3: 0 / 28
• Subtask 4: 0 / 20
• Subtask 5: 0 / 30