# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
837333 | gustason | Soccer (JOI17_soccer) | C++14 | 223 ms | 18400 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;
using ll = long long;
#define int ll
const ll INF = 1e16 + 5;
const int INF2 = 1e9 + 5;
int dist[501][501];
ll cost[3][501][501];
const int dx[] = {0, 0, -1, 1};
const int dy[] = {1, -1, 0, 0};
struct Vertex {
int type, x, y;
ll cost;
bool operator<(const Vertex& other) const {
return cost > other.cost;
}
};
void fill() {
for(int i = 0; i < 501; i++) {
for(int j = 0; j < 501; j++) {
dist[i][j] = INF2;
for(int k = 0; k < 3; k++) {
cost[k][i][j] = INF;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |