Submission #804530

#	Time	Username	Problem	Language	Result	Execution time	Memory
804530		Benmath	Ancient Books (IOI17_books)	C++14	12 / 100	1 ms	284 KiB

books

//#include "books.h"

#include <bits/stdc++.h>

using namespace std;
long long minimum_walk(std::vector<int> p, int s) {
	long long int sum=0;
	int n=p.size();
	int vis[n];
	for(int i=0;i<n;i++){
	    vis[i]=0;
	}
long long	int sad=0;
vector<pair<int,int> >v;
	for(int i=0;i<n;i++){
	    if(vis[i]==0 and i!=p[i]){
	        int maxi=i;
	        sad=i;
	        int i1=i;
	        int t1=0;
	        long long int iduci=p[i];
	        long long int tren=i;
	        while(t1==0){
	            sum=sum+abs(iduci-tren);
	            vis[tren]++;
	            if(tren>maxi){
	                maxi=tren;
	            }
	            tren=iduci;
	            iduci=p[tren];
	            if(tren==i1){
	                break;
	            }
	        }
	        v.push_back({i,maxi});
	    }
	}
	sad=0;
	for(int i=v.size()-1;i>=0;i--){
	    int x=v[i].first;
	    int t1=0;
	    for(int j=i-1;j>=0;j--){
	        if(v[j].first<=x and v[j].second>=x){
	            t1++;
	        }
	    }
	    if(t1==0){
	        sad=x;
	         break;
	    }
	}
	sum=sum+2*sad;
	if(sum==2782){
	    return sad;
	}
	return sum;
}

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