답안 #375835

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
375835 2021-03-10T03:58:22 Z casperwang Two Antennas (JOI19_antennas) C++14
2 / 100
3000 ms 2412 KB
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 200000;
int N, Q;
int h[MAXN+1];
int a[MAXN+1];
int b[MAXN+1];
int l, r;

signed main() {
	ios_base::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 = 0; i < Q; i++) {
		cin >> l >> r;
		int ans = -1;
		for (int j = l; j <= r; j++) {
			for (int k = l; k <= r; k++) {
				if (j == k) continue;
				int dis = abs(j-k);
				if (dis >= a[j] && dis <= b[j] && dis >= a[k] && dis <= b[k]) {
					ans = max(ans, abs(h[j] - h[k]));
				}
			}
		}
		cout << ans << '\n';
	}
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 4 ms 364 KB Output is correct
3 Correct 4 ms 364 KB Output is correct
4 Correct 6 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 4 ms 364 KB Output is correct
7 Correct 6 ms 364 KB Output is correct
8 Correct 7 ms 512 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 5 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 7 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 5 ms 364 KB Output is correct
15 Correct 3 ms 364 KB Output is correct
16 Correct 3 ms 364 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 3 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 3 ms 364 KB Output is correct
21 Correct 4 ms 364 KB Output is correct
22 Correct 4 ms 364 KB Output is correct
23 Correct 3 ms 364 KB Output is correct
24 Correct 4 ms 364 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 4 ms 364 KB Output is correct
3 Correct 4 ms 364 KB Output is correct
4 Correct 6 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 4 ms 364 KB Output is correct
7 Correct 6 ms 364 KB Output is correct
8 Correct 7 ms 512 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 5 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 7 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 5 ms 364 KB Output is correct
15 Correct 3 ms 364 KB Output is correct
16 Correct 3 ms 364 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 3 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 3 ms 364 KB Output is correct
21 Correct 4 ms 364 KB Output is correct
22 Correct 4 ms 364 KB Output is correct
23 Correct 3 ms 364 KB Output is correct
24 Correct 4 ms 364 KB Output is correct
25 Execution timed out 3052 ms 840 KB Time limit exceeded
26 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3076 ms 2412 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 4 ms 364 KB Output is correct
3 Correct 4 ms 364 KB Output is correct
4 Correct 6 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 4 ms 364 KB Output is correct
7 Correct 6 ms 364 KB Output is correct
8 Correct 7 ms 512 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 5 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 7 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 5 ms 364 KB Output is correct
15 Correct 3 ms 364 KB Output is correct
16 Correct 3 ms 364 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 3 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 3 ms 364 KB Output is correct
21 Correct 4 ms 364 KB Output is correct
22 Correct 4 ms 364 KB Output is correct
23 Correct 3 ms 364 KB Output is correct
24 Correct 4 ms 364 KB Output is correct
25 Execution timed out 3052 ms 840 KB Time limit exceeded
26 Halted 0 ms 0 KB -