Submission #165278

#	Time	Username	Problem	Language	Result	Execution time	Memory
165278		Segtree	Ancient Books (IOI17_books)	C++14	50 / 100	203 ms	13736 KiB

books

#include<iostream>
#include<algorithm>
#include<vector>
#include"books.h"
using namespace std;
typedef long long ll;
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define N 1000010
ll minimum_walk(vector<int> p,int s){
    int n=p.size();
    ll sum=0;
    for(int i=0;i<n;i++)sum+=abs(i-p[i]);
    bool vis[N];
    for(int i=0;i<n;i++)vis[i]=0;
    vector<pair<ll,ll> >v;
    for(int i=0;i<n;i++){
	if(vis[i])continue;
	ll x=i;
	ll mi=1e17,ma=-1e17;
	while(1){
	    chmin(mi,x);
	    chmax(ma,x);
	    vis[x]=1;
	    x=p[x];
	    if(x==i)break;
	}
	if(mi!=ma){
	    v.push_back(make_pair(mi,ma));
	}
    }
    v.push_back(make_pair(s,s));
    sort(v.begin(),v.end());
    ll rnd=-1;
    for(int i=0;i<v.size();i++){
	if(~rnd&&rnd<v[i].first)sum+=2*(v[i].first-rnd);
	chmax(rnd,v[i].second);
    }
    return sum;
}

Compilation message (stderr)

books.cpp: In function 'll minimum_walk(std::vector<int>, int)':
books.cpp:35:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<v.size();i++){
                 ~^~~~~~~~~

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