Submission #1140411

#	Time	Username	Problem	Language	Result	Execution time	Memory
1140411		kirakosyan	Trampoline (info1cup20_trampoline)	C++20	0 / 100	2096 ms	24872 KiB

trampoline

#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<queue>
#include<map>
#include<set>
using namespace std;
using ll = long long;
ll mod = 998244353;
void solve()
{
    ll r, c, n; cin >> r >> c >> n;
    map <ll,set<ll>> mp;
    for (ll i = 0; i < n; i++) {
        ll a, b; cin >> a >> b;
        --a, --b;
        mp[a].insert(b);
    }
    ll q; cin >> q;
    while (q--) {
        ll x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        --x1, --x2, --y1, --y2;
        if (x1 > x2 || y1 > y2) {
            cout << "NO" << endl;
            continue;
        }
        int f = 0;
        while (x1 < x2) {
            auto ind = mp[x1].lower_bound(y1);
            if (ind == mp[x1].end()) {
                break;
            }
            else if (*ind <= y2) {
                cout << "YES" << endl;
            }
            else {
                break;

            }
            x1++;
        }
        if (x1 == x2) {
            cout << "YES" << endl;
        }
        else cout << "NO" << endl;
    }
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //signed _; cin >> _; while (_--)
    solve();
}

• Subtask 1: 0 / 23
• Subtask 2: 0 / 20
• Subtask 3: 0 / 11
• Subtask 4: 0 / 19
• Subtask 5: 0 / 27