# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
500730 | kevin | Mecho (IOI09_mecho) | C++17 | 213 ms | 8104 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;
#define ll long long
#define nl cout<<"\n"
#define f first
#define s second
#define ca(v) for(auto i:v) cout<<i<<" ";
int xm[4] = {-1, 1, 0, 0};
int ym[4] = {0, 0, -1, 1};
int grid[801][801];
int dst[801][801];
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
if (fopen("input.in", "r")) freopen("input.in", "r", stdin);
int n; cin>>n; int x; cin>>x;
queue<pair<int, int>> q;
pair<int, int> st;
pair<int, int> ed;
vector<vector<bool>> vis(n, vector<bool>(n, 0));
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
char c; cin>>c;
grid[i][j] = (c != 'T');
if(c == 'M') st = {i, j};
if(c == 'D') ed = {i, j};
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |