| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 475197 | bigo | Trampoline (info1cup20_trampoline) | C++17 | 0 ms | 0 KiB |
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 <iostream>
#include <vector>
#include <cmath>
using namespace std;
#define pii pair<int, int>
vector<vector<int>>vec;
vector<bool>visit;
void dfs(int v) {
visit[v] = true;
for (int i = 0; i < vec[v].size(); i++) {
if (!visit[vec[v][i]])
dfs(vec[v][i]);
}
}
int main() {
int r, c, n;
cin >> r >> c >> n;
set<pii>green;
int a, b;
for (int i = 0; i < n; i++) {
cin >> a >> b;
a--, b--;
green.insert({ a,b });
}
vec.resize(r * c);
visit.resize(r * c, false);
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
if (green.find({ i,j }) != green.end()) {
if(i!=r-1)
vec[i * c + j].push_back(i * c + j + 1);
if(j!=c-1)
vec[i * c + j].push_back((i + 1) * c + j);
}
else {
if(j!=c-1)
vec[i * c + j].push_back(i * c + j + 1);
}
}
}
int t;
cin >> t;
while (t--) {
int y1, x1, y2, x2;
cin >> y1 >> x1 >> y2 >> x2;
y1--, x1--, y2--, x2--;
dfs(y1 * c + x1);
if (visit[y2 * c + x2])
cout << "YES";
else
cout << "NO";
cout << endl;
for (int i = 0; i < r * c; i++)
visit[i] = false;
}
}