Submission #1144984

#	Time	Username	Problem	Language	Result	Execution time	Memory
1144984		dobri_oke	Trampoline (info1cup20_trampoline)	C++20	43 / 100	493 ms	1114112 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;
//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;
    int p[r+1][c+1]{};
    for(int i=1;i<=n;i++){
        int a, b;
        cin >> a >> b;
        p[a][b]=1;
    }
    int t;
    cin >> t;
    while(t--){
        int xs, ys, xe, ye;
        cin >> xs >> ys >> xe >> ye;
        while(xs<xe || ys<ye){
            if(xs>xe || ys>ye) break;
            if(p[xs][ys]==0){
                ys++;
            }
            else{
                if(xs<xe) xs++;
                else ys++;
            }
        }
        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