#include <iostream>
int main() {
int n , q; std::cin >> n >> q;
int t[n],s[n];
for (int i = 0;i < n; i++) {
std::cin >> s[i] >> t[i];
}
int x[q],y[q],z[q];
for (int i = 0;i < q;i++) {
std::cin >> x[i] >> y[i] >> z[i];
}
for (int i = 0;i < q;i++) {
int ans = 0;
for (int j = 0;j < n; j++) {
if (s[j] >= x[i] && t[j] >= y[i]) {
if (s[j] + t[j] >= z[i]) {
ans ++;
}
}
}
std::cout << ans << std::endl;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
1 ms |
256 KB |
Output is correct |
3 |
Correct |
1 ms |
256 KB |
Output is correct |
4 |
Correct |
1 ms |
256 KB |
Output is correct |
5 |
Correct |
1 ms |
288 KB |
Output is correct |
6 |
Correct |
1 ms |
256 KB |
Output is correct |
7 |
Correct |
70 ms |
512 KB |
Output is correct |
8 |
Correct |
69 ms |
512 KB |
Output is correct |
9 |
Correct |
70 ms |
512 KB |
Output is correct |
10 |
Correct |
69 ms |
512 KB |
Output is correct |
11 |
Correct |
76 ms |
512 KB |
Output is correct |
12 |
Correct |
62 ms |
384 KB |
Output is correct |
13 |
Correct |
62 ms |
512 KB |
Output is correct |
14 |
Correct |
64 ms |
512 KB |
Output is correct |
15 |
Correct |
65 ms |
632 KB |
Output is correct |
16 |
Correct |
38 ms |
504 KB |
Output is correct |
17 |
Correct |
56 ms |
632 KB |
Output is correct |
18 |
Correct |
21 ms |
384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
3066 ms |
5000 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
3066 ms |
5000 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
1 ms |
256 KB |
Output is correct |
3 |
Correct |
1 ms |
256 KB |
Output is correct |
4 |
Correct |
1 ms |
256 KB |
Output is correct |
5 |
Correct |
1 ms |
288 KB |
Output is correct |
6 |
Correct |
1 ms |
256 KB |
Output is correct |
7 |
Correct |
70 ms |
512 KB |
Output is correct |
8 |
Correct |
69 ms |
512 KB |
Output is correct |
9 |
Correct |
70 ms |
512 KB |
Output is correct |
10 |
Correct |
69 ms |
512 KB |
Output is correct |
11 |
Correct |
76 ms |
512 KB |
Output is correct |
12 |
Correct |
62 ms |
384 KB |
Output is correct |
13 |
Correct |
62 ms |
512 KB |
Output is correct |
14 |
Correct |
64 ms |
512 KB |
Output is correct |
15 |
Correct |
65 ms |
632 KB |
Output is correct |
16 |
Correct |
38 ms |
504 KB |
Output is correct |
17 |
Correct |
56 ms |
632 KB |
Output is correct |
18 |
Correct |
21 ms |
384 KB |
Output is correct |
19 |
Execution timed out |
3066 ms |
5000 KB |
Time limit exceeded |
20 |
Halted |
0 ms |
0 KB |
- |