oj.uz

Submission #798497

# Submission time Handle Problem Language Result Execution time Memory
798497 2023-07-30T18:56:26 Z rnl42 Two Antennas (JOI19_antennas) C++14
100 / 100
 516 ms 43712 KB 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

constexpr int INF = 1e9+42;

struct Antenna {
	int h, a, b;
};

struct Query {
	int l, r, qid;
	bool operator<(const Query& other) const {
		return r == other.r ? l < other.l : r < other.r;
	}
};

struct nodepos {
	int maxfull = -INF, bestheight = +INF;
	nodepos() {}
	nodepos(int maxfull, int bestheight) : maxfull(maxfull), bestheight(bestheight) {}
	void update(nodepos k) {
		bestheight = k.bestheight;
	}
	nodepos merge(const nodepos& other) const {
		return nodepos(max(maxfull, other.maxfull), min(bestheight, other.bestheight));
	}
	void apply(int h) {
		maxfull = max(maxfull, h-bestheight);
	}
};
struct nodeneg {
	int maxfull = -INF, bestheight = -INF;
	nodeneg() {}
	nodeneg(int maxfull, int bestheight) : maxfull(maxfull), bestheight(bestheight) {}
	void update(nodeneg k) {
		bestheight = k.bestheight;
	}
	nodeneg merge(const nodeneg& other) const {
		return nodeneg(max(maxfull, other.maxfull), max(bestheight, other.bestheight));
	}
	void apply(int h) {
		maxfull = max(maxfull, bestheight-h);
	}
};
int idpos() { return -INF; }
int idneg() { return +INF; }
int intmin(int a, int b) { return min(a, b); }
int intmax(int a, int b) { return max(a, b); }

ostream& operator<<(ostream& out, const nodepos k) {
	return out << k.maxfull << ":" << k.bestheight << ":p";
}
ostream& operator<<(ostream& out, const nodeneg k) {
	return out << k.maxfull << ":" << k.bestheight << ":n";
}

template <class node, class fun, fun(*id)(), fun(*fusion)(fun,fun)>
class lazy {
	int N;
	vector<pair<node,fun>> tree;
public:
	lazy(const int __N) : N(1<<__lg(2*__N-1)) {
		tree.resize(2*N);
	}
	void update(int req, node val, int l = 0, int r = -1, int idx = 1) {
		if (r == -1) r = N-1;
		if (req < l || req > r) return;
		else if (req == l && req == r) {
			tree[idx].first.update(val);
		} else {
			pushval(idx);
			int mid = (l+r)>>1;
			update(req, val, l, mid, 2*idx);
			update(req, val, mid+1, r, 2*idx+1);
			tree[idx].first = tree[2*idx].first.merge(tree[2*idx+1].first);
		}
	}
	void update(int reql, int reqr, fun val, int l = 0, int r = -1, int idx = 1) {
		if (r == -1) r = N-1;
		if (reqr < l || reql > r) return;
		else if (reql <= l && r <= reqr) {
			pushval(idx);
			tree[idx].second = val;
			tree[idx].first.apply(val);
		} else {
			pushval(idx);
			int mid = (l+r)>>1;
			update(reql, reqr, val, l, mid, 2*idx);
			update(reql, reqr, val, mid+1, r, 2*idx+1);
			tree[idx].first = tree[2*idx].first.merge(tree[2*idx+1].first);
		}
	}
	node query(int reql, int reqr, int l = 0, int r = -1, int idx = 1) {
		if (r == -1) r = N-1;
		if (reqr < l || reql > r) return node{};
		else if (reql <= l && r <= reqr) {
			return tree[idx].first;
		} else {
			pushval(idx);
			int mid = (l+r)>>1;
			return query(reql, reqr, l, mid, 2*idx).merge(query(reql, reqr, mid+1, r, 2*idx+1));
		}
	}
private:
	void pushval(int idx) {
		if (idx < N) {
			tree[2*idx].first.apply(tree[idx].second);
			tree[2*idx].second = fusion(tree[idx].second, tree[2*idx].second);
			tree[2*idx+1].first.apply(tree[idx].second);
			tree[2*idx+1].second = fusion(tree[idx].second, tree[2*idx+1].second);
		}
		tree[idx].second = id();
	}
};


int N, Q;
vector<Antenna> A;
vector<vector<Query>> qbyR;
vector<vector<pair<int,bool>>> events;

int main() {
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    cin >> N;
    A.resize(N);
    events.resize(N+1);
    for (int i = 0; i < N; i++) {
		cin >> A[i].h >> A[i].a >> A[i].b;
		events[min(i+A[i].a, N)].emplace_back(i, true);
		events[min(i+A[i].b+1, N)].emplace_back(i, false);
	}
	cin >> Q;
	qbyR.resize(N);
	for (int i = 0; i < Q; i++) {
		Query q;
		cin >> q.l >> q.r, q.l--, q.r--;
		q.qid = i;
		qbyR[q.r].push_back(q);
	}
	
	vector<int> ans(Q);
	lazy<nodepos,int,idpos,intmax> treepos(N);
	lazy<nodeneg,int,idneg,intmin> treeneg(N);
	for (int R = 0; R < N; R++) {
		for (auto [k, type] : events[R]) {
			if (type) {
				treepos.update(k, {-INF, A[k].h});
				treeneg.update(k, {-INF, A[k].h});
			} else {
				treepos.update(k, {-INF, +INF});
				treeneg.update(k, {-INF, -INF});
			}
		}
		
		if (R-A[R].a >= 0) {
			treepos.update(max(0, R-A[R].b), max(0, R-A[R].a), A[R].h);
			treeneg.update(max(0, R-A[R].b), max(0, R-A[R].a), A[R].h);
		}
		
		for (auto& q : qbyR[R]) {
			ans[q.qid] = max(-1, max(treepos.query(q.l, q.r).maxfull, treeneg.query(q.l, q.r).maxfull));
		}
	}
	
	for (int i = 0; i < Q; i++) {
		cout << ans[i] << '\n';
	}
}

Compilation message

