oj.uz

답안 #525249

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
525249 2022-02-11T07:40:20 Z Khizri Trampoline (info1cup20_trampoline) C++17
73 / 100
 498 ms 27664 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;
set<int>st[mxn];
map<int,set<int>>mp;
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=mp[a].lower_bound(b);
    if(it==mp[a].end()) return false;
    b=*it;
    return dfs(a+1,b,x,y);
}
void solve2(){
    while(q--){
        int a,b,x,y;
        cin>>a>>b>>x>>y;
        auto it=mp[a].lower_bound(b);
        if(it==mp[a].end()){
            cout<<"No"<<endl;
            continue;
        }
        if(*it<=y){
            cout<<"Yes"<<endl;
        }
        else{
            cout<<"No"<<endl;
        }
    }
}
void solve(){
    cin>>n>>m>>k;
    for(int i=1;i<=k;i++){
        int a,b;
        cin>>a>>b;
        mp[a].insert(b);
    }
    cin>>q;
    if(n<=2500&&m<=2500||(k<=5000&&q<=5000)){

    }
    else{
        solve2();
        return;
    }
    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;
}

Compilation message

trampoline.cpp: In function 'void solve()':
trampoline.cpp:88:15: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   88 |     if(n<=2500&&m<=2500||(k<=5000&&q<=5000)){
      |        ~~~~~~~^~~~~~~~~

Subtask #1
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 10060 KB 200 token(s): yes count is 21, no count is 179
2 Correct 9 ms 10188 KB 200 token(s): yes count is 70, no count is 130
3 Correct 11 ms 10060 KB 197 token(s): yes count is 25, no count is 172

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 160 ms 19656 KB 4000 token(s): yes count is 99, no count is 3901
2 Correct 152 ms 19568 KB 4000 token(s): yes count is 91, no count is 3909
3 Correct 476 ms 19172 KB 4000 token(s): yes count is 4000, no count is 0
4 Correct 498 ms 19540 KB 4000 token(s): yes count is 1991, no count is 2009

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 308 ms 20020 KB 200000 token(s): yes count is 110486, no count is 89514
2 Correct 346 ms 19684 KB 200000 token(s): yes count is 114664, no count is 85336
3 Correct 339 ms 19780 KB 200000 token(s): yes count is 86232, no count is 113768
4 Correct 296 ms 20280 KB 200000 token(s): yes count is 94603, no count is 105397
5 Correct 311 ms 20352 KB 200000 token(s): yes count is 94148, no count is 105852
6 Correct 360 ms 26048 KB 200000 token(s): yes count is 97163, no count is 102837

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 9956 KB 5000 token(s): yes count is 3238, no count is 1762
2 Correct 15 ms 10108 KB 5000 token(s): yes count is 3837, no count is 1163
3 Correct 11 ms 10664 KB 5000 token(s): yes count is 4104, no count is 896
4 Correct 10 ms 9932 KB 5000 token(s): yes count is 3934, no count is 1066
5 Correct 217 ms 10240 KB 5000 token(s): yes count is 3384, no count is 1616
6 Correct 10 ms 10036 KB 5000 token(s): yes count is 3390, no count is 1610

Subtask #5
0 / 27.0

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