oj.uz

Submission #772349

# Submission time Handle Problem Language Result Execution time Memory
772349 2023-07-04T04:23:08 Z marvinthang Radio Towers (IOI22_towers) C++17
23 / 100
 4000 ms 16924 KB 
/*************************************
*    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 << '}'; }

const int INF = 1e9;

struct Node {
	int ma, s_p, p_s;
	pair <int, int> mi;
	Node(): ma(-INF), mi(INF, INF), s_p(-INF), p_s(-INF) {}
	Node(int h, int i): ma(h), mi(h, i), s_p(-INF), p_s(-INF) {}
	Node operator + (const Node &other) {
		Node res;
		res.ma = max(ma, other.ma);
		res.mi = min(mi, other.mi);
		res.s_p = max({s_p, other.s_p, other.ma - mi.fi});
		res.p_s = max({p_s, other.p_s, ma - other.mi.fi});
		return res;
	}
};

// end of template

int N;
vector <int> H;
vector <Node> st;

void build(int i, int l, int r) {
	if (r - l == 1) {
		st[i] = Node(H[l], l);
		return;
	}
	int m = l + r >> 1;
	build(i << 1, l, m);
	build(i << 1 | 1, m, r);
	st[i] = st[i << 1] + st[i << 1 | 1];
}

Node get(int i, int l, int r, int u, int v) {
	if (l >= v || r <= u || u >= v) return Node();
	if (u <= l && r <= v) return st[i];
	int m = l + r >> 1;
	return get(i << 1, l, m, u, v) + get(i << 1 | 1, m, r, u, v);
}

void init(int n, vector<int> h) {
	N = n;
	H = h;
	st.resize(N * 4 + 23);
	build(1, 0, N);
}

int max_towers(int l, int r, int d) {
	vector <int> left(N), right(N);
	vector <pair <int, int>> events;
	REP(i, N) {
		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);
	}
	while (!s.empty() && *s.begin() < l) s.erase(s.begin());
	while (!s.empty() && *s.rbegin() > r) s.erase(*s.rbegin());
	int res = s.size();
	if (!res) {
		s.insert(get(1, 0, N, l, r + 1).mi.se);
		++res;
	}
	int x = *s.begin();
	int y = *s.rbegin();
	res += get(1, 0, N, l, x).s_p >= d;
	res += get(1, 0, N, y + 1, r + 1).p_s >= d;
	return res;
}

Compilation message

towers.cpp: In constructor 'Node::Node()':
towers.cpp:48:18: warning: 'Node::mi' will be initialized after [-Wreorder]
   48 |  pair <int, int> mi;
      |                  ^~
towers.cpp:47:10: warning:   'int Node::s_p' [-Wreorder]
   47 |  int ma, s_p, p_s;
      |          ^~~
towers.cpp:49:2: warning:   when initialized here [-Wreorder]
   49 |  Node(): ma(-INF), mi(INF, INF), s_p(-INF), p_s(-INF) {}
      |  ^~~~
towers.cpp: In constructor 'Node::Node(int, int)':
towers.cpp:48:18: warning: 'Node::mi' will be initialized after [-Wreorder]
   48 |  pair <int, int> mi;
      |                  ^~
towers.cpp:47:10: warning:   'int Node::s_p' [-Wreorder]
   47 |  int ma, s_p, p_s;
      |          ^~~
towers.cpp:50:2: warning:   when initialized here [-Wreorder]
   50 |  Node(int h, int i): ma(h), mi(h, i), s_p(-INF), p_s(-INF) {}
      |  ^~~~
towers.cpp: In function 'void build(int, int, int)':
towers.cpp:72:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   72 |  int m = l + r >> 1;
      |          ~~^~~
towers.cpp: In function 'Node get(int, int, int, int, int)':
towers.cpp:81:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   81 |  int m = l + r >> 1;
      |          ~~^~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4033 ms 9612 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 592 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 1 ms 612 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 592 KB Output is correct
14 Correct 1 ms 592 KB Output is correct
15 Correct 1 ms 628 KB Output is correct
16 Correct 1 ms 592 KB Output is correct
17 Correct 1 ms 592 KB Output is correct
18 Correct 1 ms 592 KB Output is correct
19 Correct 1 ms 592 KB Output is correct
20 Correct 1 ms 592 KB Output is correct
21 Correct 1 ms 592 KB Output is correct
22 Correct 1 ms 592 KB Output is correct
23 Correct 1 ms 592 KB Output is correct
24 Correct 1 ms 592 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 592 KB Output is correct
27 Correct 1 ms 592 KB Output is correct
28 Correct 2 ms 592 KB Output is correct
29 Correct 1 ms 592 KB Output is correct
30 Correct 1 ms 592 KB Output is correct
31 Correct 1 ms 592 KB Output is correct
32 Correct 1 ms 592 KB Output is correct
33 Correct 1 ms 592 KB Output is correct
34 Correct 1 ms 592 KB Output is correct
35 Correct 1 ms 592 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 592 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 1 ms 612 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 592 KB Output is correct
14 Correct 1 ms 592 KB Output is correct
15 Correct 1 ms 628 KB Output is correct
16 Correct 1 ms 592 KB Output is correct
17 Correct 1 ms 592 KB Output is correct
18 Correct 1 ms 592 KB Output is correct
19 Correct 1 ms 592 KB Output is correct
20 Correct 1 ms 592 KB Output is correct
21 Correct 1 ms 592 KB Output is correct
22 Correct 1 ms 592 KB Output is correct
23 Correct 1 ms 592 KB Output is correct
24 Correct 1 ms 592 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 592 KB Output is correct
27 Correct 1 ms 592 KB Output is correct
28 Correct 2 ms 592 KB Output is correct
29 Correct 1 ms 592 KB Output is correct
30 Correct 1 ms 592 KB Output is correct
31 Correct 1 ms 592 KB Output is correct
32 Correct 1 ms 592 KB Output is correct
33 Correct 1 ms 592 KB Output is correct
34 Correct 1 ms 592 KB Output is correct
35 Correct 1 ms 592 KB Output is correct
36 Correct 53 ms 10372 KB Output is correct
37 Correct 71 ms 15896 KB Output is correct
38 Correct 78 ms 15908 KB Output is correct
39 Correct 59 ms 15860 KB Output is correct
40 Correct 100 ms 15880 KB Output is correct
41 Correct 78 ms 15900 KB Output is correct
42 Correct 92 ms 15860 KB Output is correct
43 Correct 42 ms 15944 KB Output is correct
44 Correct 42 ms 15868 KB Output is correct
45 Correct 47 ms 15864 KB Output is correct
46 Correct 41 ms 15884 KB Output is correct
47 Correct 82 ms 15932 KB Output is correct
48 Correct 82 ms 15892 KB Output is correct
49 Correct 91 ms 15880 KB Output is correct
50 Correct 39 ms 15888 KB Output is correct
51 Correct 38 ms 15872 KB Output is correct
52 Correct 79 ms 15876 KB Output is correct
53 Correct 81 ms 15832 KB Output is correct
54 Correct 81 ms 15884 KB Output is correct
55 Correct 47 ms 15952 KB Output is correct
56 Correct 39 ms 15864 KB Output is correct
57 Correct 75 ms 15408 KB Output is correct
58 Correct 78 ms 15872 KB Output is correct
59 Correct 88 ms 15924 KB Output is correct
60 Correct 87 ms 15900 KB Output is correct
61 Correct 85 ms 15928 KB Output is correct
62 Correct 83 ms 15928 KB Output is correct
63 Correct 100 ms 15928 KB Output is correct
64 Correct 43 ms 15864 KB Output is correct
65 Correct 45 ms 15864 KB Output is correct
66 Correct 49 ms 15884 KB Output is correct
67 Correct 40 ms 15928 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4024 ms 16924 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4038 ms 4624 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 592 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 1 ms 612 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 592 KB Output is correct
14 Correct 1 ms 592 KB Output is correct
15 Correct 1 ms 628 KB Output is correct
16 Correct 1 ms 592 KB Output is correct
17 Correct 1 ms 592 KB Output is correct
18 Correct 1 ms 592 KB Output is correct
19 Correct 1 ms 592 KB Output is correct
20 Correct 1 ms 592 KB Output is correct
21 Correct 1 ms 592 KB Output is correct
22 Correct 1 ms 592 KB Output is correct
23 Correct 1 ms 592 KB Output is correct
24 Correct 1 ms 592 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 592 KB Output is correct
27 Correct 1 ms 592 KB Output is correct
28 Correct 2 ms 592 KB Output is correct
29 Correct 1 ms 592 KB Output is correct
30 Correct 1 ms 592 KB Output is correct
31 Correct 1 ms 592 KB Output is correct
32 Correct 1 ms 592 KB Output is correct
33 Correct 1 ms 592 KB Output is correct
34 Correct 1 ms 592 KB Output is correct
35 Correct 1 ms 592 KB Output is correct
36 Correct 53 ms 10372 KB Output is correct
37 Correct 71 ms 15896 KB Output is correct
38 Correct 78 ms 15908 KB Output is correct
39 Correct 59 ms 15860 KB Output is correct
40 Correct 100 ms 15880 KB Output is correct
41 Correct 78 ms 15900 KB Output is correct
42 Correct 92 ms 15860 KB Output is correct
43 Correct 42 ms 15944 KB Output is correct
44 Correct 42 ms 15868 KB Output is correct
45 Correct 47 ms 15864 KB Output is correct
46 Correct 41 ms 15884 KB Output is correct
47 Correct 82 ms 15932 KB Output is correct
48 Correct 82 ms 15892 KB Output is correct
49 Correct 91 ms 15880 KB Output is correct
50 Correct 39 ms 15888 KB Output is correct
51 Correct 38 ms 15872 KB Output is correct
52 Correct 79 ms 15876 KB Output is correct
53 Correct 81 ms 15832 KB Output is correct
54 Correct 81 ms 15884 KB Output is correct
55 Correct 47 ms 15952 KB Output is correct
56 Correct 39 ms 15864 KB Output is correct
57 Correct 75 ms 15408 KB Output is correct
58 Correct 78 ms 15872 KB Output is correct
59 Correct 88 ms 15924 KB Output is correct
60 Correct 87 ms 15900 KB Output is correct
61 Correct 85 ms 15928 KB Output is correct
62 Correct 83 ms 15928 KB Output is correct
63 Correct 100 ms 15928 KB Output is correct
64 Correct 43 ms 15864 KB Output is correct
65 Correct 45 ms 15864 KB Output is correct
66 Correct 49 ms 15884 KB Output is correct
67 Correct 40 ms 15928 KB Output is correct
68 Execution timed out 4024 ms 16924 KB Time limit exceeded
69 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4033 ms 9612 KB Time limit exceeded
2 Halted 0 ms 0 KB -