| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1329381 | lunarecho | Examination (JOI19_examination) | C++20 | 3094 ms | 1232 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, q;
cin>>n>>q;
vector<pair<int, int>> p(n);
for(auto &i : p) {
cin>>i.F>>i.S;
}
while(q--) {
int x, y, z;
cin>>x>>y>>z;
int ans = 0;
for(int i=0;i<n;++i) {
if(p[i].F >= x && p[i].S >= y && p[i].F + p[i].S <= z) {
++ans;
}
}
cout<<ans<<'\n';
}
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
