# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
636909 | ojoConmigo | Mecho (IOI09_mecho) | C++17 | 1100 ms | 31000 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 n,s;
vector<vector<char>> grid;
vector<pair<int,int>> hives;
pair<int,int> root,obj;
vector<vector<int>> mapa;
vector<vector<bool>> visit;
vector<vector<int>> dp;
int sx[4] = {0,0,1,-1};
int sy[4] = {1,-1,0,0};
bool ok(int x, int y){
return x < n && y < n && x >= 0 && y >= 0;
}
void bfs(){
queue<pair<int,int>> cola;
for(auto h : hives){
cola.push(h);
}
while(cola.size()){
auto q = cola.front();
cola.pop();
int x = q.first;
int y = q.second;
for(int i=0; i<4; i++){
int nx = x + sx[i];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |