Submission #636909

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
6369092022-08-30 13:13:19ojoConmigoMecho (IOI09_mecho)C++17
23 / 100
1100 ms31000 KiB
#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];
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...