oj.uz

답안 #775785

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
775785 2023-07-07T00:20:08 Z HD1 Trampoline (info1cup20_trampoline) C++14
42 / 100
 83 ms 31744 KB 
//we are all lost trying to be someone.
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(0); cin.tie(0);
#define sz(x) ll(x.size())
#define reve(x) reverse(x.begin(),x.end())
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<double,ll> ii;
const ll MAX=(1e5+10);
const ll mod=1e9+7;
map<ii,ll>nod;
map<ll, vector<ll>> V;
ll x[MAX], y[MAX];
ll spt[30][MAX];
ll up(ll a, ll b){
    auto it = lower_bound( all(V[a]), b);
    if(it == V[a].end()) return 0;
    return nod[{a,*it}];
}
void solve(){
        ll n , m, k;
        cin >> n >> m >> k;

        for(ll i = 1; i <= k; i++){
            cin >> x[i] >> y[i];
            nod[ {x[i] , y[i] } ] =i;
            V[ x[i] ].push_back( y[i] );
        }

        for(auto &it : V)  sort( it.ss.begin(), it.ss.end());

        for(ll i = 1; i <= k; i++) spt[0][i] = up(x[i]+1 , y[i]);

        for(ll j = 1; j < 30; j++){
            for(ll i = 1; i <=k; i++){
                spt[j][i] = spt[j-1][spt[j-1][i]];
            }
        }
        ll x1, y1, x2, y2;
        ll t;
        cin >> t;
        while( t--){
            cin >> x1 >> y1 >> x2 >> y2;

            ll dist = x2 - x1;
            if(x1 > x2 || y1 > y2) cout << "No\n" ;
            else if(dist == 0)cout << "Yes\n";
            else{
                    ll u=up(x1,y1);
                    dist--;
                    for(ll i = 0; i < 30; i++){
                        if((dist >> i) & 1){
                           u = spt[i][u];
                        }
                    }
                    if(u != 0 && y[u] <= y2)
                            cout<<"Yes\n";
                    else
                            cout<<"No\n";

            }

        }
        return;
}
int main(){
    fastio;
    solve();
    return 0;
}

Subtask #1
23.0 / 23.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 11.0

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

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 2388 KB 5000 token(s): yes count is 3238, no count is 1762
2 Correct 7 ms 2388 KB 5000 token(s): yes count is 3837, no count is 1163
3 Correct 9 ms 3276 KB 5000 token(s): yes count is 4104, no count is 896
4 Correct 6 ms 2388 KB 5000 token(s): yes count is 3934, no count is 1066
5 Correct 9 ms 2516 KB 5000 token(s): yes count is 3384, no count is 1616
6 Correct 6 ms 2428 KB 5000 token(s): yes count is 3390, no count is 1610

Subtask #5
0 / 27.0

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