oj.uz

Submission #670289

# Submission time Handle Problem Language Result Execution time Memory
670289 2022-12-08T14:54:26 Z SanguineChameleon Two Antennas (JOI19_antennas) C++17
100 / 100
 600 ms 50916 KB 
// BEGIN BOILERPLATE CODE

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

#ifdef KAMIRULEZ
	const bool kami_loc = true;
	const long long kami_seed = 69420;
#else
	const bool kami_loc = false;
	const long long kami_seed = chrono::steady_clock::now().time_since_epoch().count();
#endif

const string kami_fi = "kamirulez.inp";
const string kami_fo = "kamirulez.out";
mt19937_64 kami_gen(kami_seed);

long long rand_range(long long rmin, long long rmax) {
	uniform_int_distribution<long long> rdist(rmin, rmax);
	return rdist(kami_gen);
}

long double rand_real(long double rmin, long double rmax) {
	uniform_real_distribution<long double> rdist(rmin, rmax);
	return rdist(kami_gen);
}

void file_io(string fi, string fo) {
	if (fi != "" && (!kami_loc || fi == kami_fi)) {
		freopen(fi.c_str(), "r", stdin);
	}
	if (fo != "" && (!kami_loc || fo == kami_fo)) {
		freopen(fo.c_str(), "w", stdout);
	}
}

void set_up() {
	if (kami_loc) {
		file_io(kami_fi, kami_fo);
	}
	ios_base::sync_with_stdio(0);
	cin.tie(0);
}

void just_do_it();

void just_exec_it() {
	if (kami_loc) {
		auto pstart = chrono::steady_clock::now();
		just_do_it();
		auto pend = chrono::steady_clock::now();
		long long ptime = chrono::duration_cast<chrono::milliseconds>(pend - pstart).count();
		string bar(50, '=');
		cout << '\n' << bar << '\n';
		cout << "Time: " << ptime << " ms" << '\n';
	}
	else {
		just_do_it();
	}
}

int main() {
	set_up();
	just_exec_it();
	return 0;
}

// END BOILERPLATE CODE

// BEGIN MAIN CODE

const int ms = 2e5 + 20;
const int inf = 1e9 + 20;
int h[ms];
int a[ms];
int b[ms];
int res[ms];
int n, q;

struct query {
	int id, lt, rt;
};

struct node {
	int ma, mb, ts;
};

query qs[ms];
node tr[ms * 4];
vector<int> add[ms];
vector<int> rem[ms];
vector<query> qr[ms];

void push(int cc) {
	tr[cc * 2].mb = max(tr[cc * 2].mb, tr[cc].mb);
	tr[cc * 2].ts = max(tr[cc * 2].ts, tr[cc * 2].mb - tr[cc * 2].ma);
	tr[cc * 2 + 1].mb = max(tr[cc * 2 + 1].mb, tr[cc].mb);
	tr[cc * 2 + 1].ts = max(tr[cc * 2 + 1].ts, tr[cc * 2 + 1].mb - tr[cc * 2 + 1].ma);
	tr[cc].mb = -inf;
}

void update_a(int cc, int lt, int rt, int px, int pp) {
	if (lt == rt) {
		tr[cc].ma = pp;
		tr[cc].mb = -inf;
		return;
	}
	push(cc);
	int mt = (lt + rt) / 2;
	if (px <= mt) {
		update_a(cc * 2, lt, mt, px, pp);
	}
	else {
		update_a(cc * 2 + 1, mt + 1, rt, px, pp);
	}
	tr[cc].ma = min(tr[cc * 2].ma, tr[cc * 2 + 1].ma);
	tr[cc].ts = max(tr[cc * 2].ts, tr[cc * 2 + 1].ts);
}

void update_b(int cc, int lt, int rt, int ql, int qr, int pp) {
	if (lt == ql && rt == qr) {
		tr[cc].mb = max(tr[cc].mb, pp);
		tr[cc].ts = max(tr[cc].ts, tr[cc].mb - tr[cc].ma);
		return;
	}
	push(cc);
	int mt = (lt + rt) / 2;
	if (qr <= mt) {
		update_b(cc * 2, lt, mt, ql, qr, pp);
	}
	else if (ql >= mt + 1) {
		update_b(cc * 2 + 1, mt + 1, rt, ql, qr, pp);
	}
	else {
		update_b(cc * 2, lt, mt, ql, mt, pp);
		update_b(cc * 2 + 1, mt + 1, rt, mt + 1, qr, pp);
	}
	tr[cc].ts = max(tr[cc * 2].ts, tr[cc * 2 + 1].ts);
}

