Submission #921044

#	Time	Username	Problem	Language	Result	Execution time	Memory
921044		gelastropod	Trampoline (info1cup20_trampoline)	C++14	73 / 100	2023 ms	20868 KiB

trampoline

#include <bits/stdc++.h>
using namespace std;
#define int long long

signed main()
{
    int R, C, N, a, b, prev = -1, val = -1, T, c, d, tem;
    cin >> R >> C >> N;
    set<int> finding;
    map<int, set<int>> green;
    set<pair<int, int>> queued;
    bool done = false;
    for (int i = 0; i < N; i++)
    {
        cin >> a >> b;
        a--, b--;
        green[a].insert(b);
        finding.insert(a);
    }
    cin >> T;
    for (int i = 0; i < T; i++)
    {
        done = false;
        cin >> a >> b >> c >> d;
        a--, b--, c--, d--;
        tem = b;
        b = a;
        a = tem;
        tem = d;
        d = c;
        c = tem;
        if (a > c || b > d)
        {
            cout << "No\n";
            continue;
        }
        while (b != d && a <= c)
        {
            if (finding.lower_bound(b) == finding.end() || *finding.lower_bound(b) != b)
            {
                cout << "No\n";
                done = true;
                break;
            }
            if (green[b].lower_bound(a) == green[b].end())
            {
                cout << "No\n";
                done = true;
                break;
            }
            a = *green[b].lower_bound(a);
            b++;
        }
        if (done)
            continue;
        if (a > c)
            cout << "No\n";
        else
            cout << "Yes\n";
    }
}

Compilation message (stderr)

trampoline.cpp: In function 'int main()':
trampoline.cpp:7:24: warning: unused variable 'prev' [-Wunused-variable]
    7 |     int R, C, N, a, b, prev = -1, val = -1, T, c, d, tem;
      |                        ^~~~
trampoline.cpp:7:35: warning: unused variable 'val' [-Wunused-variable]
    7 |     int R, C, N, a, b, prev = -1, val = -1, T, c, d, tem;
      |                                   ^~~

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