답안 #833179

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
833179	2023-08-22T02:50:07 Z	pavement	송신탑 (IOI22_towers)	C++17	23 / 100	4000 ms	3784 KB

towers

#include "towers.h"
#include <bits/stdc++.h>
using namespace std;

#define eb emplace_back
#define mp make_pair

using ii = pair<int, int>;

int N;
vector<int> H;

void init(int N, vector<int> H) {
	::N = N;
	::H = H;
}

int max_towers(int L, int R, int D) {
	vector<int> V(H.begin() + L, H.begin() + R + 1), cl(V.size(), -1), cr(V.size(), V.size());
	vector<ii> vec;
	for (int i = 0; i < (int)V.size(); i++) {
		{
			int lo = 0, hi = (int)vec.size() - 1;
			while (lo <= hi) {
				int mid = (lo + hi) / 2;
				if (vec[mid].first - D >= V[i]) {
					cl[i] = vec[mid].second;
					lo = mid + 1;
				} else {
					hi = mid - 1;
				}
			}
		}
		while (!vec.empty() && vec.back().first <= V[i]) {
			vec.pop_back();
		}
		vec.eb(V[i], i);
	}
	vec.clear();
	for (int i = (int)V.size() - 1; i >= 0; i--) {
		{
			int lo = 0, hi = (int)vec.size() - 1;
			while (lo <= hi) {
				int mid = (lo + hi) / 2;
				if (vec[mid].first - D >= V[i]) {
					cr[i] = vec[mid].second;
					lo = mid + 1;
				} else {
					hi = mid - 1;
				}
			}
		}
		while (!vec.empty() && vec.back().first <= V[i]) {
			vec.pop_back();
		}
		vec.eb(V[i], i);
	}
	//~ for (int i : V) {
		//~ cout << i << ' ';
	//~ }
	//~ cout << '\n';
	//~ for (int i : cl) {
		//~ cout << i << ' ';
	//~ }
	//~ cout << '\n';
	//~ for (int i : cr) {
		//~ cout << i << ' ';
	//~ }
	//~ cout << '\n';
	function<int(int, int, bool, bool)> solve = [&](int l, int r, bool a, bool b) {
		if (l > r) {
			return 0;
		}
		ii to = mp((int)2e9, -1);
		for (int i = l; i <= r; i++) {
			if ((!a || l <= cl[i]) && (!b || cr[i] <= r)) {
				to = min(to, mp(V[i], i));
			}
		}
		if (to.second != -1) {
			return solve(l, to.second - 1, a, 1) + solve(to.second + 1, r, 1, b) + 1;
		} else {
			return 0;
		}
	};
	return solve(0, (int)V.size() - 1, 0, 0);
}

Subtask #1
0 / 4.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	1 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct
8	Correct	1 ms	208 KB	Output is correct
9	Correct	1 ms	208 KB	Output is correct
10	Correct	1 ms	208 KB	Output is correct
11	Correct	1 ms	208 KB	Output is correct
12	Correct	0 ms	208 KB	Output is correct
13	Correct	1 ms	208 KB	Output is correct
14	Correct	0 ms	208 KB	Output is correct
15	Correct	0 ms	208 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	208 KB	Output is correct
18	Correct	0 ms	208 KB	Output is correct
19	Correct	1 ms	208 KB	Output is correct
20	Correct	1 ms	208 KB	Output is correct
21	Correct	1 ms	208 KB	Output is correct
22	Correct	1 ms	208 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	1 ms	336 KB	Output is correct
25	Correct	1 ms	208 KB	Output is correct
26	Correct	1 ms	208 KB	Output is correct
27	Correct	1 ms	208 KB	Output is correct
28	Correct	1 ms	336 KB	Output is correct
29	Correct	1 ms	208 KB	Output is correct
30	Correct	1 ms	336 KB	Output is correct
31	Correct	1 ms	208 KB	Output is correct
32	Correct	1 ms	336 KB	Output is correct
33	Correct	1 ms	336 KB	Output is correct
34	Correct	1 ms	460 KB	Output is correct
35	Correct	1 ms	336 KB	Output is correct
36	Correct	8 ms	976 KB	Output is correct
37	Correct	12 ms	1488 KB	Output is correct
38	Correct	10 ms	1360 KB	Output is correct
39	Correct	10 ms	1360 KB	Output is correct
40	Correct	10 ms	1440 KB	Output is correct
41	Correct	16 ms	1992 KB	Output is correct
42	Correct	9 ms	1360 KB	Output is correct
43	Correct	11 ms	2628 KB	Output is correct
44	Correct	9 ms	1436 KB	Output is correct
45	Correct	8 ms	1360 KB	Output is correct
46	Correct	8 ms	1440 KB	Output is correct
47	Correct	17 ms	1456 KB	Output is correct
48	Correct	10 ms	1360 KB	Output is correct
49	Correct	9 ms	1360 KB	Output is correct
50	Correct	15 ms	1724 KB	Output is correct
51	Correct	15 ms	2248 KB	Output is correct
52	Correct	20 ms	2216 KB	Output is correct
53	Correct	18 ms	2248 KB	Output is correct
54	Correct	18 ms	2248 KB	Output is correct
55	Correct	16 ms	3736 KB	Output is correct
56	Correct	13 ms	3784 KB	Output is correct
57	Correct	21 ms	2092 KB	Output is correct
58	Correct	23 ms	2240 KB	Output is correct
59	Correct	27 ms	2248 KB	Output is correct
60	Correct	22 ms	2240 KB	Output is correct
61	Correct	26 ms	2248 KB	Output is correct
62	Correct	18 ms	2248 KB	Output is correct
63	Correct	21 ms	2248 KB	Output is correct
64	Correct	13 ms	3776 KB	Output is correct
65	Correct	12 ms	3744 KB	Output is correct
66	Correct	13 ms	3144 KB	Output is correct
67	Correct	13 ms	3768 KB	Output is correct

