# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
707187 | thimote75 | Toll (BOI17_toll) | C++14 | 231 ms | 169144 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;
#define num long long
int nbNodes, nbRoads, bucketSize, nbQuery;
int bucketCount;
#define MAX_BUCKET_SIZE 5
#define MAX_BUCKET_GRID 25
#define LINF 1e17
struct AdjGraph {
num grid[MAX_BUCKET_SIZE][MAX_BUCKET_SIZE];
AdjGraph () {
for (int a = 0; a < bucketSize; a ++)
for (int b = 0; b < bucketSize; b ++)
grid[a][b] = LINF;
}
void identity () {
for (int a = 0; a < bucketSize; a ++)
for (int b = 0; b < bucketSize; b ++)
grid[a][b] = a == b ? 0 : LINF;
}
AdjGraph compile (AdjGraph &other) {
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... |