#include <bits/stdc++.h>
#define pb push_back
#define pii pair<int, int>
#define MAX 1000000001
#define MOD 1000000007
#define INF 0x3F3F3F3F3F3F3F3F
#define OPT ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int main()
{
int n, q;
cin >> n >> q;
int math[n+1], info[n+1];
for(int i = 1; i<=n; i++)
cin >> math[i] >> info[i];
while(q--)
{
int a, b, c, k = 0;
cin >> a >> b >> c;
for(int i = 1; i<=n; i++)
{
if(math[i]>=a && info[i]>=b && math[i]+info[i]>=c)k++;
}
cout << k << endl;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
304 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
304 KB |
Output is correct |
7 |
Correct |
52 ms |
460 KB |
Output is correct |
8 |
Correct |
51 ms |
440 KB |
Output is correct |
9 |
Correct |
56 ms |
448 KB |
Output is correct |
10 |
Correct |
51 ms |
400 KB |
Output is correct |
11 |
Correct |
51 ms |
416 KB |
Output is correct |
12 |
Correct |
51 ms |
340 KB |
Output is correct |
13 |
Correct |
52 ms |
436 KB |
Output is correct |
14 |
Correct |
62 ms |
416 KB |
Output is correct |
15 |
Correct |
54 ms |
428 KB |
Output is correct |
16 |
Correct |
27 ms |
376 KB |
Output is correct |
17 |
Correct |
37 ms |
412 KB |
Output is correct |
18 |
Correct |
16 ms |
364 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3071 ms |
1308 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3071 ms |
1308 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
304 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
304 KB |
Output is correct |
7 |
Correct |
52 ms |
460 KB |
Output is correct |
8 |
Correct |
51 ms |
440 KB |
Output is correct |
9 |
Correct |
56 ms |
448 KB |
Output is correct |
10 |
Correct |
51 ms |
400 KB |
Output is correct |
11 |
Correct |
51 ms |
416 KB |
Output is correct |
12 |
Correct |
51 ms |
340 KB |
Output is correct |
13 |
Correct |
52 ms |
436 KB |
Output is correct |
14 |
Correct |
62 ms |
416 KB |
Output is correct |
15 |
Correct |
54 ms |
428 KB |
Output is correct |
16 |
Correct |
27 ms |
376 KB |
Output is correct |
17 |
Correct |
37 ms |
412 KB |
Output is correct |
18 |
Correct |
16 ms |
364 KB |
Output is correct |
19 |
Execution timed out |
3071 ms |
1308 KB |
Time limit exceeded |
20 |
Halted |
0 ms |
0 KB |
- |