| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 731039 | CutSandstone | Mecho (IOI09_mecho) | C++17 | 313 ms | 11532 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 f first
#define s second
using ll = long long;
using namespace std;
const int inf = 1<<30;
int bees[800][800];
bool go[800][800];
bool vis[800][800];
int bfs[640000][3];
int p1, p2, len;
int ra, rb, rc;
pair<int, int> st, en;
pair<int, int> d4[4] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int N, S;
void push(int a, int b, int c){
bfs[p2][0] = a;
bfs[p2][1] = b;
bfs[p2][2] = c;
p2++;
if(p2 == 640000) p1 = 0;
len++;
}
void poll(){
ra = bfs[p1][0];
rb = bfs[p1][1];
rc = bfs[p1][2];
p1++;
if(p1 == 640000) p1 = 0;
len--;
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||