oj.uz

답안 #514645

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
514645 2022-01-18T10:18:50 Z Theo830 Trampoline (info1cup20_trampoline) C++17
73 / 100
 2000 ms 31448 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ii,ll>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
int main(void){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll r,c;
    cin>>r>>c;
    map<ll,ll>mp;
    set<ll>ex;
    ll n;
    cin>>n;
    ll a[n],b[n];
    f(i,0,n){
        cin>>a[i]>>b[i];
        ex.insert(a[i]);
    }
    ll pos = 0;
    for(auto x:ex){
        mp[x] = pos;
        pos++;
    }
    set<ll> exo[(ll)ex.size() + 5];
    f(i,0,n){
        exo[mp[a[i]]].insert(b[i]);
    }
    ll t;
    cin>>t;
    while(t--){
        ll xa,ya,xb,yb;
        cin>>xa>>ya>>xb>>yb;
        bool ok = 1;
        if(xa > xb || ya > yb){
            ok = 0;
        }
        while(xa != xb){
            if(!ex.count(xa)){
                ok = 0;
                break;
            }
            auto it = exo[mp[xa]].lower_bound(ya);
            if(it != exo[mp[xa]].end() && (*it) <= yb){
                xa++;
                ya = (*it);
            }
            else{
                ok = 0;
                break;
            }
        }
        if(ok){
            cout<<"Yes\n";
        }
        else{
            cout<<"No\n";
        }
    }
}

Subtask #1
23.0 / 23.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 171 ms 13100 KB 4000 token(s): yes count is 99, no count is 3901
2 Correct 157 ms 13164 KB 4000 token(s): yes count is 91, no count is 3909
3 Correct 516 ms 12900 KB 4000 token(s): yes count is 4000, no count is 0
4 Correct 543 ms 13212 KB 4000 token(s): yes count is 1991, no count is 2009

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 256 ms 13476 KB 200000 token(s): yes count is 110486, no count is 89514
2 Correct 298 ms 13532 KB 200000 token(s): yes count is 114664, no count is 85336
3 Correct 269 ms 13616 KB 200000 token(s): yes count is 86232, no count is 113768
4 Correct 342 ms 13796 KB 200000 token(s): yes count is 94603, no count is 105397
5 Correct 459 ms 13800 KB 200000 token(s): yes count is 94148, no count is 105852
6 Correct 519 ms 31448 KB 200000 token(s): yes count is 97163, no count is 102837

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 588 KB 5000 token(s): yes count is 3238, no count is 1762
2 Correct 14 ms 588 KB 5000 token(s): yes count is 3837, no count is 1163
3 Correct 8 ms 1460 KB 5000 token(s): yes count is 4104, no count is 896
4 Correct 5 ms 588 KB 5000 token(s): yes count is 3934, no count is 1066
5 Correct 312 ms 872 KB 5000 token(s): yes count is 3384, no count is 1616
6 Correct 5 ms 588 KB 5000 token(s): yes count is 3390, no count is 1610

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2078 ms 25336 KB Time limit exceeded
2 Halted 0 ms 0 KB -