제출 #921038

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
921038		itslq	Trampoline (info1cup20_trampoline)	C++17	73 / 100	2067 ms	16244 KiB

trampoline

#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    bool can;
    int R, C, T, N, x, y, a, b;
    cin >> R >> C >> N;

    unordered_map<int, vector<int>> green;
    unordered_set<int> tosort;

    while (N--) {
        cin >> x >> y;
        green[x].push_back(y);
        tosort.insert(x);
    }

    for (int n: tosort) {
        sort(green[n].begin(), green[n].end());
    }

    cin >> T;

    while (T--) {
        can = 1;
        cin >> x >> y >> a >> b;

        if (a < x || b < y) {
            cout << "No\n";
            continue;
        }

        for (; x < a; x++) {
            if (green.find(x) == green.end()) {
                can = 0;
                cout << "No\n";
                break;
            }

            auto it = lower_bound(green[x].begin(), green[x].end(), y);
            if (it == green[x].end()) {
                can = 0;
                cout << "No\n";
                break;
            } else if ((y = *it) > b) {
                can = 0;
                cout << "No\n";
                break;
            }
        }

        if (can) {
            cout << "Yes\n";
        }
    }
}

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