Submission #1029042

#	Time	Username	Problem	Language	Result	Execution time	Memory
1029042		amirhoseinfar1385	Ancient Books (IOI17_books)	C++17	0 / 100	1 ms	2396 KiB

books

#include"books.h"
#include <vector>
#include<bits/stdc++.h>
const int maxn=1000000+10;
using namespace std;
int vis[maxn],visa[maxn];
int n;

long long minimum_walk(std::vector<int> p, int s){
	n=p.size();
	for(int i=0;i<=n;i++){
		vis[i]=visa[i]=0;
	}
	long long mainres=0,last=0;
	int cnt1=0;
	for(int i=0;i<n;i++){
		if(p[i]>i){
			cnt1++;
			visa[p[i]]=1;
		}
		if(visa[i]){
			cnt1--;
		}
		mainres+=cnt1*2;
		if(cnt1!=0){
			last=i+1;
		}
	}
	for(int i=0;i<=last;i++){
		if(vis[i]==0){
			mainres+=2;
			int now=i;
			do{
				vis[now]=1;
				now=p[now];
			}while(now!=i);
		}
	}
	mainres-=2;
	return mainres;
}

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