#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#define YMAX 1e9 + 1
#define NMAX 200000 //doua sute cincizeci de mii
#define LOG_LOWERBOUND 17 //e pt NMAX
using namespace std;
ifstream fin ("test.in");
ofstream fout ("test.out");
int R, C, N, T;
pair <int, int> s[NMAX + 1];
int t[LOG_LOWERBOUND + 1][NMAX + 1];
int log2(int VAL){ ///LOWERBOUND
int lo = -1;
int hi = 29 + 1;
int rsp;
while(hi - lo > 1){
int mid = lo + (hi - lo) / 2;
if( (1 << mid) <= VAL ){
rsp = mid;
lo = mid;
}
else {
hi = mid;
}
}
return rsp;
}
int cautareBinara(int x, int y){
/*
Imi returneaza, din lista de trambuline verzi, numarul celei de pe linia x, cu lowerboundul ei = y
daca nu exista niciunul pe linia x, returneaza 0
*/
int lo = 0;
int hi = N + 1;
int ans = 0;
while(hi - lo > 1){
int mid = lo + (hi - lo) / 2;
if(s[mid].first > x){
hi = mid;
}
else if(s[mid].first < x){
lo = mid;
}
else if(s[mid].second < y){
lo = mid;
}
else {
ans = mid;
hi = mid;
}
}
return ans;
}
int stramos(int node, int nr){
if(nr == 0){
return s[node].second;
}
for(int i = log2(nr); i >= 0; i--){
if( (1 << i) <= nr ){
node = t[i][node];
nr -= (1 << i);
}
}
///daca node ajunge sa fie 0, inseamna ca nu exista al nr-lea stramos al lui node
///dar la mine trebuie sa existe ca sa zic 'Yes', ca altfel inseamna ca nu am destule trambuline pe drum
///adica inseamna ca nu am trambuline de la (xs, xf) destule
///si atunci vreau sa returnez ceva care sa ma faca sa afisez 'No', adica returnez un 'y' f mare, pentru ca eu urmeaza sa il compar cu yf
if(node == 0){
return YMAX + 1;
}
return s[node].second; ///returneaza 'y'-ul celui de-al 'nr'-ulea stramos al lui 'node'
}
int main()
{
ios_base::sync_with_stdio(NULL);
cin.tie(0);
cout.tie(0);
cin >> R >> C >> N; ///globale
for(int i = 1; i <= N; i++){
cin >> s[i].first >> s[i].second;
}
sort(s + 1, s + N + 1);
for(int i = 1; i <= N; i++){
int aux = cautareBinara(s[i].first + 1, s[i].second);
t[0][i] = aux;
}
for(int i = 1; i <= log2(N); i++){
for(int j = 1; j <= N; j++){
t[i][j] = t[i - 1][ t[i - 1][j] ];
}
}
cin >> T; ///global
for(int Q = 1; Q <= T; Q++){
int xs, ys, xf, yf;
cin >> xs >> ys >> xf >> yf;
if(xf == xs){ ///caz special ca altfel am niste valori cu -1 si nu are sens
if(ys <= yf){
cout << "Yes\n";
}
else {
cout << "No\n";
}
}
else if(xs > xf || ys > yf){
cout << "No\n";
}
else {
int st = cautareBinara(xs, ys); ///caut cel mai din stanga valid de pe linia 'xs'
if(st == 0){
cout << "No\n";
}
else if( stramos(st, xf - 1 - xs) <= yf ){ ///verific al 'xf - 1 - xs'-lea stramos al acestuia si verific daca e mai mic ca 'yf'
cout << "Yes\n";
}
else {
cout << "No\n";
}
}
}
return 0;
}
Compilation message
trampoline.cpp: In function 'int log2(int)':
trampoline.cpp:36:12: warning: 'rsp' may be used uninitialized in this function [-Wmaybe-uninitialized]
36 | return rsp;
| ^~~
trampoline.cpp: In function 'int stramos(int, int)':
trampoline.cpp:77:18: warning: 'rsp' may be used uninitialized in this function [-Wmaybe-uninitialized]
77 | node = t[i][node];
| ~~~~~^~~~~~~~~~~~
trampoline.cpp: In function 'int main()':
trampoline.cpp:111:22: warning: 'rsp' may be used uninitialized in this function [-Wmaybe-uninitialized]
111 | for(int i = 1; i <= log2(N); i++){
| ~~^~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
844 KB |
200 token(s): yes count is 21, no count is 179 |
| 2 |
Correct |
3 ms |
936 KB |
200 token(s): yes count is 70, no count is 130 |
| 3 |
Correct |
2 ms |
716 KB |
197 token(s): yes count is 25, no count is 172 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
67 ms |
15884 KB |
4000 token(s): yes count is 99, no count is 3901 |
| 2 |
Correct |
63 ms |
15956 KB |
4000 token(s): yes count is 91, no count is 3909 |
| 3 |
Correct |
63 ms |
15956 KB |
4000 token(s): yes count is 4000, no count is 0 |
| 4 |
Correct |
67 ms |
15940 KB |
4000 token(s): yes count is 1991, no count is 2009 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
165 ms |
16608 KB |
200000 token(s): yes count is 110486, no count is 89514 |
| 2 |
Correct |
173 ms |
16564 KB |
200000 token(s): yes count is 114664, no count is 85336 |
| 3 |
Correct |
166 ms |
16568 KB |
200000 token(s): yes count is 86232, no count is 113768 |
| 4 |
Correct |
173 ms |
16580 KB |
200000 token(s): yes count is 94603, no count is 105397 |
| 5 |
Correct |
179 ms |
16784 KB |
200000 token(s): yes count is 94148, no count is 105852 |
| 6 |
Correct |
174 ms |
16624 KB |
200000 token(s): yes count is 97163, no count is 102837 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
716 KB |
5000 token(s): yes count is 3238, no count is 1762 |
| 2 |
Correct |
4 ms |
732 KB |
5000 token(s): yes count is 3837, no count is 1163 |
| 3 |
Runtime error |
3 ms |
1228 KB |
Execution killed with signal 11 |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
255 ms |
16744 KB |
200000 token(s): yes count is 171404, no count is 28596 |
| 2 |
Correct |
243 ms |
16708 KB |
200000 token(s): yes count is 161254, no count is 38746 |
| 3 |
Runtime error |
87 ms |
32136 KB |
Execution killed with signal 11 |
| 4 |
Halted |
0 ms |
0 KB |
- |