Subtask #4
0 / 14.0

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

Subtask #5
0 / 17.0

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

Subtask #6
0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	1 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct
8	Correct	1 ms	208 KB	Output is correct
9	Correct	1 ms	208 KB	Output is correct
10	Correct	1 ms	208 KB	Output is correct
11	Correct	1 ms	208 KB	Output is correct
12	Correct	0 ms	208 KB	Output is correct
13	Correct	1 ms	208 KB	Output is correct
14	Correct	0 ms	208 KB	Output is correct
15	Correct	0 ms	208 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	208 KB	Output is correct
18	Correct	0 ms	208 KB	Output is correct
19	Correct	1 ms	208 KB	Output is correct
20	Correct	1 ms	208 KB	Output is correct
21	Correct	1 ms	208 KB	Output is correct
22	Correct	1 ms	208 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	1 ms	336 KB	Output is correct
25	Correct	1 ms	208 KB	Output is correct
26	Correct	1 ms	208 KB	Output is correct
27	Correct	1 ms	208 KB	Output is correct
28	Correct	1 ms	336 KB	Output is correct
29	Correct	1 ms	208 KB	Output is correct
30	Correct	1 ms	336 KB	Output is correct
31	Correct	1 ms	208 KB	Output is correct
32	Correct	1 ms	336 KB	Output is correct
33	Correct	1 ms	336 KB	Output is correct
34	Correct	1 ms	460 KB	Output is correct
35	Correct	1 ms	336 KB	Output is correct
36	Correct	8 ms	976 KB	Output is correct
37	Correct	12 ms	1488 KB	Output is correct
38	Correct	10 ms	1360 KB	Output is correct
39	Correct	10 ms	1360 KB	Output is correct
40	Correct	10 ms	1440 KB	Output is correct
41	Correct	16 ms	1992 KB	Output is correct
42	Correct	9 ms	1360 KB	Output is correct
43	Correct	11 ms	2628 KB	Output is correct
44	Correct	9 ms	1436 KB	Output is correct
45	Correct	8 ms	1360 KB	Output is correct
46	Correct	8 ms	1440 KB	Output is correct
47	Correct	17 ms	1456 KB	Output is correct
48	Correct	10 ms	1360 KB	Output is correct
49	Correct	9 ms	1360 KB	Output is correct
50	Correct	15 ms	1724 KB	Output is correct
51	Correct	15 ms	2248 KB	Output is correct
52	Correct	20 ms	2216 KB	Output is correct
53	Correct	18 ms	2248 KB	Output is correct
54	Correct	18 ms	2248 KB	Output is correct
55	Correct	16 ms	3736 KB	Output is correct
56	Correct	13 ms	3784 KB	Output is correct
57	Correct	21 ms	2092 KB	Output is correct
58	Correct	23 ms	2240 KB	Output is correct
59	Correct	27 ms	2248 KB	Output is correct
60	Correct	22 ms	2240 KB	Output is correct
61	Correct	26 ms	2248 KB	Output is correct
62	Correct	18 ms	2248 KB	Output is correct
63	Correct	21 ms	2248 KB	Output is correct
64	Correct	13 ms	3776 KB	Output is correct
65	Correct	12 ms	3744 KB	Output is correct
66	Correct	13 ms	3144 KB	Output is correct
67	Correct	13 ms	3768 KB	Output is correct
68	Execution timed out	4070 ms	2240 KB	Time limit exceeded
69	Halted	0 ms	0 KB	-

Subtask #7
0 / 23.0

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

답안 #833179

Compilation message

Subtask #1 0 / 4.0

Subtask #2 11.0 / 11.0

Subtask #3 12.0 / 12.0

Subtask #4 0 / 14.0

Subtask #5 0 / 17.0

Subtask #6 0 / 19.0

Subtask #7 0 / 23.0

Subtask #1
0 / 4.0

Subtask #2
11.0 / 11.0

Subtask #3
12.0 / 12.0

Subtask #4
0 / 14.0

Subtask #5
0 / 17.0

Subtask #6
0 / 19.0

Subtask #7
0 / 23.0