# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
541302 | SquareSpoon | Mecho (IOI09_mecho) | C++14 | 137 ms | 5936 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 <iostream>
#include <queue>
#include <utility>
#include <vector>
#include <algorithm>
#define MAX 801
using namespace std;
typedef pair<int, int> pii;
int n, m, d[MAX][MAX];
char map[MAX][MAX];
bool v[MAX][MAX];
int x[5] = {1, 0, -1, 0};
int y[5] = {0, 1, 0, -1};
//calcular o tempo em passos
void bees(vector<pii> c){
queue<pii> q;
for(int i = 0; i < c.size(); i++){
q.push(c[i]);
d[c[i].first][c[i].second] = m;
}
while(!q.empty()){
pii node = q.front();
q.pop();
if(v[node.first][node.second]) continue;
v[node.first][node.second] = true;
for(int i = 0; i < 4; i++){
int x1 = x[i] + node.first;
int y1 = y[i] + node.second;
if(x1 > n || x1 < 1 || y1 > n || y1 < 1) continue;
if(v[x1][y1]) continue;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |