| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 286381 | Puddlestomps | Mecho (IOI09_mecho) | C++17 | 524 ms | 59536 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;
typedef long long BEEG;
typedef unsigned long long uBEEG;
struct Node
{
int x, y, beedist = INT_MAX, dist = INT_MAX, time = INT_MAX, par = INT_MAX, check = INT_MAX;
vector<int> edges;
Node(int x, int y) : x(x), y(y) {}
};
constexpr int MAXN = 800;
int N, S, start = -1, home = -1, maxbee = -1;
array<array<int, MAXN>, MAXN> board;
vector<Node> nodes;
//vector<int> hives;
void connect(int node, int x, int y)
{
if(x > 0)
{
int left = board[y][x - 1];
if(left != -1)
{
nodes[node].edges.push_back(left);
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||