Submission #1302853

#	Time	Username	Problem	Language	Result	Execution time	Memory
1302853		yusifm	Trampoline (info1cup20_trampoline)	C++20	0 / 100	385 ms	23488 KiB

trampoline

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define str string
#define pb push_back
#define pf push_front
#define in insert
#define all(v) v.begin(),v.end()
#define fastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
const int sz=1000000,INF=1000000000;
using namespace std;
void solve()
{
    ll n,m,l,p,num1,num2,Num1,Num2,Num3,Num4;
    cin>>n>>m>>l;
    map<ll,vector<ll>>nums;
    map<pair<ll,ll>,bool>isSeen;
    for(int i=0;i<l;i++)
    {
        cin>>num1>>num2;
        if(!isSeen[{num1,num2}])
        {
            nums[num1].pb(num2);
        }
        isSeen[{num1,num2}]=true;
    }
    for(auto Nums:nums)
    {
        sort(all(Nums.second));
    }
    cin>>p;
    for(int i=0;i<p;i++)
    {
        cin>>Num1>>Num2>>Num3>>Num4;
        auto it=lower_bound(all(nums[Num1]),Num2);
        if(it!=nums[Num1].end() && *it<=Num4)
        {
            cout<<"Yes\n";
        }
        else
        {
            cout<<"No\n";
        }
    }
}
int main()
{
    fastIO;
    ll t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
}

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