/**
* بسم الله الرحمن الرحيم *
﴾ رَبِّ اشْرَحْ لِي صَدْرِي * وَيَسِّرْ لِي أَمْرِي * وَاحْلُلْ عُقْدَةً مِّن لِّسَانِي * يَفْقَهُوا قَوْلِي ﴿
*/
/// author : "ASGA"
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int n,q,x,y,z,ans;
cin >> n >> q;
vector <pair <int,int>> a(n);
for(int i = 0;i < n;i++)cin >> a[i].first >> a[i].second;
while(q--){
cin >> x >> y >> z;
ans = 0;
for(const auto& [i,j] : a)ans += (x <= i && y <= j && z <= i + j);
cout << ans << '\n';
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
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 |
0 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 |
32 ms |
348 KB |
Output is correct |
8 |
Correct |
28 ms |
348 KB |
Output is correct |
9 |
Correct |
29 ms |
348 KB |
Output is correct |
10 |
Correct |
28 ms |
348 KB |
Output is correct |
11 |
Correct |
28 ms |
492 KB |
Output is correct |
12 |
Correct |
29 ms |
348 KB |
Output is correct |
13 |
Correct |
28 ms |
348 KB |
Output is correct |
14 |
Correct |
28 ms |
480 KB |
Output is correct |
15 |
Correct |
29 ms |
348 KB |
Output is correct |
16 |
Correct |
9 ms |
348 KB |
Output is correct |
17 |
Correct |
15 ms |
480 KB |
Output is correct |
18 |
Correct |
6 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
3074 ms |
1280 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
3074 ms |
1280 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 |
0 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 |
32 ms |
348 KB |
Output is correct |
8 |
Correct |
28 ms |
348 KB |
Output is correct |
9 |
Correct |
29 ms |
348 KB |
Output is correct |
10 |
Correct |
28 ms |
348 KB |
Output is correct |
11 |
Correct |
28 ms |
492 KB |
Output is correct |
12 |
Correct |
29 ms |
348 KB |
Output is correct |
13 |
Correct |
28 ms |
348 KB |
Output is correct |
14 |
Correct |
28 ms |
480 KB |
Output is correct |
15 |
Correct |
29 ms |
348 KB |
Output is correct |
16 |
Correct |
9 ms |
348 KB |
Output is correct |
17 |
Correct |
15 ms |
480 KB |
Output is correct |
18 |
Correct |
6 ms |
348 KB |
Output is correct |
19 |
Execution timed out |
3074 ms |
1280 KB |
Time limit exceeded |
20 |
Halted |
0 ms |
0 KB |
- |