#include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const int maxn = 1e6 + 5;
int n, q;
int S[maxn], T[maxn];
int brute(int x, int y, int z) {
int res = 0;
for (int i=0; i<n; i++) {
if (S[i]>=x && T[i]>=y && S[i]+T[i]>=z) {
res++;
}
}
return res;
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin>>n>>q;
for (int i=0; i<n; i++) {
cin>>S[i]>>T[i];
}
for (int i=0; i<q; i++) {
int x,y,z;
cin>>x>>y>>z;
cout<<brute(x,y,z)<<"\n";
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
Output is correct |
2 |
Correct |
0 ms |
384 KB |
Output is correct |
3 |
Correct |
1 ms |
384 KB |
Output is correct |
4 |
Correct |
0 ms |
384 KB |
Output is correct |
5 |
Correct |
1 ms |
384 KB |
Output is correct |
6 |
Correct |
0 ms |
384 KB |
Output is correct |
7 |
Correct |
48 ms |
512 KB |
Output is correct |
8 |
Correct |
48 ms |
512 KB |
Output is correct |
9 |
Correct |
48 ms |
512 KB |
Output is correct |
10 |
Correct |
47 ms |
512 KB |
Output is correct |
11 |
Correct |
48 ms |
512 KB |
Output is correct |
12 |
Correct |
47 ms |
384 KB |
Output is correct |
13 |
Correct |
47 ms |
556 KB |
Output is correct |
14 |
Correct |
50 ms |
684 KB |
Output is correct |
15 |
Correct |
47 ms |
512 KB |
Output is correct |
16 |
Correct |
24 ms |
512 KB |
Output is correct |
17 |
Correct |
34 ms |
512 KB |
Output is correct |
18 |
Correct |
11 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3077 ms |
2728 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3077 ms |
2728 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
Output is correct |
2 |
Correct |
0 ms |
384 KB |
Output is correct |
3 |
Correct |
1 ms |
384 KB |
Output is correct |
4 |
Correct |
0 ms |
384 KB |
Output is correct |
5 |
Correct |
1 ms |
384 KB |
Output is correct |
6 |
Correct |
0 ms |
384 KB |
Output is correct |
7 |
Correct |
48 ms |
512 KB |
Output is correct |
8 |
Correct |
48 ms |
512 KB |
Output is correct |
9 |
Correct |
48 ms |
512 KB |
Output is correct |
10 |
Correct |
47 ms |
512 KB |
Output is correct |
11 |
Correct |
48 ms |
512 KB |
Output is correct |
12 |
Correct |
47 ms |
384 KB |
Output is correct |
13 |
Correct |
47 ms |
556 KB |
Output is correct |
14 |
Correct |
50 ms |
684 KB |
Output is correct |
15 |
Correct |
47 ms |
512 KB |
Output is correct |
16 |
Correct |
24 ms |
512 KB |
Output is correct |
17 |
Correct |
34 ms |
512 KB |
Output is correct |
18 |
Correct |
11 ms |
384 KB |
Output is correct |
19 |
Execution timed out |
3077 ms |
2728 KB |
Time limit exceeded |
20 |
Halted |
0 ms |
0 KB |
- |