Submission #926046

#TimeUsernameProblemLanguageResultExecution timeMemory
926046Erfan1386YExamination (JOI19_examination)C++17
100 / 100
1619 ms6864 KiB
#include <bits/stdc++.h> #pragma GCC target ("avx2") #pragma GCC optimize ("O3") #pragma GCC optimize ("unroll-loops") #define file_io freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout); #define fast_io ios::sync_with_stdio(false);cin.tie(0); #define what(x) cerr << #x << " is " << x << '\n'; #define kill(x) {cout << x << '\n'; continue;} #define all(x) (x).begin(), (x).end() #define pii pair<int, int> #define pb push_back #define ll long long #define F first #define S second const ll inf = 1e18, mod = 1e9 + 7, delta = 1e9 + 9, SQ = 450, P = 6065621; using namespace std; const ll N = 1e5 + 10, LG = 20; int s[N], t[N]; int main() { fast_io; int n, q; cin >> n >> q; for (int i = 1; i <= n; i++) cin >> s[i] >> t[i]; while (q--) { int ans = 0, x, y, z; cin >> x >> y >> z; for (int i = 1; i <= n; i++) ans += (s[i] >= x && t[i] >= y && s[i] + t[i] >= z); cout << ans << '\n'; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...