oj.uz

Submission #410969

# Submission time Handle Problem Language Result Execution time Memory
410969 2021-05-24T02:20:12 Z Kevin_Zhang_TW Ancient Books (IOI17_books) C++17
50 / 100
 129 ms 14820 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
void debug(auto l, auto r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
#include "books.h"

long long minimum_walk(std::vector<int> p, int s) {
	int n = p.size();
	ll res = 0;
	for (int i = 0;i < n;++i)
		res += abs(i - p[i]);

	if (res == 0) return 0;

	int L = 0, R = n-1;
	while (p[L] == L) ++L;
	while (p[R] == R) --R;

	chmax(R, s), chmin(L, s);

	auto expand = [&](int &l, int &r) {
		int nl = min({p[l], p[r], l}), nr = max({p[l], p[r], r});
		while (nl != l || nr != r) {
			while (nl < l) {
				--l;
				chmax(nr, p[l]);
				chmin(nl, p[l]);
			}
			while (nr > r) {
				++r;
				chmax(nr, p[r]);
				chmin(nl, p[l]);
			}
		}
	};

	int l = s, r = s;
	expand(l, r);

	while (l != L || r != R) {
		int costl = 0, costr = 0;
		int nl = l, nr = r;

		bool sig = false;
		{
			int sl = l, sr = r;
			while (sl > L && sr <= r) {
				expand(--sl, sr);
				costl += 2;
			}
			sig |= sr <= r;
			chmin(nl, sl);
			chmax(nr, sr);
		}
		{
			int sl = l, sr = r;
			while (sl >= l && sr < R) {
				expand(sl, ++sr);
				costl += 2;
			}
			if (sig) assert(sl >= l);
			if (sl >= l) {
				assert(sig);
			}
			chmin(nl, sl);
			chmax(nr, sr);
		}
		if (sig) res += costl + costr;
		else res += min(costl, costr);
		l = nl, r = nr;
	}

	return res;

			
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 292 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 292 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 296 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 288 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 288 KB Output is correct
29 Correct 1 ms 204 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 292 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 296 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 288 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 288 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 122 ms 14800 KB Output is correct
31 Correct 122 ms 14800 KB Output is correct
32 Correct 118 ms 14808 KB Output is correct
33 Correct 123 ms 14812 KB Output is correct
34 Correct 129 ms 14764 KB Output is correct
35 Correct 122 ms 14804 KB Output is correct
36 Correct 118 ms 14820 KB Output is correct
37 Correct 119 ms 14816 KB Output is correct
38 Correct 120 ms 14816 KB Output is correct
39 Correct 119 ms 14816 KB Output is correct
40 Correct 119 ms 14812 KB Output is correct
41 Correct 120 ms 14760 KB Output is correct
42 Correct 126 ms 14800 KB Output is correct
43 Correct 121 ms 14800 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 460 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 292 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 296 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 288 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 288 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 122 ms 14800 KB Output is correct
31 Correct 122 ms 14800 KB Output is correct
32 Correct 118 ms 14808 KB Output is correct
33 Correct 123 ms 14812 KB Output is correct
34 Correct 129 ms 14764 KB Output is correct
35 Correct 122 ms 14804 KB Output is correct
36 Correct 118 ms 14820 KB Output is correct
37 Correct 119 ms 14816 KB Output is correct
38 Correct 120 ms 14816 KB Output is correct
39 Correct 119 ms 14816 KB Output is correct
40 Correct 119 ms 14812 KB Output is correct
41 Correct 120 ms 14760 KB Output is correct
42 Correct 126 ms 14800 KB Output is correct
43 Correct 121 ms 14800 KB Output is correct
44 Runtime error 1 ms 460 KB Execution killed with signal 6
45 Halted 0 ms 0 KB -