# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
28077 | 외않된데? (#71) | The City and The Bitcoin (FXCUP2_city) | C++98 | 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 <cstdio>
#include <algorithm>
#include <queue>
using namespace std;
typedef pair<int, int> p;
bool city[333][333];
int main()
{
//n�� ����, m�� ����
int n, m;
scanf("%d %d", &n, &m);
for (int i = 0; i <m; ++i)
{
for (int j = 0; j < n; ++j)
{
scanf("%d", &city[i][j]);
}
}
queue<p> q;
q.push(p(0, 0));
while (!q.empty())
{
auto now = q.front();
q.pop();
if (now.first == m - 1 && now.second == n - 1)
{
printf("Yes");
return 0;
}
if (now.first + 1 < m)
{
q.push(p(now.first + 1, now.second));
}
if (now.second + 1 < n)
{
q.push(p(now.first, now.second + 1));
}
}
printf("No");
return 0;
}