# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
443014 | LucaIlie | Awesome Arrowland Adventure (eJOI19_adventure) | C++17 | 108 ms | 22200 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 <stdio.h>
#include <queue>
#include <vector>
#include <ctype.h>
#define MAX_N 500
#define DIR 4
using namespace std;
struct muchie {
int nod, cost;
bool operator < (const muchie &aux) const {
return cost > aux.cost;
}
};
int dist[MAX_N * MAX_N], dir[MAX_N + 2][MAX_N + 2];
int dl[DIR] = { -1, 0, 1, 0 }, dc[DIR] = { 0, 1, 0, -1 };
vector <muchie> muchii[MAX_N * MAX_N];
priority_queue <muchie> pq;
char nextChar() {
char ch;
ch = getc( stdin );
while ( !isalpha( ch ) )
ch = getc( stdin );
return ch;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |