Submission #1145175

#	Time	Username	Problem	Language	Result	Execution time	Memory
1145175		dobri_oke	Trampoline (info1cup20_trampoline)	C++20	43 / 100	79 ms	29512 KiB

trampoline

//#pragma GCC target ("avx2")   
//#pragma GCC optimize ("Ofast")   
#include <bits/stdc++.h>   
using namespace std;  
#define int long long  
#define F first 
#define S second 
#define pb push_back 
const int N = 1e6, NN=26;
const int mod=1e9+7;
vector <int > v[N];
//int gcd(int a, int b) { if (b == 0) return a; else return gcd(b, a % b); }
//int lcm(int a, int b) { return a / gcd(a, b) * b; }
//int binpow(int a,int b){if(!b)return 1; if(b&1)return a*binpow(a,b-1)%mod; int x=binpow(a,b/2); return x*x%mod;}
signed main(){   
    ios_base::sync_with_stdio(0);   
    cin.tie(0);   
    cout.tie(0);
    int r, c, n;
    cin >> r >> c >> n;
    set < int > st;
    pair < int, int > a[n+1];
    for(int i=1;i<=n;i++){
        cin >> a[i].F >> a[i].S;
    }
    sort(a+1, a+n+1);
    for(int i=1;i<=n;i++){
        v[a[i].F].pb(a[i].S);
    }
    int t;
    cin >> t;
    while(t--){
        int xs, ys, xe, ye;
        cin >> xs >> ys >> xe >> ye;
        while(xs<xe){
            if(ys>ye) break;
            int l=0, r=v[xs].size()-1, jump=-1;
            while(l<=r){
                int m=(l+r)/2;
                if(v[xs][m]<ys){
                    l=m+1;
                }
                else{
                    r=m-1;
                    jump=m;
                }
            }
            if(jump==-1) break;
            else{
                ys=v[xs][jump];
                xs++;
            }
        }
        if(xs==xe && ys<=ye) cout << "Yes\n";
        else cout << "No\n";
    }
}

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