#include <iostream>
#pragma GCC optimize("-Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
const int MAXN = 1e5 + 10;
int a[MAXN], b[MAXN];
int main() {
int n, q;
cin >> n >> q;
for(int i = 0; i < n; ++i) cin >> a[i] >> b[i];
int x, y, z, ans = 0;
for(int i = 0; i < q; ++i) {
cin >> x >> y >> z;
ans = 0;
for(int j = 0; j < n; ++j)
if(a[j] >= x && b[j] >= y && a[j] + b[j] >= z) ++ans;
cout << ans << '\n';
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
17 ms |
340 KB |
Output is correct |
8 |
Correct |
16 ms |
332 KB |
Output is correct |
9 |
Correct |
15 ms |
336 KB |
Output is correct |
10 |
Correct |
14 ms |
332 KB |
Output is correct |
11 |
Correct |
14 ms |
332 KB |
Output is correct |
12 |
Correct |
11 ms |
332 KB |
Output is correct |
13 |
Correct |
15 ms |
332 KB |
Output is correct |
14 |
Correct |
14 ms |
332 KB |
Output is correct |
15 |
Correct |
14 ms |
336 KB |
Output is correct |
16 |
Correct |
14 ms |
332 KB |
Output is correct |
17 |
Correct |
14 ms |
332 KB |
Output is correct |
18 |
Correct |
11 ms |
332 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
3070 ms |
1724 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
3070 ms |
1724 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
17 ms |
340 KB |
Output is correct |
8 |
Correct |
16 ms |
332 KB |
Output is correct |
9 |
Correct |
15 ms |
336 KB |
Output is correct |
10 |
Correct |
14 ms |
332 KB |
Output is correct |
11 |
Correct |
14 ms |
332 KB |
Output is correct |
12 |
Correct |
11 ms |
332 KB |
Output is correct |
13 |
Correct |
15 ms |
332 KB |
Output is correct |
14 |
Correct |
14 ms |
332 KB |
Output is correct |
15 |
Correct |
14 ms |
336 KB |
Output is correct |
16 |
Correct |
14 ms |
332 KB |
Output is correct |
17 |
Correct |
14 ms |
332 KB |
Output is correct |
18 |
Correct |
11 ms |
332 KB |
Output is correct |
19 |
Execution timed out |
3070 ms |
1724 KB |
Time limit exceeded |
20 |
Halted |
0 ms |
0 KB |
- |