# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
712197 | dubabuba | Mecho (IOI09_mecho) | C++14 | 519 ms | 5320 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 <bits/stdc++.h>
using namespace std;
int di[] = {1, -1, 0, 0};
int dj[] = {0, 0, -1, 1};
typedef pair<int, int> pii;
#define ff first
#define ss second
const int mxn = 808;
char mp[mxn][mxn];
bool vs[mxn][mxn];
int bee[mxn][mxn];
int n, s, Si, Sj, Di, Dj;
bool can(int i, int j) {
if(mp[i][j] == 'T') return false;
if(mp[i][j] == 'H') return false;
return true;
}
bool bfs(int M) {
priority_queue<pair<int, pii>> pq;
pq.push({0, {Si, Sj}});
memset(vs, 0, sizeof vs);
vs[Si][Sj] = true;
while(pq.size()) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |