Submission #845188

#	Time	Username	Problem	Language	Result	Execution time	Memory
845188		samekkk	Trampoline (info1cup20_trampoline)	C++14	0 / 100	56 ms	51024 KiB

trampoline

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a,b) for (int a = 0; a < (b); ++a)
#define pb push_back
#define all(t) t.begin(), t.end()

struct Pole
{
    int y=-1,x=-1;
};

const int max_W = 2505;
int wysokosc = 0, szerokosc = 0, n = 0, y = 0, x = 0, q = 0, y_1 = 0, y_2 = 0, x_1 = 0, x_2 = 0;
int A[max_W][max_W];
Pole nextt[max_W][max_W];

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

    cin >> wysokosc >> szerokosc >> n;
    rep(i,n)
    {
        cin >> y >> x;
        --y, --x;
        A[y][x] = 1;
    }
    cin >> q;
    while(q--)
    {
        cin >> y_1 >> x_1 >> y_2 >> x_2;
        --y_1, --y_2, --x_1, --x_2;
        if (y_1 == y_2)
        {
            cout << "Yes" << '\n';
        }
        if (y_1 > y_2 or x_1 > x_2)
        {
            cout << "No" << '\n';
            continue;
        }
        bool czy_OK = false;
        while(y_1 <= y_2 and x_1 <= x_2)
        {
            if (y_1 == y_2 and x_1 <= x_2) czy_OK = true;
            if (A[y_1][x_1] == 0) ++x_1;
            else ++y_1;
        }
        if (czy_OK) cout << "Yes" << '\n';
        else cout << "No" << '\n';
    }
    return 0;
}

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