#include <bits/stdc++.h>
using namespace std;
map<int, vector<int>> mp;
int xf, yf;
int yyy;
bool wae(int x, int y)
{
if(xf<x || yf<y)
{
//cout<<"1\n";
return 0;
}
else if(xf==x) return 1;
else
{
yyy=lower_bound(mp[x].begin(), mp[x].end(), y)-mp[x].begin();
if(yyy==mp[x].size())
{
//cout<<"2\n";
return false;
}
else return wae(x+1, mp[x][yyy]);
}
}
int main()
{
int r, c, n ,t;
cin>>r>>c>>n;
for(int i=0; i<n; i++)
{
int x, y;
cin>>x>>y;
mp[x].push_back(y);
}
for(auto i : mp)
{
sort(i.second.begin(), i.second.end());
}
cin>>t;
while(t--)
{
int xs, ys;
cin>>xs>>ys>>xf>>yf;
if(xf-xs>n) cout<<"No\n";
else if(wae(xs, ys)) cout<<"Yes\n";
else cout<<"No\n";
}
return 0;
}
Compilation message
trampoline.cpp: In function 'bool wae(int, int)':
trampoline.cpp:20:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
20 | if(yyy==mp[x].size())
| ~~~^~~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
5 ms |
332 KB |
expected YES, found NO [1st token] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
123 ms |
1968 KB |
expected YES, found NO [3rd token] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
713 ms |
13480 KB |
expected YES, found NO [4th token] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
19 ms |
580 KB |
expected YES, found NO [1st token] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1294 ms |
16200 KB |
expected YES, found NO [1st token] |
2 |
Halted |
0 ms |
0 KB |
- |