# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
880418 | VectorLi | Toll (BOI17_toll) | C++17 | 174 ms | 78936 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 long long long
using namespace std;
const int V = 50000, K = 16;
const int N = 5;
const int MAX = numeric_limits<int>::max();
struct Element {
int a[N][N];
int* operator [] (int i) {
return a[i];
}
Element() {
for (int i = 0; i < N; i++) {
fill(a[i], a[i] + N, MAX);
a[i][i] = 0;
}
}
};
Element operator + (Element &u, Element &v) {
Element w;
for (int i = 0; i < N; i++) {
fill(w[i], w[i] + N, MAX);
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
for (int k = 0; k < N; k++) {
# | 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... |