# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
879975 | VectorLi | Valley (BOI19_valley) | C++17 | 106 ms | 40520 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 = (int) 1E5, K = 17;
const long MAX = numeric_limits<long>::max();
struct Element {
long a;
};
const Element E = {MAX};
Element operator + (Element u, Element v) {
Element w;
w.a = min(u.a, v.a);
return w;
}
int n, m, q, s;
vector<pair<int, long>> e1[V];
pair<int, int> e2[V - 1];
bool t[V];
int p[K][V], d1[V], h[V], l[V], c;
long d2[V], f[V];
Element g[K][V];
void DFS(int u) {
h[u] = 1;
# | 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... |