Submission #521712

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
521712	2022-02-02T19:13:39 Z	blue	Two Antennas (JOI19_antennas)	C++17	2 / 100	3000 ms	2380 KB

antennas

#include <iostream>
using namespace std;

int main()
{
	int N;
	cin >> N;

	int H[1+N], A[1+N], B[1+N];
	for(int i = 1; i <= N; i++) cin >> H[i] >> A[i] >> B[i];


	int Q;
	cin >> Q;

	for(int j = 1; j <= Q; j++)
	{
		int L, R;
		cin >> L >> R;

		int ans = -1;

		for(int i = L; i <= R; i++)
			for(int j = i+1; j <= R; j++)
				if(i + A[i] <= j && j <= i + B[i])
					if(j - B[j] <= i && i <= j - A[j])
						ans = max(ans, abs(H[i] - H[j]));

		cout << ans << '\n';
	}
}

Subtask #1

2.0 / 2.0

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

Subtask #2

0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	2 ms	204 KB	Output is correct
3	Correct	2 ms	204 KB	Output is correct
4	Correct	3 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	2 ms	296 KB	Output is correct
7	Correct	3 ms	204 KB	Output is correct
8	Correct	3 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	3 ms	296 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	3 ms	204 KB	Output is correct
13	Correct	2 ms	204 KB	Output is correct
14	Correct	2 ms	204 KB	Output is correct
15	Correct	2 ms	204 KB	Output is correct
16	Correct	2 ms	204 KB	Output is correct
17	Correct	2 ms	204 KB	Output is correct
18	Correct	2 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	2 ms	204 KB	Output is correct
21	Correct	2 ms	292 KB	Output is correct
22	Correct	2 ms	204 KB	Output is correct
23	Correct	2 ms	292 KB	Output is correct
24	Correct	3 ms	204 KB	Output is correct
25	Execution timed out	3065 ms	1924 KB	Time limit exceeded
26	Halted	0 ms	0 KB	-

Subtask #3

0 / 22.0

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

Subtask #4

0 / 65.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	2 ms	204 KB	Output is correct
3	Correct	2 ms	204 KB	Output is correct
4	Correct	3 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	2 ms	296 KB	Output is correct
7	Correct	3 ms	204 KB	Output is correct
8	Correct	3 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	3 ms	296 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	3 ms	204 KB	Output is correct
13	Correct	2 ms	204 KB	Output is correct
14	Correct	2 ms	204 KB	Output is correct
15	Correct	2 ms	204 KB	Output is correct
16	Correct	2 ms	204 KB	Output is correct
17	Correct	2 ms	204 KB	Output is correct
18	Correct	2 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	2 ms	204 KB	Output is correct
21	Correct	2 ms	292 KB	Output is correct
22	Correct	2 ms	204 KB	Output is correct
23	Correct	2 ms	292 KB	Output is correct
24	Correct	3 ms	204 KB	Output is correct
25	Execution timed out	3065 ms	1924 KB	Time limit exceeded
26	Halted	0 ms	0 KB	-