# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
600404 | MilosMilutinovic | Toll (BOI17_toll) | C++14 | 350 ms | 21568 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.
/**
* author: wxhtzdy
* created: 20.07.2022 21:48:11
**/
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
const int inf = 1e8;
int d[N][5][5];
class segtree {
public:
struct node {
// don't forget to set default value (used for leaves)
// not necessarily neutral element!
int dist[5][5];
int L;
int R;
void apply(int l, int r, int v) {
L = v;
R = v;
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
dist[i][j] = (i == j ? 0 : 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |