| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 401055 | ruadhan | Mecho (IOI09_mecho) | C++17 | 299 ms | 6436 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>
#define sz(x) (int)x.size()
#define x first
#define y second
#define X 0
#define Y 1
#define TIME 2
#define STEPS 3
using namespace std;
typedef pair<int, int> pi;
const int MX = 805;
string grid[MX];
int bees_time[MX][MX];
int N, S;
vector<pi> hives;
vector<pi> dirs = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
void calc_bee_times()
{
queue<pi> q;
for (auto i : hives)
{
q.push(i);
bees_time[i.x][i.y] = 0;
}
while (!q.empty())
{
auto curr = q.front();
q.pop();
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||