답안 #772320

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
772320	2023-07-04T02:41:30 Z	marvinthang	송신탑 (IOI22_towers)	C++17	23 / 100	4000 ms	8636 KB

towers

/*************************************
*    author: marvinthang             *
*    created: 04.07.2023 09:31:20    *
*************************************/

#include "towers.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 << '}'; }

// end of template

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> left(N), right(N);
	vector <pair <int, int>> events;
	FORE(i, l, r) {
		events.emplace_back(H[i], i);
		events.emplace_back(H[i] + d, -1 - i);
	}
	sort(events.rbegin(), events.rend());
	set <int> s;
	for (auto [h, x]: events) {
		if (x >= 0) s.insert(x);
		else {
			x = -1 - x;
			auto it = s.lower_bound(x);
			left[x] = it != s.begin() ? *prev(it) : -1;
			right[x] = it != s.end() ? *it : N;
		}
	}
	s.clear();
	reverse(ALL(events));
	for (auto [h, x]: events) if (x >= 0) {
		auto it = s.lower_bound(x);
		if (it != s.end() && *it < right[x]) continue;
		if (it != s.begin() && *prev(it) > left[x]) continue;
		s.insert(x);
	}
	return s.size();
}

Subtask #1
0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	4098 ms	5076 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	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	372 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	208 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	208 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	1 ms	336 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct
21	Correct	2 ms	336 KB	Output is correct
22	Correct	1 ms	336 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	336 KB	Output is correct
26	Correct	1 ms	336 KB	Output is correct
27	Correct	1 ms	336 KB	Output is correct
28	Correct	2 ms	336 KB	Output is correct
29	Correct	1 ms	336 KB	Output is correct
30	Correct	1 ms	336 KB	Output is correct
31	Correct	1 ms	336 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	336 KB	Output is correct
35	Correct	1 ms	428 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	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	372 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	208 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	208 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	1 ms	336 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct
21	Correct	2 ms	336 KB	Output is correct
22	Correct	1 ms	336 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	336 KB	Output is correct
26	Correct	1 ms	336 KB	Output is correct
27	Correct	1 ms	336 KB	Output is correct
28	Correct	2 ms	336 KB	Output is correct
29	Correct	1 ms	336 KB	Output is correct
30	Correct	1 ms	336 KB	Output is correct
31	Correct	1 ms	336 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	336 KB	Output is correct
35	Correct	1 ms	428 KB	Output is correct
36	Correct	16 ms	2404 KB	Output is correct
37	Correct	32 ms	4008 KB	Output is correct
38	Correct	19 ms	2708 KB	Output is correct
39	Correct	21 ms	3844 KB	Output is correct
40	Correct	20 ms	2580 KB	Output is correct
41	Correct	59 ms	7056 KB	Output is correct
42	Correct	9 ms	1992 KB	Output is correct
43	Correct	23 ms	5008 KB	Output is correct
44	Correct	12 ms	2604 KB	Output is correct
45	Correct	10 ms	1940 KB	Output is correct
46	Correct	14 ms	1932 KB	Output is correct
47	Correct	34 ms	4028 KB	Output is correct
48	Correct	20 ms	3144 KB	Output is correct
49	Correct	13 ms	2324 KB	Output is correct
50	Correct	14 ms	3088 KB	Output is correct
51	Correct	18 ms	4272 KB	Output is correct
52	Correct	75 ms	8040 KB	Output is correct
53	Correct	76 ms	8120 KB	Output is correct
54	Correct	76 ms	8036 KB	Output is correct
55	Correct	35 ms	8072 KB	Output is correct
56	Correct	35 ms	8092 KB	Output is correct
57	Correct	70 ms	7808 KB	Output is correct
58	Correct	73 ms	8084 KB	Output is correct
59	Correct	80 ms	8088 KB	Output is correct
60	Correct	85 ms	8072 KB	Output is correct
61	Correct	86 ms	8072 KB	Output is correct
62	Correct	74 ms	8004 KB	Output is correct
63	Correct	84 ms	8024 KB	Output is correct
64	Correct	35 ms	8076 KB	Output is correct
65	Correct	40 ms	8068 KB	Output is correct
66	Correct	40 ms	8068 KB	Output is correct
67	Correct	41 ms	8084 KB	Output is correct

Subtask #4
0 / 14.0

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

Subtask #5
0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	4003 ms	2712 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	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	372 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	208 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	208 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	1 ms	336 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct
21	Correct	2 ms	336 KB	Output is correct
22	Correct	1 ms	336 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	336 KB	Output is correct
26	Correct	1 ms	336 KB	Output is correct
27	Correct	1 ms	336 KB	Output is correct
28	Correct	2 ms	336 KB	Output is correct
29	Correct	1 ms	336 KB	Output is correct
30	Correct	1 ms	336 KB	Output is correct
31	Correct	1 ms	336 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	336 KB	Output is correct
35	Correct	1 ms	428 KB	Output is correct
36	Correct	16 ms	2404 KB	Output is correct
37	Correct	32 ms	4008 KB	Output is correct
38	Correct	19 ms	2708 KB	Output is correct
39	Correct	21 ms	3844 KB	Output is correct
40	Correct	20 ms	2580 KB	Output is correct
41	Correct	59 ms	7056 KB	Output is correct
42	Correct	9 ms	1992 KB	Output is correct
43	Correct	23 ms	5008 KB	Output is correct
44	Correct	12 ms	2604 KB	Output is correct
45	Correct	10 ms	1940 KB	Output is correct
46	Correct	14 ms	1932 KB	Output is correct
47	Correct	34 ms	4028 KB	Output is correct
48	Correct	20 ms	3144 KB	Output is correct
49	Correct	13 ms	2324 KB	Output is correct
50	Correct	14 ms	3088 KB	Output is correct
51	Correct	18 ms	4272 KB	Output is correct
52	Correct	75 ms	8040 KB	Output is correct
53	Correct	76 ms	8120 KB	Output is correct
54	Correct	76 ms	8036 KB	Output is correct
55	Correct	35 ms	8072 KB	Output is correct
56	Correct	35 ms	8092 KB	Output is correct
57	Correct	70 ms	7808 KB	Output is correct
58	Correct	73 ms	8084 KB	Output is correct
59	Correct	80 ms	8088 KB	Output is correct
60	Correct	85 ms	8072 KB	Output is correct
61	Correct	86 ms	8072 KB	Output is correct
62	Correct	74 ms	8004 KB	Output is correct
63	Correct	84 ms	8024 KB	Output is correct
64	Correct	35 ms	8076 KB	Output is correct
65	Correct	40 ms	8068 KB	Output is correct
66	Correct	40 ms	8068 KB	Output is correct
67	Correct	41 ms	8084 KB	Output is correct
68	Execution timed out	4019 ms	8636 KB	Time limit exceeded
69	Halted	0 ms	0 KB	-

Subtask #7
0 / 23.0

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

답안 #772320

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