# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1155969 | vicvic | Mecho (IOI09_mecho) | C++20 | 436 ms | 11180 KiB |
#include <iostream>
#include <vector>
#include <set>
#include <queue>
using namespace std;
const int bulan=100000;
const int dx[]={0, 0, -1, 1};
const int dy[]={-1, 1, 0, 0};
int n, s, ok;
int viz[805][805], blocked[805][805], xs, ys, ye, xe, viz2[805][805];
char mat[805][805];
vector <pair <int, int>> initial, trees;
queue <vector <int>> coadab;
queue <vector <int>> coada;
bool ismat (int i, int j)
{
return i>=1 && j>=1 && i<=n && j<=n;
}
void moveBees (int time)
{
while (!coadab.empty())
{
int x=coadab.front()[0];
int y=coadab.front()[1];
int val=coadab.front()[2];
if (val>time)
break;
coadab.pop();
blocked[x][y]=1;
for (int i=0;i<=3;i++)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |