Submission #914747

#	Time	Username	Problem	Language	Result	Execution time	Memory
914747		NValchanov	Trampoline (info1cup20_trampoline)	C++17	43 / 100	64 ms	14392 KiB

trampoline

#include<bits/stdc++.h>

#define endl '\n'
#define x first
#define y second
using namespace std;

typedef long long ll;

const ll MAXN=2e5+10;
const ll MAXR=1e9+10;
const ll MAXC=1e9+10;
const ll MAXT=2e5+10;

ll r,c,n,t;
bool a[3000][3000];
vector<pair<ll,ll>>v;

bool check(ll x1,ll y1,ll x2,ll y2)
{
    return x1<=x2&&y1<=y2;
}

void query(ll x1,ll y1,ll x2,ll y2)
{
    if(!check(x1,y1,x2,y2))
    {
        cout<<"No"<<endl;
        return;
    }
    ll x=x1,y=y1;
    while(x<=r&&y<=c)
    {
        if(x==x2&&y==y2)
        {
            cout<<"Yes"<<endl;
            return;
        }
        if(a[x][y]&&x<x2)
            x++;
        else
            y++;
    }
    cout<<"No"<<endl;
}

bool check_k(ll k,ll x1,ll y1)
{
    pair<ll,ll>cur=v[k];
    return cur.x>x1 || (cur.x==x1&&cur.y>=y1);
}

void special_query(ll x1,ll y1,ll x2,ll y2)
{
    if(!check(x1,y1,x2,y2))
    {
        cout<<"No"<<endl;
        return;
    }
    ll left=-1,right=v.size(),mid;
    while(right-left>1)
    {
        mid=left+(right-left)/2;
        if(check_k(mid,x1,y1))
            right=mid;
        else
            left=mid;
    }
    ///cout<<right<<endl;
    if(right<n&&check_k(right,x1,y1)&&v[right].x+1==x2&&v[right].y<=y2)
        cout<<"Yes"<<endl;
    else
        cout<<"No"<<endl;
}

void read()
{
    cin>>r>>c>>n;
    for(ll i=1;i<=n;i++)
    {
        ll x,y;
        cin>>x>>y;
        a[x][y]=true;
        v.push_back(make_pair(x,y));
    }
    cin>>t;
    sort(v.begin(),v.end());
    for(ll i=1;i<=t;i++)
    {
        ll x1,y1,x2,y2;
        cin>>x1>>y1>>x2>>y2;
        if(x1+1==x2)
            special_query(x1,y1,x2,y2);
        else
            query(x1,y1,x2,y2);
    }
}

int main()
{
    #ifdef ONLINE_JUDGE
    freopen(".in", "r", stdin);
    freopen(".out", "w", stdout);
#endif
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);

    read();

	return 0;
}
/*
4 5 2
2 2
3 4
4
2 1 4 5
1 2 1 4
2 3 3 4
2 1 3 4
*/

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