int get(int cc, int lt, int rt, int ql, int qr) {
	if (lt == ql && rt == qr) {
		return tr[cc].ts;
	}
	push(cc);
	int mt = (lt + rt) / 2;
	if (qr <= mt) {
		return get(cc * 2, lt, mt, ql, qr);
	}
	else if (ql >= mt + 1) {
		return get(cc * 2 + 1, mt + 1, rt, ql, qr);
	}
	else {
		return max(get(cc * 2, lt, mt, ql, mt), get(cc * 2 + 1, mt + 1, rt, mt + 1, qr));
	}
}

void solve() {
	fill_n(tr, ms * 4, node({inf, -inf, -inf}));
	for (int i = 1; i <= n; i++) {
		add[i].clear();
		rem[i].clear();
		qr[i].clear();
	}
	for (int i = 1; i <= n; i++) {
		int lt = i + a[i];
		int rt = i + b[i];
		if (lt <= n) {
			add[lt].push_back(i);
			rem[min(rt, n)].push_back(i);
		}
	}
	for (int i = 1; i <= q; i++) {
		qr[qs[i].rt].push_back(qs[i]);
	}
	for (int i = 1; i <= n; i++) {
		for (auto x: add[i]) {
			update_a(1, 1, n, x, h[x]);
		}
		int lt = i - b[i];
		int rt = i - a[i];
		if (rt >= 1) {
			update_b(1, 1, n, max(lt, 1), rt, h[i]);
		}
		for (auto x: qr[i]) {
			res[x.id] = max(res[x.id], get(1, 1, n, x.lt, x.rt));
		}
		for (auto x: rem[i]) {
			update_a(1, 1, n, x, inf);
		}
	}
}

void just_do_it() {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> h[i] >> a[i] >> b[i];
	}
	cin >> q;
	for (int i = 1; i <= q; i++) {
		cin >> qs[i].lt >> qs[i].rt;
		qs[i].id = i;
		res[i] = -inf;
	}
	solve();
	reverse(h + 1, h + n + 1);
	reverse(a + 1, a + n + 1);
	reverse(b + 1, b + n + 1);
	for (int i = 1; i <= q; i++) {
		qs[i].lt = n + 1 - qs[i].lt;
		qs[i].rt = n + 1 - qs[i].rt;
		swap(qs[i].lt, qs[i].rt);
	}
	solve();
	for (int i = 1; i <= q; i++) {
		cout << max(res[i], -1) << '\n';
	}
}

// END MAIN CODE

Compilation message

