#include <bits/stdc++.h>
using namespace std;
pair<int,int> wej[100003];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n,q,a,b,c;
cin >> n >> q;
for (int i = 1; i<=n; i++)cin >> wej[i].first >> wej[i].second;
for (int i = 1; i<=q; i++){
cin >> a >> b >> c;
int odp=0;
for (int j = 1; j<=n; j++)if (wej[j].first>=a && wej[j].second>=b && wej[j].first+wej[j].second>=c)odp++;
cout << odp << '\n';
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
34 ms |
640 KB |
Output is correct |
8 |
Correct |
33 ms |
604 KB |
Output is correct |
9 |
Correct |
34 ms |
604 KB |
Output is correct |
10 |
Correct |
33 ms |
348 KB |
Output is correct |
11 |
Correct |
33 ms |
344 KB |
Output is correct |
12 |
Correct |
33 ms |
348 KB |
Output is correct |
13 |
Correct |
33 ms |
604 KB |
Output is correct |
14 |
Correct |
33 ms |
604 KB |
Output is correct |
15 |
Correct |
34 ms |
604 KB |
Output is correct |
16 |
Correct |
18 ms |
560 KB |
Output is correct |
17 |
Correct |
23 ms |
344 KB |
Output is correct |
18 |
Correct |
10 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
3076 ms |
2616 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
3076 ms |
2616 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
34 ms |
640 KB |
Output is correct |
8 |
Correct |
33 ms |
604 KB |
Output is correct |
9 |
Correct |
34 ms |
604 KB |
Output is correct |
10 |
Correct |
33 ms |
348 KB |
Output is correct |
11 |
Correct |
33 ms |
344 KB |
Output is correct |
12 |
Correct |
33 ms |
348 KB |
Output is correct |
13 |
Correct |
33 ms |
604 KB |
Output is correct |
14 |
Correct |
33 ms |
604 KB |
Output is correct |
15 |
Correct |
34 ms |
604 KB |
Output is correct |
16 |
Correct |
18 ms |
560 KB |
Output is correct |
17 |
Correct |
23 ms |
344 KB |
Output is correct |
18 |
Correct |
10 ms |
344 KB |
Output is correct |
19 |
Execution timed out |
3076 ms |
2616 KB |
Time limit exceeded |
20 |
Halted |
0 ms |
0 KB |
- |