oj.uz

답안 #525235

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
525235 2022-02-11T07:20:04 Z Khizri Trampoline (info1cup20_trampoline) C++17
0 / 100
 96 ms 9936 KB 
#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
    if(a>b) swap(a,b);
    if(a==0) return a+b;
    return gcd(b%a,a);
}
ll lcm(ll a,ll b){
    return a/gcd(a,b)*b;
}
bool is_prime(ll n){
    ll k=sqrt(n);

    if(n==2) return true;
    if(n<2||n%2==0||k*k==n) return false;
    for(int i=3;i<=k;i+=2){
        if(n%i==0){
            return false;
        }
    }
    return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=2e5+5;
int t=1,n,m,k,q;
vector<int>vt[mxn];
bool dfs(int a,int b,int x,int y){
    if(b>y||a>x) return false;
    if(a>n||b>m) return false;
    if(a==x){
        if(b<=y){
            return true;
        }
        else{
            return false;
        }
    }
    auto it=lower_bound(all(vt[a]),b);
    if(it==vt[a].end()) return false;
    b=*it;
    return dfs(a+1,b,x,y);
}
void solve(){
    cin>>n>>m>>k;
    for(int i=1;i<=k;i++){
        int a,b;
        cin>>a>>b;
        vt[a].pb(b);
    }
    cin>>q;
    while(q--){
        int a,b,x,y;
        cin>>a>>b>>x>>y;
        if(dfs(a,b,x,y)){
            cout<<"Yes"<<endl;
        }
        else{
            cout<<"No"<<endl;
        }
    }
}
int main(){
    //IOS;
    //cin>>t;
    while(t--){
        solve();
    }
    return 0;
}

Subtask #1
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 4940 KB expected YES, found NO [1st token]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 96 ms 6392 KB expected YES, found NO [3rd token]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 7 ms 9932 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 7 ms 9936 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 7 ms 9900 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -