제출 #73309

#제출 시각아이디문제언어결과실행 시간메모리
73309Sa1378Ancient Books (IOI17_books)C++17
12 / 100
4 ms676 KiB
#include "books.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N ((int)1001*1000)

int n;
ll prt[N],ans;

ll minimum_walk(vector<int> p, int s)
{
	if(s)return 0;
	n=p.size();
	for(int i=0;i<n;i++)
	{
		prt[min(i,p[i])]++;
		prt[max(i,p[i])]--;
	}
	for(int i=0;i<n;i++)
	{
		if(i)prt[i]+=prt[i-1];
		ans+=prt[i];
	}
	if(!ans)return ans;
	for(int i=0;i<n;i++)
	{
		if(prt[i])break;
		ans+=2;
	}
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...