Submission #1200818

#TimeUsernameProblemLanguageResultExecution timeMemory
1200818GoBananas69Examination (JOI19_examination)C++20
2 / 100
3091 ms2104 KiB
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;

int main() {
    cin.tie(0) -> sync_with_stdio(0);
    ll n, q;
    cin >> n >> q;
    vector<ll> s(n), t(n);
    for (ll i = 0; i<n; ++i) {
        cin >> s[i] >> t[i];
    }
    while (q--) {
        ll x, y, sum;
        cin >> x >> y >> sum;
        sum = max(sum, x + y);
        
            ll a = 0, b = 0;
            for (ll i = 0; i<n; ++i) {
                if (s[i] >= x && s[i] + t[i] >= sum) {
                    ++a;
                }
                if (t[i] < y && s[i] + t[i] >= sum) {
                    ++b;
                }
            }
            cout << a - b << '\n';
        
    }
} 
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...