Submission #152026

#	Time	Username	Problem	Language	Result	Execution time	Memory
152026		qkxwsm	Ancient Books (IOI17_books)	C++14	0 / 100	2 ms	400 KiB

books

#include <bits/stdc++.h>

using namespace std;

template<class T, class U>
void ckmin(T &a, U b)
{
	if (a > b) a = b;
}
template<class T, class U>
void ckmax(T &a, U b)
{
	if (a < b) a = b;
}

#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define SZ(x) ((int) ((x).size()))
#define ALL(x) (x).begin(), (x).end()
#define MAXN 1000013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;

int N, S;
int arr[MAXN];
ll ans;

ll minimum_walk(vi perm, int s)
{
	N = SZ(perm); S = s;
	FOR(i, 0, N)
	{
		arr[i] = perm[i];
	}
	FOR(i, 0, N)
	{
		ans += abs(arr[i] - i);
	}
	int mx = 0;
	FOR(i, 0, N - 1)
	{
		ckmax(mx, arr[i]);
		if (mx == i) ans += 2;
	}
	return ans;
}

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