antennas.cpp: In function 'void file_io(std::string, std::string)':
antennas.cpp:30:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |   freopen(fi.c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:33:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |   freopen(fo.c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 14 ms 23848 KB Output is correct
3 Correct 14 ms 23764 KB Output is correct
4 Correct 14 ms 23772 KB Output is correct
5 Correct 13 ms 23872 KB Output is correct
6 Correct 14 ms 23764 KB Output is correct
7 Correct 14 ms 23772 KB Output is correct
8 Correct 13 ms 23860 KB Output is correct
9 Correct 13 ms 23824 KB Output is correct
10 Correct 15 ms 23788 KB Output is correct
11 Correct 13 ms 23764 KB Output is correct
12 Correct 13 ms 23764 KB Output is correct
13 Correct 14 ms 23768 KB Output is correct
14 Correct 13 ms 23764 KB Output is correct
15 Correct 13 ms 23864 KB Output is correct
16 Correct 14 ms 23848 KB Output is correct
17 Correct 13 ms 23828 KB Output is correct
18 Correct 14 ms 23760 KB Output is correct
19 Correct 14 ms 23864 KB Output is correct
20 Correct 15 ms 23764 KB Output is correct
21 Correct 13 ms 23772 KB Output is correct
22 Correct 14 ms 23872 KB Output is correct
23 Correct 13 ms 23764 KB Output is correct
24 Correct 13 ms 23764 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 14 ms 23848 KB Output is correct
3 Correct 14 ms 23764 KB Output is correct
4 Correct 14 ms 23772 KB Output is correct
5 Correct 13 ms 23872 KB Output is correct
6 Correct 14 ms 23764 KB Output is correct
7 Correct 14 ms 23772 KB Output is correct
8 Correct 13 ms 23860 KB Output is correct
9 Correct 13 ms 23824 KB Output is correct
10 Correct 15 ms 23788 KB Output is correct
11 Correct 13 ms 23764 KB Output is correct
12 Correct 13 ms 23764 KB Output is correct
13 Correct 14 ms 23768 KB Output is correct
14 Correct 13 ms 23764 KB Output is correct
15 Correct 13 ms 23864 KB Output is correct
16 Correct 14 ms 23848 KB Output is correct
17 Correct 13 ms 23828 KB Output is correct
18 Correct 14 ms 23760 KB Output is correct
19 Correct 14 ms 23864 KB Output is correct
20 Correct 15 ms 23764 KB Output is correct
21 Correct 13 ms 23772 KB Output is correct
22 Correct 14 ms 23872 KB Output is correct
23 Correct 13 ms 23764 KB Output is correct
24 Correct 13 ms 23764 KB Output is correct
25 Correct 89 ms 32212 KB Output is correct
26 Correct 27 ms 24964 KB Output is correct
27 Correct 127 ms 35408 KB Output is correct
28 Correct 128 ms 35244 KB Output is correct
29 Correct 89 ms 32460 KB Output is correct
30 Correct 93 ms 31820 KB Output is correct
31 Correct 103 ms 34336 KB Output is correct
32 Correct 129 ms 35168 KB Output is correct
33 Correct 118 ms 35148 KB Output is correct
34 Correct 69 ms 29388 KB Output is correct
35 Correct 121 ms 35916 KB Output is correct
36 Correct 127 ms 35228 KB Output is correct
37 Correct 77 ms 30036 KB Output is correct
38 Correct 126 ms 34204 KB Output is correct
39 Correct 30 ms 25420 KB Output is correct
40 Correct 125 ms 34188 KB Output is correct
41 Correct 95 ms 31988 KB Output is correct
42 Correct 124 ms 34260 KB Output is correct
43 Correct 52 ms 27512 KB Output is correct
44 Correct 125 ms 34252 KB Output is correct
45 Correct 33 ms 25652 KB Output is correct
46 Correct 127 ms 34288 KB Output is correct
47 Correct 47 ms 26568 KB Output is correct
48 Correct 124 ms 34272 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 300 ms 31112 KB Output is correct
2 Correct 325 ms 36404 KB Output is correct
3 Correct 218 ms 32600 KB Output is correct
4 Correct 318 ms 36372 KB Output is correct
5 Correct 128 ms 29516 KB Output is correct
6 Correct 311 ms 36364 KB Output is correct
7 Correct 261 ms 34708 KB Output is correct
8 Correct 310 ms 36380 KB Output is correct
9 Correct 51 ms 25804 KB Output is correct
10 Correct 323 ms 36396 KB Output is correct
11 Correct 191 ms 31568 KB Output is correct
12 Correct 304 ms 36456 KB Output is correct
13 Correct 237 ms 34144 KB Output is correct
14 Correct 224 ms 33800 KB Output is correct
15 Correct 212 ms 33000 KB Output is correct
16 Correct 201 ms 33364 KB Output is correct
17 Correct 249 ms 34724 KB Output is correct
18 Correct 223 ms 33576 KB Output is correct
19 Correct 220 ms 33580 KB Output is correct
20 Correct 218 ms 33616 KB Output is correct
21 Correct 212 ms 34092 KB Output is correct
22 Correct 224 ms 33892 KB Output is correct
23 Correct 223 ms 33924 KB Output is correct
24 Correct 192 ms 32860 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 14 ms 23848 KB Output is correct
3 Correct 14 ms 23764 KB Output is correct
4 Correct 14 ms 23772 KB Output is correct
5 Correct 13 ms 23872 KB Output is correct
6 Correct 14 ms 23764 KB Output is correct
7 Correct 14 ms 23772 KB Output is correct
8 Correct 13 ms 23860 KB Output is correct
9 Correct 13 ms 23824 KB Output is correct
10 Correct 15 ms 23788 KB Output is correct
11 Correct 13 ms 23764 KB Output is correct
12 Correct 13 ms 23764 KB Output is correct
13 Correct 14 ms 23768 KB Output is correct
14 Correct 13 ms 23764 KB Output is correct
15 Correct 13 ms 23864 KB Output is correct
16 Correct 14 ms 23848 KB Output is correct
17 Correct 13 ms 23828 KB Output is correct
18 Correct 14 ms 23760 KB Output is correct
19 Correct 14 ms 23864 KB Output is correct
20 Correct 15 ms 23764 KB Output is correct
21 Correct 13 ms 23772 KB Output is correct
22 Correct 14 ms 23872 KB Output is correct
23 Correct 13 ms 23764 KB Output is correct
24 Correct 13 ms 23764 KB Output is correct
25 Correct 89 ms 32212 KB Output is correct
26 Correct 27 ms 24964 KB Output is correct
27 Correct 127 ms 35408 KB Output is correct
28 Correct 128 ms 35244 KB Output is correct
29 Correct 89 ms 32460 KB Output is correct
30 Correct 93 ms 31820 KB Output is correct
31 Correct 103 ms 34336 KB Output is correct
32 Correct 129 ms 35168 KB Output is correct
33 Correct 118 ms 35148 KB Output is correct
34 Correct 69 ms 29388 KB Output is correct
35 Correct 121 ms 35916 KB Output is correct
36 Correct 127 ms 35228 KB Output is correct
37 Correct 77 ms 30036 KB Output is correct
38 Correct 126 ms 34204 KB Output is correct
39 Correct 30 ms 25420 KB Output is correct
40 Correct 125 ms 34188 KB Output is correct
41 Correct 95 ms 31988 KB Output is correct
42 Correct 124 ms 34260 KB Output is correct
43 Correct 52 ms 27512 KB Output is correct
44 Correct 125 ms 34252 KB Output is correct
45 Correct 33 ms 25652 KB Output is correct
46 Correct 127 ms 34288 KB Output is correct
47 Correct 47 ms 26568 KB Output is correct
48 Correct 124 ms 34272 KB Output is correct
49 Correct 300 ms 31112 KB Output is correct
50 Correct 325 ms 36404 KB Output is correct
51 Correct 218 ms 32600 KB Output is correct
52 Correct 318 ms 36372 KB Output is correct
53 Correct 128 ms 29516 KB Output is correct
54 Correct 311 ms 36364 KB Output is correct
55 Correct 261 ms 34708 KB Output is correct
56 Correct 310 ms 36380 KB Output is correct
57 Correct 51 ms 25804 KB Output is correct
58 Correct 323 ms 36396 KB Output is correct
59 Correct 191 ms 31568 KB Output is correct
60 Correct 304 ms 36456 KB Output is correct
61 Correct 237 ms 34144 KB Output is correct
62 Correct 224 ms 33800 KB Output is correct
63 Correct 212 ms 33000 KB Output is correct
64 Correct 201 ms 33364 KB Output is correct
65 Correct 249 ms 34724 KB Output is correct
66 Correct 223 ms 33576 KB Output is correct
67 Correct 220 ms 33580 KB Output is correct
68 Correct 218 ms 33616 KB Output is correct
69 Correct 212 ms 34092 KB Output is correct
70 Correct 224 ms 33892 KB Output is correct
71 Correct 223 ms 33924 KB Output is correct
72 Correct 192 ms 32860 KB Output is correct
73 Correct 469 ms 46100 KB Output is correct
74 Correct 334 ms 37936 KB Output is correct
75 Correct 436 ms 46424 KB Output is correct
76 Correct 561 ms 50864 KB Output is correct
77 Correct 289 ms 39536 KB Output is correct
78 Correct 487 ms 46548 KB Output is correct
79 Correct 525 ms 48948 KB Output is correct
80 Correct 599 ms 50884 KB Output is correct
81 Correct 223 ms 38064 KB Output is correct
82 Correct 440 ms 44172 KB Output is correct
83 Correct 397 ms 45340 KB Output is correct
84 Correct 600 ms 50916 KB Output is correct
85 Correct 388 ms 42400 KB Output is correct
86 Correct 476 ms 47092 KB Output is correct
87 Correct 250 ms 35484 KB Output is correct
88 Correct 444 ms 46456 KB Output is correct
89 Correct 429 ms 44748 KB Output is correct
90 Correct 487 ms 46664 KB Output is correct
91 Correct 329 ms 38596 KB Output is correct
92 Correct 478 ms 46944 KB Output is correct
93 Correct 265 ms 36988 KB Output is correct
94 Correct 494 ms 47096 KB Output is correct
95 Correct 294 ms 37976 KB Output is correct
96 Correct 446 ms 46024 KB Output is correct