답안 #1074197

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1074197	2024-08-25T08:47:26 Z	Gromp15	송신탑 (IOI22_towers)	C++17	23 / 100	480 ms	4072 KB

towers

#include <bits/stdc++.h>
#include "towers.h"
#define ll long long
#define ar array
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
using namespace std;

template<typename T> bool ckmin(T &a, const T &b ) { return a > b ? a = b, 1 : 0; }
template<typename T> bool ckmax(T &a, const T &b ) { return a < b ? a = b, 1 : 0; }

int n; vector<int> h, h2, pref;
void init(int N, std::vector<int> H) {
	n = N;
	h = H;
	h2 = H;
	sort(all(h2));
	h2.erase(unique(all(h2)), h2.end());
	for (int &x : h) x = lower_bound(all(h2), x) - h2.begin();
	pref.resize(n);
	for (int i = 0; i < n; i++) {
		int r = i;
		while (r+1 < n && h[r+1] > h[r]) r++;
		pref[i]++, i = r;
	}
	for (int i = 1; i < n; i++) pref[i] += pref[i-1];
}

struct seg {
	int N; vector<int> tree;
	seg(int n) : N(1<<(__lg(n)+1)), tree(2*N, -1e9) {}
	void update(int pos, int x) {
		for (int i = pos + N; i; i >>= 1) ckmax(tree[i], x);
	}
	int query(int node, int nl, int nr, int ql, int qr) {
		if (ql > nr || qr < nl) return -1e9;
		if (ql <= nl && nr <= qr) return tree[node];
		int mid = (nl+nr)/2;
		return max(query(node*2, nl, mid, ql, qr), query(node*2+1, mid+1, nr, ql, qr));
	}
	int query(int l, int r) {
		return query(1, 0, N-1, l, r);
	}
};

int Q = 0;
int max_towers(int L, int R, int D) {
	if (Q++ == 0) {
		const int N = sz(h2);
		seg st0(N), st1(N); 
		for (int i = L; i <= R; i++) {
			auto it = lower_bound(all(h2), h2[h[i]] + D);
			if (it != h2.end()) {
				st1.update(h[i], st0.query(it - h2.begin(), N - 1) + 1);
			}
			auto it2 = upper_bound(all(h2), h2[h[i]] - D);
			if (it2 != h2.begin()) {
				it2--;
				st0.update(h[i], st1.query(0, it2 - h2.begin()));
			}
			st1.update(h[i], 1);
		}
		return st1.query(0, N-1);
	}
	return pref[R] - pref[L] + 1;
}

Subtask #1
0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	335 ms	2412 KB	2nd lines differ - on the 1st token, expected: '1', found: '8351'
2	Halted	0 ms	0 KB	-

Subtask #2
11.0 / 11.0

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

Subtask #3
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	1 ms	344 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	1 ms	344 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	0 ms	344 KB	Output is correct
26	Correct	1 ms	344 KB	Output is correct
27	Correct	1 ms	344 KB	Output is correct
28	Correct	1 ms	344 KB	Output is correct
29	Correct	1 ms	344 KB	Output is correct
30	Correct	1 ms	344 KB	Output is correct
31	Correct	1 ms	344 KB	Output is correct
32	Correct	1 ms	344 KB	Output is correct
33	Correct	1 ms	344 KB	Output is correct
34	Correct	1 ms	344 KB	Output is correct
35	Correct	1 ms	344 KB	Output is correct
36	Correct	24 ms	2392 KB	Output is correct
37	Correct	32 ms	4040 KB	Output is correct
38	Correct	36 ms	4048 KB	Output is correct
39	Correct	34 ms	3928 KB	Output is correct
40	Correct	30 ms	4040 KB	Output is correct
41	Correct	55 ms	4048 KB	Output is correct
42	Correct	25 ms	4048 KB	Output is correct
43	Correct	34 ms	4016 KB	Output is correct
44	Correct	19 ms	4048 KB	Output is correct
45	Correct	14 ms	4048 KB	Output is correct
46	Correct	24 ms	3868 KB	Output is correct
47	Correct	49 ms	4020 KB	Output is correct
48	Correct	37 ms	3916 KB	Output is correct
49	Correct	28 ms	4016 KB	Output is correct
50	Correct	21 ms	4048 KB	Output is correct
51	Correct	27 ms	4048 KB	Output is correct
52	Correct	81 ms	3924 KB	Output is correct
53	Correct	74 ms	3932 KB	Output is correct
54	Correct	72 ms	4036 KB	Output is correct
55	Correct	40 ms	3920 KB	Output is correct
56	Correct	41 ms	4048 KB	Output is correct
57	Correct	52 ms	3796 KB	Output is correct
58	Correct	65 ms	4048 KB	Output is correct
59	Correct	68 ms	4048 KB	Output is correct
60	Correct	88 ms	4044 KB	Output is correct
61	Correct	83 ms	4048 KB	Output is correct
62	Correct	58 ms	4048 KB	Output is correct
63	Correct	70 ms	4024 KB	Output is correct
64	Correct	29 ms	4072 KB	Output is correct
65	Correct	28 ms	4048 KB	Output is correct
66	Correct	36 ms	4048 KB	Output is correct
67	Correct	29 ms	4048 KB	Output is correct

Subtask #4
0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	480 ms	4052 KB	2nd lines differ - on the 1st token, expected: '4770', found: '7154'
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	205 ms	1368 KB	2nd lines differ - on the 1st token, expected: '7063', found: '11952'
2	Halted	0 ms	0 KB	-

Subtask #6
0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	1 ms	344 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	1 ms	344 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	0 ms	344 KB	Output is correct
26	Correct	1 ms	344 KB	Output is correct
27	Correct	1 ms	344 KB	Output is correct
28	Correct	1 ms	344 KB	Output is correct
29	Correct	1 ms	344 KB	Output is correct
30	Correct	1 ms	344 KB	Output is correct
31	Correct	1 ms	344 KB	Output is correct
32	Correct	1 ms	344 KB	Output is correct
33	Correct	1 ms	344 KB	Output is correct
34	Correct	1 ms	344 KB	Output is correct
35	Correct	1 ms	344 KB	Output is correct
36	Correct	24 ms	2392 KB	Output is correct
37	Correct	32 ms	4040 KB	Output is correct
38	Correct	36 ms	4048 KB	Output is correct
39	Correct	34 ms	3928 KB	Output is correct
40	Correct	30 ms	4040 KB	Output is correct
41	Correct	55 ms	4048 KB	Output is correct
42	Correct	25 ms	4048 KB	Output is correct
43	Correct	34 ms	4016 KB	Output is correct
44	Correct	19 ms	4048 KB	Output is correct
45	Correct	14 ms	4048 KB	Output is correct
46	Correct	24 ms	3868 KB	Output is correct
47	Correct	49 ms	4020 KB	Output is correct
48	Correct	37 ms	3916 KB	Output is correct
49	Correct	28 ms	4016 KB	Output is correct
50	Correct	21 ms	4048 KB	Output is correct
51	Correct	27 ms	4048 KB	Output is correct
52	Correct	81 ms	3924 KB	Output is correct
53	Correct	74 ms	3932 KB	Output is correct
54	Correct	72 ms	4036 KB	Output is correct
55	Correct	40 ms	3920 KB	Output is correct
56	Correct	41 ms	4048 KB	Output is correct
57	Correct	52 ms	3796 KB	Output is correct
58	Correct	65 ms	4048 KB	Output is correct
59	Correct	68 ms	4048 KB	Output is correct
60	Correct	88 ms	4044 KB	Output is correct
61	Correct	83 ms	4048 KB	Output is correct
62	Correct	58 ms	4048 KB	Output is correct
63	Correct	70 ms	4024 KB	Output is correct
64	Correct	29 ms	4072 KB	Output is correct
65	Correct	28 ms	4048 KB	Output is correct
66	Correct	36 ms	4048 KB	Output is correct
67	Correct	29 ms	4048 KB	Output is correct
68	Incorrect	480 ms	4052 KB	2nd lines differ - on the 1st token, expected: '4770', found: '7154'
69	Halted	0 ms	0 KB	-

Subtask #7
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	335 ms	2412 KB	2nd lines differ - on the 1st token, expected: '1', found: '8351'
2	Halted	0 ms	0 KB	-

답안 #1074197

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