antennas.cpp: In function 'int main()':
antennas.cpp:147:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  147 |   for (auto [k, type] : events[R]) {
      |             ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 75 ms 6036 KB Output is correct
26 Correct 11 ms 1224 KB Output is correct
27 Correct 115 ms 8424 KB Output is correct
28 Correct 112 ms 8436 KB Output is correct
29 Correct 75 ms 6040 KB Output is correct
30 Correct 79 ms 5964 KB Output is correct
31 Correct 90 ms 7444 KB Output is correct
32 Correct 113 ms 8412 KB Output is correct
33 Correct 103 ms 8012 KB Output is correct
34 Correct 55 ms 4416 KB Output is correct
35 Correct 112 ms 8300 KB Output is correct
36 Correct 117 ms 8396 KB Output is correct
37 Correct 68 ms 4628 KB Output is correct
38 Correct 112 ms 7468 KB Output is correct
39 Correct 18 ms 1472 KB Output is correct
40 Correct 111 ms 7460 KB Output is correct
41 Correct 81 ms 5676 KB Output is correct
42 Correct 111 ms 7452 KB Output is correct
43 Correct 39 ms 2844 KB Output is correct
44 Correct 110 ms 7476 KB Output is correct
45 Correct 21 ms 1740 KB Output is correct
46 Correct 112 ms 7512 KB Output is correct
47 Correct 30 ms 2396 KB Output is correct
48 Correct 111 ms 7508 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 225 ms 27692 KB Output is correct
2 Correct 267 ms 34084 KB Output is correct
3 Correct 170 ms 27620 KB Output is correct
4 Correct 249 ms 34032 KB Output is correct
5 Correct 112 ms 16256 KB Output is correct
6 Correct 247 ms 33996 KB Output is correct
7 Correct 218 ms 31184 KB Output is correct
8 Correct 269 ms 34032 KB Output is correct
9 Correct 31 ms 5192 KB Output is correct
10 Correct 249 ms 33964 KB Output is correct
11 Correct 146 ms 19764 KB Output is correct
12 Correct 264 ms 34108 KB Output is correct
13 Correct 227 ms 32556 KB Output is correct
14 Correct 213 ms 32428 KB Output is correct
15 Correct 204 ms 32400 KB Output is correct
16 Correct 199 ms 32780 KB Output is correct
17 Correct 227 ms 32708 KB Output is correct
18 Correct 213 ms 32704 KB Output is correct
19 Correct 218 ms 32328 KB Output is correct
20 Correct 205 ms 32356 KB Output is correct
21 Correct 194 ms 32156 KB Output is correct
22 Correct 207 ms 32396 KB Output is correct
23 Correct 213 ms 32552 KB Output is correct
24 Correct 195 ms 32424 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 75 ms 6036 KB Output is correct
26 Correct 11 ms 1224 KB Output is correct
27 Correct 115 ms 8424 KB Output is correct
28 Correct 112 ms 8436 KB Output is correct
29 Correct 75 ms 6040 KB Output is correct
30 Correct 79 ms 5964 KB Output is correct
31 Correct 90 ms 7444 KB Output is correct
32 Correct 113 ms 8412 KB Output is correct
33 Correct 103 ms 8012 KB Output is correct
34 Correct 55 ms 4416 KB Output is correct
35 Correct 112 ms 8300 KB Output is correct
36 Correct 117 ms 8396 KB Output is correct
37 Correct 68 ms 4628 KB Output is correct
38 Correct 112 ms 7468 KB Output is correct
39 Correct 18 ms 1472 KB Output is correct
40 Correct 111 ms 7460 KB Output is correct
41 Correct 81 ms 5676 KB Output is correct
42 Correct 111 ms 7452 KB Output is correct
43 Correct 39 ms 2844 KB Output is correct
44 Correct 110 ms 7476 KB Output is correct
45 Correct 21 ms 1740 KB Output is correct
46 Correct 112 ms 7512 KB Output is correct
47 Correct 30 ms 2396 KB Output is correct
48 Correct 111 ms 7508 KB Output is correct
49 Correct 225 ms 27692 KB Output is correct
50 Correct 267 ms 34084 KB Output is correct
51 Correct 170 ms 27620 KB Output is correct
52 Correct 249 ms 34032 KB Output is correct
53 Correct 112 ms 16256 KB Output is correct
54 Correct 247 ms 33996 KB Output is correct
55 Correct 218 ms 31184 KB Output is correct
56 Correct 269 ms 34032 KB Output is correct
57 Correct 31 ms 5192 KB Output is correct
58 Correct 249 ms 33964 KB Output is correct
59 Correct 146 ms 19764 KB Output is correct
60 Correct 264 ms 34108 KB Output is correct
61 Correct 227 ms 32556 KB Output is correct
62 Correct 213 ms 32428 KB Output is correct
63 Correct 204 ms 32400 KB Output is correct
64 Correct 199 ms 32780 KB Output is correct
65 Correct 227 ms 32708 KB Output is correct
66 Correct 213 ms 32704 KB Output is correct
67 Correct 218 ms 32328 KB Output is correct
68 Correct 205 ms 32356 KB Output is correct
69 Correct 194 ms 32156 KB Output is correct
70 Correct 207 ms 32396 KB Output is correct
71 Correct 213 ms 32552 KB Output is correct
72 Correct 195 ms 32424 KB Output is correct
73 Correct 385 ms 38988 KB Output is correct
74 Correct 279 ms 34904 KB Output is correct
75 Correct 373 ms 36852 KB Output is correct
76 Correct 482 ms 43712 KB Output is correct
77 Correct 265 ms 22904 KB Output is correct
78 Correct 421 ms 40476 KB Output is correct
79 Correct 440 ms 40604 KB Output is correct
80 Correct 516 ms 43568 KB Output is correct
81 Correct 195 ms 13556 KB Output is correct
82 Correct 361 ms 38740 KB Output is correct
83 Correct 358 ms 29008 KB Output is correct
84 Correct 461 ms 43516 KB Output is correct
85 Correct 361 ms 37244 KB Output is correct
86 Correct 434 ms 40812 KB Output is correct
87 Correct 240 ms 33700 KB Output is correct
88 Correct 413 ms 41176 KB Output is correct
89 Correct 407 ms 38668 KB Output is correct
90 Correct 448 ms 41172 KB Output is correct
91 Correct 296 ms 35156 KB Output is correct
92 Correct 422 ms 40680 KB Output is correct
93 Correct 255 ms 33768 KB Output is correct
94 Correct 441 ms 40900 KB Output is correct
95 Correct 274 ms 34688 KB Output is correct
96 Correct 420 ms 40756 KB Output is correct