#include <bits/stdc++.h>
using namespace std;
int a[100000], b[100000];
int n, q;
int c, x, y, z;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n >> q;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
for (int t = 0; t < q; t++) {
cin >> x >> y >> z;
c = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= x && b[i] >= y && a[i]+b[i] >= z) {
c++;
}
}
cout << c << "\n";
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 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 |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
52 ms |
488 KB |
Output is correct |
8 |
Correct |
51 ms |
460 KB |
Output is correct |
9 |
Correct |
52 ms |
460 KB |
Output is correct |
10 |
Correct |
53 ms |
444 KB |
Output is correct |
11 |
Correct |
54 ms |
444 KB |
Output is correct |
12 |
Correct |
53 ms |
380 KB |
Output is correct |
13 |
Correct |
49 ms |
460 KB |
Output is correct |
14 |
Correct |
49 ms |
472 KB |
Output is correct |
15 |
Correct |
48 ms |
456 KB |
Output is correct |
16 |
Correct |
27 ms |
336 KB |
Output is correct |
17 |
Correct |
41 ms |
460 KB |
Output is correct |
18 |
Correct |
14 ms |
376 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
3029 ms |
2504 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
3029 ms |
2504 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 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 |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
52 ms |
488 KB |
Output is correct |
8 |
Correct |
51 ms |
460 KB |
Output is correct |
9 |
Correct |
52 ms |
460 KB |
Output is correct |
10 |
Correct |
53 ms |
444 KB |
Output is correct |
11 |
Correct |
54 ms |
444 KB |
Output is correct |
12 |
Correct |
53 ms |
380 KB |
Output is correct |
13 |
Correct |
49 ms |
460 KB |
Output is correct |
14 |
Correct |
49 ms |
472 KB |
Output is correct |
15 |
Correct |
48 ms |
456 KB |
Output is correct |
16 |
Correct |
27 ms |
336 KB |
Output is correct |
17 |
Correct |
41 ms |
460 KB |
Output is correct |
18 |
Correct |
14 ms |
376 KB |
Output is correct |
19 |
Execution timed out |
3029 ms |
2504 KB |
Time limit exceeded |
20 |
Halted |
0 ms |
0 KB |
- |