Submission #464445

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
464445	2021-08-13T08:47:23 Z	pavement	Two Antennas (JOI19_antennas)	C++17	13 / 100	3000 ms	16756 KB

antennas

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef double db;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int N, Q, H[200005], A[200005], B[200005], T[200005], out[200005];
vector<ii> qu[200005];

main() {
	memset(T, -1, sizeof T);
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N;
	for (int i = 1; i <= N; i++) cin >> H[i] >> A[i] >> B[i];
	cin >> Q;
	for (int i = 1, L, R; i <= Q; i++) {
		cin >> L >> R;
		qu[R].eb(L, i);
	}
	for (int i = 1; i <= N; i++) {
		for (int j = 1; j < i; j++)
			if (j + A[j] <= i && i <= j + B[j] && i - B[i] <= j && j <= i - A[i]) T[j] = max(T[j], llabs(H[i] - H[j]));	
		for (auto u : qu[i]) {
			int ans = -1;
			for (int k = u.first; k <= i; k++) ans = max(ans, T[k]);
			out[u.second] = ans;
		}
	}
	for (int i = 1; i <= Q; i++) cout << out[i] << '\n';
}

Compilation message

antennas.cpp:31:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   31 | main() {
      | ^~~~

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	6604 KB	Output is correct
2	Correct	4 ms	6604 KB	Output is correct
3	Correct	4 ms	6604 KB	Output is correct
4	Correct	5 ms	6604 KB	Output is correct
5	Correct	4 ms	6604 KB	Output is correct
6	Correct	4 ms	6604 KB	Output is correct
7	Correct	5 ms	6604 KB	Output is correct
8	Correct	4 ms	6604 KB	Output is correct
9	Correct	4 ms	6596 KB	Output is correct
10	Correct	4 ms	6604 KB	Output is correct
11	Correct	4 ms	6604 KB	Output is correct
12	Correct	4 ms	6604 KB	Output is correct
13	Correct	4 ms	6604 KB	Output is correct
14	Correct	4 ms	6604 KB	Output is correct
15	Correct	4 ms	6604 KB	Output is correct
16	Correct	4 ms	6604 KB	Output is correct
17	Correct	4 ms	6604 KB	Output is correct
18	Correct	4 ms	6600 KB	Output is correct
19	Correct	4 ms	6604 KB	Output is correct
20	Correct	4 ms	6532 KB	Output is correct
21	Correct	4 ms	6604 KB	Output is correct
22	Correct	4 ms	6604 KB	Output is correct
23	Correct	4 ms	6604 KB	Output is correct
24	Correct	4 ms	6604 KB	Output is correct
25	Correct	91 ms	13744 KB	Output is correct
26	Correct	25 ms	7352 KB	Output is correct
27	Correct	175 ms	16524 KB	Output is correct
28	Correct	212 ms	16640 KB	Output is correct
29	Correct	91 ms	13720 KB	Output is correct
30	Correct	137 ms	13228 KB	Output is correct
31	Correct	83 ms	15400 KB	Output is correct
32	Correct	192 ms	16692 KB	Output is correct
33	Correct	137 ms	15980 KB	Output is correct
34	Correct	98 ms	11440 KB	Output is correct
35	Correct	162 ms	16572 KB	Output is correct
36	Correct	192 ms	16756 KB	Output is correct
37	Correct	113 ms	11848 KB	Output is correct
38	Correct	188 ms	15660 KB	Output is correct
39	Correct	31 ms	7884 KB	Output is correct
40	Correct	180 ms	15820 KB	Output is correct
41	Correct	135 ms	13256 KB	Output is correct
42	Correct	181 ms	15688 KB	Output is correct
43	Correct	65 ms	9528 KB	Output is correct
44	Correct	180 ms	15812 KB	Output is correct
45	Correct	37 ms	8076 KB	Output is correct
46	Correct	180 ms	15696 KB	Output is correct
47	Correct	50 ms	8900 KB	Output is correct
48	Correct	182 ms	15740 KB	Output is correct

Subtask #3
0 / 22.0

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

Subtask #4
0 / 65.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	6604 KB	Output is correct
2	Correct	4 ms	6604 KB	Output is correct
3	Correct	4 ms	6604 KB	Output is correct
4	Correct	5 ms	6604 KB	Output is correct
5	Correct	4 ms	6604 KB	Output is correct
6	Correct	4 ms	6604 KB	Output is correct
7	Correct	5 ms	6604 KB	Output is correct
8	Correct	4 ms	6604 KB	Output is correct
9	Correct	4 ms	6596 KB	Output is correct
10	Correct	4 ms	6604 KB	Output is correct
11	Correct	4 ms	6604 KB	Output is correct
12	Correct	4 ms	6604 KB	Output is correct
13	Correct	4 ms	6604 KB	Output is correct
14	Correct	4 ms	6604 KB	Output is correct
15	Correct	4 ms	6604 KB	Output is correct
16	Correct	4 ms	6604 KB	Output is correct
17	Correct	4 ms	6604 KB	Output is correct
18	Correct	4 ms	6600 KB	Output is correct
19	Correct	4 ms	6604 KB	Output is correct
20	Correct	4 ms	6532 KB	Output is correct
21	Correct	4 ms	6604 KB	Output is correct
22	Correct	4 ms	6604 KB	Output is correct
23	Correct	4 ms	6604 KB	Output is correct
24	Correct	4 ms	6604 KB	Output is correct
25	Correct	91 ms	13744 KB	Output is correct
26	Correct	25 ms	7352 KB	Output is correct
27	Correct	175 ms	16524 KB	Output is correct
28	Correct	212 ms	16640 KB	Output is correct
29	Correct	91 ms	13720 KB	Output is correct
30	Correct	137 ms	13228 KB	Output is correct
31	Correct	83 ms	15400 KB	Output is correct
32	Correct	192 ms	16692 KB	Output is correct
33	Correct	137 ms	15980 KB	Output is correct
34	Correct	98 ms	11440 KB	Output is correct
35	Correct	162 ms	16572 KB	Output is correct
36	Correct	192 ms	16756 KB	Output is correct
37	Correct	113 ms	11848 KB	Output is correct
38	Correct	188 ms	15660 KB	Output is correct
39	Correct	31 ms	7884 KB	Output is correct
40	Correct	180 ms	15820 KB	Output is correct
41	Correct	135 ms	13256 KB	Output is correct
42	Correct	181 ms	15688 KB	Output is correct
43	Correct	65 ms	9528 KB	Output is correct
44	Correct	180 ms	15812 KB	Output is correct
45	Correct	37 ms	8076 KB	Output is correct
46	Correct	180 ms	15696 KB	Output is correct
47	Correct	50 ms	8900 KB	Output is correct
48	Correct	182 ms	15740 KB	Output is correct
49	Execution timed out	3068 ms	14816 KB	Time limit exceeded
50	Halted	0 ms	0 KB	-

Submission #464445

Compilation message

Subtask #1 2.0 / 2.0

Subtask #2 11.0 / 11.0

Subtask #3 0 / 22.0

Subtask #4 0 / 65.0

Subtask #1
2.0 / 2.0

Subtask #2
11.0 / 11.0

Subtask #3
0 / 22.0

Subtask #4
0 / 65.0