답안 #766017

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
766017	2023-06-25T08:47:29 Z	marvinthang	고대 책들 (IOI17_books)	C++17	100 / 100	95 ms	9268 KB

books

/*************************************
*    author: marvinthang             *
*    created: 25.06.2023 13:04:25    *
*************************************/

#include "books.h"
#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }

// end of template

long long minimum_walk(vector<int> p, int s) {
	long long res = 0;
	int n = p.size();
	REP(i, n) res += abs(i - p[i]);
	int last = n - 1;
	while (last >= s && p[last] == last) --last;
	int first = 0;
	while (first <= s && p[first] == first) ++first;
	int l = p[s], r = p[s], i = s, j = s;
	int cnt_l = 0, cnt_r = 0;
	while (first < i || j < last) {
		if (l < i || j < r) {
			while (l < i || j < r) {
				while (l < i) {
					--i;
					if (p[i] > s) {
						res += cnt_l;
						cnt_l = cnt_r = 0;
					}
					minimize(l, p[i]);
					maximize(r, p[i]);
				}
				while (j < r) {
					++j;
					if (p[j] < s) {
						res += cnt_r;
						cnt_l = cnt_r = 0;
					}
					minimize(l, p[j]);
					maximize(r, p[j]);
				}
			}
		} else {
			if (first < l) {
				cnt_l += 2;
				--l;
			}
			if (r < last) {
				cnt_r += 2;
				++r;
			}
		}
	}
	return res + cnt_l + cnt_r;
}

#ifdef LOCAL
#include "books.h"

#include <cstdio>
#include <vector>
#include <cassert>

using namespace std;

int main() {
	file("books");
	int n, s;
	assert(2 == scanf("%d %d", &n, &s));

	vector<int> p((unsigned) n);
	for(int i = 0; i < n; i++)
		assert(1 == scanf("%d", &p[(unsigned) i]));

	long long res = minimum_walk(p, s);
	printf("%lld\n", res);

	return 0;
}
#endif

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct

Subtask #3
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	81 ms	8044 KB	Output is correct
31	Correct	73 ms	8044 KB	Output is correct
32	Correct	76 ms	8056 KB	Output is correct
33	Correct	78 ms	8044 KB	Output is correct
34	Correct	76 ms	8012 KB	Output is correct
35	Correct	76 ms	8040 KB	Output is correct
36	Correct	75 ms	8060 KB	Output is correct
37	Correct	72 ms	8040 KB	Output is correct
38	Correct	72 ms	8044 KB	Output is correct
39	Correct	92 ms	8012 KB	Output is correct
40	Correct	95 ms	8044 KB	Output is correct
41	Correct	73 ms	8040 KB	Output is correct
42	Correct	73 ms	8012 KB	Output is correct
43	Correct	73 ms	8012 KB	Output is correct

Subtask #4
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	224 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	304 KB	Output is correct
18	Correct	1 ms	300 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct

Subtask #5
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	81 ms	8044 KB	Output is correct
31	Correct	73 ms	8044 KB	Output is correct
32	Correct	76 ms	8056 KB	Output is correct
33	Correct	78 ms	8044 KB	Output is correct
34	Correct	76 ms	8012 KB	Output is correct
35	Correct	76 ms	8040 KB	Output is correct
36	Correct	75 ms	8060 KB	Output is correct
37	Correct	72 ms	8040 KB	Output is correct
38	Correct	72 ms	8044 KB	Output is correct
39	Correct	92 ms	8012 KB	Output is correct
40	Correct	95 ms	8044 KB	Output is correct
41	Correct	73 ms	8040 KB	Output is correct
42	Correct	73 ms	8012 KB	Output is correct
43	Correct	73 ms	8012 KB	Output is correct
44	Correct	0 ms	212 KB	Output is correct
45	Correct	0 ms	212 KB	Output is correct
46	Correct	0 ms	224 KB	Output is correct
47	Correct	0 ms	212 KB	Output is correct
48	Correct	1 ms	212 KB	Output is correct
49	Correct	1 ms	212 KB	Output is correct
50	Correct	0 ms	212 KB	Output is correct
51	Correct	1 ms	212 KB	Output is correct
52	Correct	0 ms	212 KB	Output is correct
53	Correct	0 ms	212 KB	Output is correct
54	Correct	0 ms	212 KB	Output is correct
55	Correct	1 ms	212 KB	Output is correct
56	Correct	1 ms	212 KB	Output is correct
57	Correct	1 ms	212 KB	Output is correct
58	Correct	1 ms	212 KB	Output is correct
59	Correct	1 ms	212 KB	Output is correct
60	Correct	1 ms	304 KB	Output is correct
61	Correct	1 ms	300 KB	Output is correct
62	Correct	1 ms	212 KB	Output is correct
63	Correct	1 ms	212 KB	Output is correct
64	Correct	76 ms	9268 KB	Output is correct
65	Correct	79 ms	9256 KB	Output is correct
66	Correct	73 ms	9164 KB	Output is correct
67	Correct	85 ms	9244 KB	Output is correct
68	Correct	8 ms	1592 KB	Output is correct
69	Correct	8 ms	1584 KB	Output is correct
70	Correct	8 ms	1620 KB	Output is correct
71	Correct	7 ms	1664 KB	Output is correct
72	Correct	9 ms	1592 KB	Output is correct
73	Correct	8 ms	1620 KB	Output is correct
74	Correct	79 ms	9064 KB	Output is correct
75	Correct	78 ms	9068 KB	Output is correct
76	Correct	73 ms	9068 KB	Output is correct
77	Correct	74 ms	9036 KB	Output is correct
78	Correct	73 ms	9020 KB	Output is correct
79	Correct	74 ms	9120 KB	Output is correct
80	Correct	73 ms	9064 KB	Output is correct
81	Correct	78 ms	9048 KB	Output is correct
82	Correct	74 ms	9136 KB	Output is correct
83	Correct	83 ms	9068 KB	Output is correct
84	Correct	74 ms	9096 KB	Output is correct
85	Correct	75 ms	9028 KB	Output is correct
86	Correct	77 ms	9048 KB	Output is correct
87	Correct	80 ms	9072 KB	Output is correct
88	Correct	84 ms	9064 KB	Output is correct
89	Correct	80 ms	9072 KB	Output is correct
90	Correct	74 ms	9120 KB	Output is correct
91	Correct	74 ms	9068 KB	Output is correct
92	Correct	75 ms	9128 KB	Output is correct

답안 #766017

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 10.0 / 10.0

Subtask #3 28.0 / 28.0

Subtask #4 20.0 / 20.0

Subtask #5 30.0 / 30.0

Subtask #1
12.0 / 12.0

Subtask #2
10.0 / 10.0

Subtask #3
28.0 / 28.0

Subtask #4
20.0 / 20.0

Subtask #5
30.0 / 30.0