답안 #58931 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
58931	2018-07-19T20:57:29 Z	reality	고대 책들 (IOI17_books)	C++17	50 / 100	2000 ms	181660 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));
		}
		int cl = 0,cr = 0;
		int l1 = l,r1 = l - 1;
		int l2 = r + 1,r2 = r;
		while (a < l1) {
			--l1;
			cl += 2;
			while (l1 < get1(l1,r1))
				smin(l1,get1(l1,r1));
			if (get2(l1,r1) > r)
				break;
		}
		while (r2 < b) {
			++r2;
			cr += 2;
			while (r2 < get2(l2,r2))
				smax(r2,get2(l2,r2));
			if (get1(l2,r2) < l)
				break;
		}
		if (get2(l1,r1) > r && get1(l2,r2) < l) {
			ans += min(cl,cr);
			l = l1;
			r = r2;
		} else {
			ans += cl + cr;
			break;
		}
	}
	return ans;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	496 KB	Output is correct
3	Correct	4 ms	532 KB	Output is correct
4	Correct	2 ms	604 KB	Output is correct
5	Correct	2 ms	604 KB	Output is correct
6	Correct	2 ms	704 KB	Output is correct
7	Correct	2 ms	704 KB	Output is correct
8	Correct	3 ms	704 KB	Output is correct
9	Correct	3 ms	704 KB	Output is correct
10	Correct	3 ms	704 KB	Output is correct
11	Correct	2 ms	704 KB	Output is correct
12	Correct	3 ms	704 KB	Output is correct
13	Correct	2 ms	704 KB	Output is correct
14	Correct	3 ms	704 KB	Output is correct
15	Correct	5 ms	704 KB	Output is correct
16	Correct	3 ms	728 KB	Output is correct
17	Correct	3 ms	728 KB	Output is correct
18	Correct	3 ms	728 KB	Output is correct
19	Correct	2 ms	788 KB	Output is correct
20	Correct	2 ms	792 KB	Output is correct
21	Correct	2 ms	924 KB	Output is correct
22	Correct	3 ms	924 KB	Output is correct
23	Correct	2 ms	924 KB	Output is correct
24	Correct	3 ms	952 KB	Output is correct
25	Correct	2 ms	952 KB	Output is correct
26	Correct	2 ms	952 KB	Output is correct
27	Correct	3 ms	952 KB	Output is correct
28	Correct	3 ms	952 KB	Output is correct
29	Correct	3 ms	952 KB	Output is correct

Subtask #3
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	496 KB	Output is correct
3	Correct	4 ms	532 KB	Output is correct
4	Correct	2 ms	604 KB	Output is correct
5	Correct	2 ms	604 KB	Output is correct
6	Correct	2 ms	704 KB	Output is correct
7	Correct	2 ms	704 KB	Output is correct
8	Correct	3 ms	704 KB	Output is correct
9	Correct	3 ms	704 KB	Output is correct
10	Correct	3 ms	704 KB	Output is correct
11	Correct	2 ms	704 KB	Output is correct
12	Correct	3 ms	704 KB	Output is correct
13	Correct	2 ms	704 KB	Output is correct
14	Correct	3 ms	704 KB	Output is correct
15	Correct	5 ms	704 KB	Output is correct
16	Correct	3 ms	728 KB	Output is correct
17	Correct	3 ms	728 KB	Output is correct
18	Correct	3 ms	728 KB	Output is correct
19	Correct	2 ms	788 KB	Output is correct
20	Correct	2 ms	792 KB	Output is correct
21	Correct	2 ms	924 KB	Output is correct
22	Correct	3 ms	924 KB	Output is correct
23	Correct	2 ms	924 KB	Output is correct
24	Correct	3 ms	952 KB	Output is correct
25	Correct	2 ms	952 KB	Output is correct
26	Correct	2 ms	952 KB	Output is correct
27	Correct	3 ms	952 KB	Output is correct
28	Correct	3 ms	952 KB	Output is correct
29	Correct	3 ms	952 KB	Output is correct
30	Correct	353 ms	167708 KB	Output is correct
31	Correct	348 ms	174544 KB	Output is correct
32	Correct	348 ms	179568 KB	Output is correct
33	Correct	325 ms	179628 KB	Output is correct
34	Correct	338 ms	179628 KB	Output is correct
35	Correct	325 ms	179692 KB	Output is correct
36	Correct	350 ms	179692 KB	Output is correct
37	Correct	306 ms	179692 KB	Output is correct
38	Correct	286 ms	179692 KB	Output is correct
39	Correct	358 ms	179692 KB	Output is correct
40	Correct	294 ms	181616 KB	Output is correct
41	Correct	290 ms	181632 KB	Output is correct
42	Correct	339 ms	181632 KB	Output is correct
43	Correct	335 ms	181660 KB	Output is correct

Subtask #4
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	2047 ms	181660 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	496 KB	Output is correct
3	Correct	4 ms	532 KB	Output is correct
4	Correct	2 ms	604 KB	Output is correct
5	Correct	2 ms	604 KB	Output is correct
6	Correct	2 ms	704 KB	Output is correct
7	Correct	2 ms	704 KB	Output is correct
8	Correct	3 ms	704 KB	Output is correct
9	Correct	3 ms	704 KB	Output is correct
10	Correct	3 ms	704 KB	Output is correct
11	Correct	2 ms	704 KB	Output is correct
12	Correct	3 ms	704 KB	Output is correct
13	Correct	2 ms	704 KB	Output is correct
14	Correct	3 ms	704 KB	Output is correct
15	Correct	5 ms	704 KB	Output is correct
16	Correct	3 ms	728 KB	Output is correct
17	Correct	3 ms	728 KB	Output is correct
18	Correct	3 ms	728 KB	Output is correct
19	Correct	2 ms	788 KB	Output is correct
20	Correct	2 ms	792 KB	Output is correct
21	Correct	2 ms	924 KB	Output is correct
22	Correct	3 ms	924 KB	Output is correct
23	Correct	2 ms	924 KB	Output is correct
24	Correct	3 ms	952 KB	Output is correct
25	Correct	2 ms	952 KB	Output is correct
26	Correct	2 ms	952 KB	Output is correct
27	Correct	3 ms	952 KB	Output is correct
28	Correct	3 ms	952 KB	Output is correct
29	Correct	3 ms	952 KB	Output is correct
30	Correct	353 ms	167708 KB	Output is correct
31	Correct	348 ms	174544 KB	Output is correct
32	Correct	348 ms	179568 KB	Output is correct
33	Correct	325 ms	179628 KB	Output is correct
34	Correct	338 ms	179628 KB	Output is correct
35	Correct	325 ms	179692 KB	Output is correct
36	Correct	350 ms	179692 KB	Output is correct
37	Correct	306 ms	179692 KB	Output is correct
38	Correct	286 ms	179692 KB	Output is correct
39	Correct	358 ms	179692 KB	Output is correct
40	Correct	294 ms	181616 KB	Output is correct
41	Correct	290 ms	181632 KB	Output is correct
42	Correct	339 ms	181632 KB	Output is correct
43	Correct	335 ms	181660 KB	Output is correct
44	Execution timed out	2047 ms	181660 KB	Time limit exceeded
45	Halted	0 ms	0 KB	-

답안 #58931

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