# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
281908 | Plurm | Mecho (IOI09_mecho) | C++11 | 445 ms | 6400 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;
char t[1024][1024];
char test[1024][1024];
int dist[1024][1024];
int n, s;
class state{
public:
int x,y,cw;
state(int a, int b, int c): x(a), y(b), cw(c) {}
};
void propagateBees(queue<state>& q, int limit){
while(!q.empty() && q.front().cw < limit){
state cur = q.front();
q.pop();
int x = cur.x;
int y = cur.y;
int w = cur.cw+1;
if(x > 1 && (test[x-1][y] == 'G' || test[x-1][y] == 'M') && dist[x-1][y] > w){
dist[x-1][y] = w;
test[x-1][y] = 'H';
q.emplace(x-1, y, w);
}
if(x < n && (test[x+1][y] == 'G' || test[x+1][y] == 'M') && dist[x+1][y] > w){
dist[x+1][y] = w;
test[x+1][y] = 'H';
q.emplace(x+1, y, w);
}
if(y > 1 && (test[x][y-1] == 'G' || test[x][y-1] == 'M') && dist[x][y-1] > w){
dist[x][y-1] = w;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |