This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int r, c, n;
set<pair<int, int>> green;
bool dfs(int x, int y, int xf, int yf){
if (x == xf && y == yf){
return true;
}
if (x == r && y == c) return false;
bool canReach = false;
if (green.count({x, y})){
if (x+1 <= r) canReach |= dfs(x+1, y, xf, yf);
if (y+1 <= c) canReach |= dfs(x, y+1, xf, yf);
} else{
if (y+1 <= c) canReach |= dfs(x, y+1, xf, yf);
}
return canReach;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> r >> c >> n;
int x, y;
for (int i = 0; i<n; i++){
cin >> x >> y;
green.insert({x, y});
}
int t;
cin >> t;
while (t--){
int xStart, yStart, xEnd, yEnd;
cin >> xStart >> yStart >> xEnd >> yEnd;
cout << ((dfs(xStart, yStart, xEnd, yEnd)) ? "Yes\n" : "No\n");
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |