//♥God will make a way♥
//#include <bits/stdc++.h>
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
#include <set>
#include <map>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stdio.h>
#include <climits>
#include <numeric>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//template <typename T>
//using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/////////////////////define/////////////////////
#define ci(x) if(x) cout << "Yes" << '\n'; else cout << "No" << '\n';
#define cii(x) if(check(x))
#define MOD 1000000007
#define MOD2 998244353
#define oo 1e9
#define ool 1e18L
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mii map<int, int>
#define vi vector<int>
#define vpi vector<pair<int, int>>
#define vll vector <ll>
#define ff first
#define ss second
#define mp make_pair
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define sz(x) (int((x).size()))
#define all(x) (x).begin(), (x).end()
#define alll(x) (x), (x) + n
#define clr(x) (x).clear();
#define fri(x) for(int i = 0; i < x; ++i)
#define frj(x) for(int j = 0; j < x; ++j)
#define frp(x) for(int p = 0; p < x; ++p)
#define frr(a, b) for(int i = a; i < b; ++i)
#define frrj(a, b) for(int j = a; j < b; ++j)
#define fra(x) for(int i = 0; i < x; ++i) cin >> a[i];
#define frb(x) for(int i = 0; i < x; ++i) cin >> b[i];
#define frs(x) for(auto it = x.begin(); it != x.end(); ++it)
#define fr(x) for(auto it : x) //el
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define dbg(x) cerr << #x << ": " << x << endl;
#define ce(x) cout << x << endl;
#define uniq(x) x.resize(unique(all(x)) - x.begin()); //make all one after sorting
#define blt __builtin_popcount
/////////////////////print array, vector, deque, set, multiset, pair, map /////////////////////
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]"; cout << endl;}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(stack <T> v) {cerr << "[ "; stack<T> s = v; while(s.size()) {T i = s.top(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(queue <T> v) {cerr << "[ "; queue<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(deque <T> v) {cerr << "[ "; deque<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop_front(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
/////////////////////code/////////////////////
pii a[200005];
map<int, vi> ma;
int n;
int nxt[200005][19];
map<int, int> id[200005];
int hajord(int i, int k) {
frj(19) {
if(k & (1 << j))
i = nxt[i][j];
}
return i;
}
int id_(int x, int y) {
pii p = {x, y};
auto it = lb(a, a + n + 1, p) - a;
return it;
}
int main() {
fastio;
int r, c, x, y, x1, y1, t;
cin >> r >> c >> n;
frr(1, 1 + n) cin >> a[i].ff >> a[i].ss;
sort(a, a + n + 1);
frr(1, 1 + n) {
ma[a[i].ff].pb(a[i].ss);
id[a[i].ff][a[i].ss] = i;
}
frr(1, 1 + n) {
auto it = lb(all(ma[a[i].ff+1]), a[i].ss);
if(it != ma[a[i].ff+1].end()) {
nxt[i][0] = id_(a[i].ff+1,*it);
} else nxt[i][0] = 0;
}
for(int j = 1; j <= 18; j++)
frr(1, 1 + n)
nxt[i][j] = nxt[nxt[i][j-1]][j-1];
cin >> t;
while(t--) {
cin >> x >> y >> x1 >> y1;
if(x > x1 || y > y1) {
ci(0);
} else if(x1 - x > n+1) {
ci(0);
} else if(x1 == x) {
ci(1);
} else {
int dif = x1 - x - 1;
auto it = lb(all(ma[x]), y);
if(it != ma[x].end()) {
y = *it;
int id1 = id_(x,y), id2 = hajord(id1, dif);
if(id2) {
ci(a[id2].ss <= y1);
} else {
ci(0);
}
} else {
ci(0);
}
}
}
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
8 ms |
10836 KB |
200 token(s): yes count is 21, no count is 179 |
| 2 |
Correct |
8 ms |
11092 KB |
200 token(s): yes count is 70, no count is 130 |
| 3 |
Correct |
10 ms |
10660 KB |
197 token(s): yes count is 25, no count is 172 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
109 ms |
36924 KB |
4000 token(s): yes count is 99, no count is 3901 |
| 2 |
Correct |
130 ms |
36940 KB |
4000 token(s): yes count is 91, no count is 3909 |
| 3 |
Correct |
102 ms |
36588 KB |
4000 token(s): yes count is 4000, no count is 0 |
| 4 |
Correct |
107 ms |
36976 KB |
4000 token(s): yes count is 1991, no count is 2009 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
59 ms |
22584 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
15 ms |
19564 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
59 ms |
22672 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
