| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 335744 | DavidDamian | Mecho (IOI09_mecho) | C++11 | 253 ms | 8940 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;
struct node{
int i;
int j;
node(){}
node(int I,int J){
i=I;
j=J;
}
};
queue<node> Q;
char forest[805][805];
int bees[805][805];
int dist[805][805];
int energy[805][805];
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
int n,s;
void bfsBees(){
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
bees[i][j]=INT_MAX;
if(forest[i][j]=='H'){
Q.push(node(i,j));
bees[i][j]=0;
}
}
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||