답안 #58918 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
58918	2018-07-19T20:00:39 Z	reality	고대 책들 (IOI17_books)	C++17	50 / 100	482 ms	161132 KB

books

#include "books.h"
#include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define ll long long
#define dbg(v) cerr<<#v<<" = "<<v<<'\n'
#define vi vector<int>
#define vl vector <ll>
#define pii pair<int,int>
#define mp make_pair
#define db long double
#define pb push_back
#define all(s) s.begin(),s.end()
template < class T > T smin(T &a,T b) {if (a > b) a = b;return a;}
template < class T > T smax(T &a,T b) {if (a < b) a = b;return a;}
#include "books.h"
const int oo = 1e9;
int n;
int D1[20][1 << 20];
int D2[20][1 << 20];
int Log[1 << 20];
int get1(int l,int r) {
	int k = Log[r - l + 1];
	return min(D1[k][l],D1[k][r - (1 << k) + 1]);
}
int get2(int l,int r) {
	int k = Log[r - l + 1];
	return max(D2[k][l],D2[k][r - (1 << k) + 1]);
}
long long minimum_walk(std::vector<int> p, int s) {
	n = p.size();
	int a = 0,b = n - 1;
	while (a + 1 <= s && p[a] == a)
		--a;
	while (b - 1 >= s && p[b] == b)
		--b;
	int l = s,r = s;
	ll ans = 0;
	for (int i = 0;i < n;++i)
		ans += abs(i - p[i]);
	for (int i = 0;i < n;++i) {
		D1[0][i] = D2[0][i] = p[i];
	}
	for (int t = 1;t < 20;++t)
		for (int i = 0;i + (1 << t) <= n;++i) {
			D1[t][i] = min(D1[t - 1][i],D1[t - 1][i + (1 << (t - 1))]);
			D2[t][i] = max(D2[t - 1][i],D2[t - 1][i + (1 << (t - 1))]);
		}
	for (int i = 2;i <= n;++i)
		Log[i] = Log[i / 2] + 1;
	while (a < l || r < b) {
		while (get1(l,r) < l || r < get2(l,r)) {
			smin(l,get1(l,r));
			smax(r,get2(l,r));
		}
		if (l - 1 >= a) {
			--l;
			ans += 2;
		} else
		if (r + 1 <= b) {
			++r;
			ans += 2;
		}
	}
	return ans;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	488 KB	Output is correct
3	Correct	2 ms	488 KB	Output is correct
4	Correct	3 ms	488 KB	Output is correct
5	Correct	2 ms	512 KB	Output is correct
6	Correct	2 ms	512 KB	Output is correct
7	Correct	3 ms	512 KB	Output is correct
8	Correct	2 ms	512 KB	Output is correct
9	Correct	2 ms	548 KB	Output is correct
10	Correct	2 ms	548 KB	Output is correct
11	Correct	2 ms	592 KB	Output is correct
12	Correct	2 ms	592 KB	Output is correct
13	Correct	4 ms	616 KB	Output is correct
14	Correct	2 ms	696 KB	Output is correct
15	Correct	2 ms	696 KB	Output is correct
16	Correct	2 ms	696 KB	Output is correct
17	Correct	2 ms	696 KB	Output is correct
18	Correct	2 ms	696 KB	Output is correct
19	Correct	2 ms	744 KB	Output is correct
20	Correct	2 ms	748 KB	Output is correct
21	Correct	2 ms	752 KB	Output is correct
22	Correct	3 ms	752 KB	Output is correct
23	Correct	3 ms	752 KB	Output is correct
24	Correct	3 ms	752 KB	Output is correct
25	Correct	3 ms	876 KB	Output is correct
26	Correct	4 ms	876 KB	Output is correct
27	Correct	4 ms	876 KB	Output is correct
28	Correct	4 ms	876 KB	Output is correct
29	Correct	3 ms	876 KB	Output is correct

Subtask #3
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	488 KB	Output is correct
3	Correct	2 ms	488 KB	Output is correct
4	Correct	3 ms	488 KB	Output is correct
5	Correct	2 ms	512 KB	Output is correct
6	Correct	2 ms	512 KB	Output is correct
7	Correct	3 ms	512 KB	Output is correct
8	Correct	2 ms	512 KB	Output is correct
9	Correct	2 ms	548 KB	Output is correct
10	Correct	2 ms	548 KB	Output is correct
11	Correct	2 ms	592 KB	Output is correct
12	Correct	2 ms	592 KB	Output is correct
13	Correct	4 ms	616 KB	Output is correct
14	Correct	2 ms	696 KB	Output is correct
15	Correct	2 ms	696 KB	Output is correct
16	Correct	2 ms	696 KB	Output is correct
17	Correct	2 ms	696 KB	Output is correct
18	Correct	2 ms	696 KB	Output is correct
19	Correct	2 ms	744 KB	Output is correct
20	Correct	2 ms	748 KB	Output is correct
21	Correct	2 ms	752 KB	Output is correct
22	Correct	3 ms	752 KB	Output is correct
23	Correct	3 ms	752 KB	Output is correct
24	Correct	3 ms	752 KB	Output is correct
25	Correct	3 ms	876 KB	Output is correct
26	Correct	4 ms	876 KB	Output is correct
27	Correct	4 ms	876 KB	Output is correct
28	Correct	4 ms	876 KB	Output is correct
29	Correct	3 ms	876 KB	Output is correct
30	Correct	428 ms	160940 KB	Output is correct
31	Correct	424 ms	161132 KB	Output is correct
32	Correct	345 ms	161132 KB	Output is correct
33	Correct	419 ms	161132 KB	Output is correct
34	Correct	482 ms	161132 KB	Output is correct
35	Correct	420 ms	161132 KB	Output is correct
36	Correct	374 ms	161132 KB	Output is correct
37	Correct	402 ms	161132 KB	Output is correct
38	Correct	343 ms	161132 KB	Output is correct
39	Correct	342 ms	161132 KB	Output is correct
40	Correct	352 ms	161132 KB	Output is correct
41	Correct	349 ms	161132 KB	Output is correct
42	Correct	322 ms	161132 KB	Output is correct
43	Correct	328 ms	161132 KB	Output is correct

Subtask #4
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	161132 KB	Output is correct
2	Correct	3 ms	161132 KB	Output is correct
3	Correct	3 ms	161132 KB	Output is correct
4	Correct	3 ms	161132 KB	Output is correct
5	Correct	2 ms	161132 KB	Output is correct
6	Incorrect	2 ms	161132 KB	3rd lines differ - on the 1st token, expected: '22140', found: '22144'
7	Halted	0 ms	0 KB	-

Subtask #5
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	488 KB	Output is correct
3	Correct	2 ms	488 KB	Output is correct
4	Correct	3 ms	488 KB	Output is correct
5	Correct	2 ms	512 KB	Output is correct
6	Correct	2 ms	512 KB	Output is correct
7	Correct	3 ms	512 KB	Output is correct
8	Correct	2 ms	512 KB	Output is correct
9	Correct	2 ms	548 KB	Output is correct
10	Correct	2 ms	548 KB	Output is correct
11	Correct	2 ms	592 KB	Output is correct
12	Correct	2 ms	592 KB	Output is correct
13	Correct	4 ms	616 KB	Output is correct
14	Correct	2 ms	696 KB	Output is correct
15	Correct	2 ms	696 KB	Output is correct
16	Correct	2 ms	696 KB	Output is correct
17	Correct	2 ms	696 KB	Output is correct
18	Correct	2 ms	696 KB	Output is correct
19	Correct	2 ms	744 KB	Output is correct
20	Correct	2 ms	748 KB	Output is correct
21	Correct	2 ms	752 KB	Output is correct
22	Correct	3 ms	752 KB	Output is correct
23	Correct	3 ms	752 KB	Output is correct
24	Correct	3 ms	752 KB	Output is correct
25	Correct	3 ms	876 KB	Output is correct
26	Correct	4 ms	876 KB	Output is correct
27	Correct	4 ms	876 KB	Output is correct
28	Correct	4 ms	876 KB	Output is correct
29	Correct	3 ms	876 KB	Output is correct
30	Correct	428 ms	160940 KB	Output is correct
31	Correct	424 ms	161132 KB	Output is correct
32	Correct	345 ms	161132 KB	Output is correct
33	Correct	419 ms	161132 KB	Output is correct
34	Correct	482 ms	161132 KB	Output is correct
35	Correct	420 ms	161132 KB	Output is correct
36	Correct	374 ms	161132 KB	Output is correct
37	Correct	402 ms	161132 KB	Output is correct
38	Correct	343 ms	161132 KB	Output is correct
39	Correct	342 ms	161132 KB	Output is correct
40	Correct	352 ms	161132 KB	Output is correct
41	Correct	349 ms	161132 KB	Output is correct
42	Correct	322 ms	161132 KB	Output is correct
43	Correct	328 ms	161132 KB	Output is correct
44	Correct	3 ms	161132 KB	Output is correct
45	Correct	3 ms	161132 KB	Output is correct
46	Correct	3 ms	161132 KB	Output is correct
47	Correct	3 ms	161132 KB	Output is correct
48	Correct	2 ms	161132 KB	Output is correct
49	Incorrect	2 ms	161132 KB	3rd lines differ - on the 1st token, expected: '22140', found: '22144'
50	Halted	0 ms	0 KB	-

답안 #58918

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 10.0 / 10.0

Subtask #3 28.0 / 28.0

Subtask #4 0 / 20.0

Subtask #5 0 / 30.0

Subtask #1
12.0 / 12.0

Subtask #2
10.0 / 10.0

Subtask #3
28.0 / 28.0

Subtask #4
0 / 20.0

Subtask #5
0 / 30.0