답안 #410970

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
410970	2021-05-24T02:26:55 Z	Kevin_Zhang_TW	고대 책들 (IOI17_books)	C++17	50 / 100	154 ms	8132 KB

books

#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 = l, nr = r;
		auto upd = [&](int pos) {
			chmax(nr, p[pos]);
			chmin(nl, p[pos]);
		};
		upd(l), upd(r);

		while (nl != l || nr != r) {
			while (l > nl) {
				upd(--l);
			}
			while (r < nr) {
				upd(++r);
			}
		}
	};

	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;
			}
			if (sr <= r) {
				sig = true;
				assert(sl == L);
			}
			chmin(nl, sl);
			chmax(nr, sr);
		}
		{
			int sl = l, sr = r;
			while (sl >= l && sr < R) {
				expand(sl, ++sr);
				costl += 2;
			}
			if (sl >= l) {
				sig = true;
				assert(sr == R);
			}
			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

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 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	204 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	204 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

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 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	204 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	204 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	204 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	204 KB	Output is correct
27	Correct	1 ms	204 KB	Output is correct
28	Correct	1 ms	204 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct

Subtask #3

28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 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	204 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	204 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	204 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	204 KB	Output is correct
27	Correct	1 ms	204 KB	Output is correct
28	Correct	1 ms	204 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	123 ms	8036 KB	Output is correct
31	Correct	121 ms	8036 KB	Output is correct
32	Correct	115 ms	8052 KB	Output is correct
33	Correct	121 ms	8132 KB	Output is correct
34	Correct	154 ms	8036 KB	Output is correct
35	Correct	128 ms	8044 KB	Output is correct
36	Correct	118 ms	8008 KB	Output is correct
37	Correct	116 ms	8036 KB	Output is correct
38	Correct	119 ms	8044 KB	Output is correct
39	Correct	119 ms	8004 KB	Output is correct
40	Correct	118 ms	8036 KB	Output is correct
41	Correct	122 ms	8048 KB	Output is correct
42	Correct	123 ms	8048 KB	Output is correct
43	Correct	117 ms	8040 KB	Output is correct

Subtask #4

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	204 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 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	204 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	204 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	204 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	204 KB	Output is correct
27	Correct	1 ms	204 KB	Output is correct
28	Correct	1 ms	204 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	123 ms	8036 KB	Output is correct
31	Correct	121 ms	8036 KB	Output is correct
32	Correct	115 ms	8052 KB	Output is correct
33	Correct	121 ms	8132 KB	Output is correct
34	Correct	154 ms	8036 KB	Output is correct
35	Correct	128 ms	8044 KB	Output is correct
36	Correct	118 ms	8008 KB	Output is correct
37	Correct	116 ms	8036 KB	Output is correct
38	Correct	119 ms	8044 KB	Output is correct
39	Correct	119 ms	8004 KB	Output is correct
40	Correct	118 ms	8036 KB	Output is correct
41	Correct	122 ms	8048 KB	Output is correct
42	Correct	123 ms	8048 KB	Output is correct
43	Correct	117 ms	8040 KB	Output is correct
44	Incorrect	1 ms	204 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45	Halted	0 ms	0 KB	-