# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
916436 | OAleksa | Valley (BOI19_valley) | C++14 | 289 ms | 38548 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>
//ako ovaj vaso daso misli da me pobedjuje.....
using namespace std;
#define int long long
#define f first
#define s second
const int N = 1e5 + 69;
const int K = 18;
const int inf = 1e18;
int up[N][K];
int n, s, q, e, cnt[N], dep[N], par[N], sz[N], b[N];
int st[4 * N];
int tin[N], tout[N], timer, vis[N];
vector<int> shop;
vector<pair<int, int>> g[N];
vector<tuple<int, int, int>> edges;
void modify(int v, int tl, int tr, int l, int r, int val) {
if (tl > r || tr < l)
return;
else if (tl >= l && tr <= r) {
if (val == 1)
st[v] = inf;
else {
if (tl == tr)
st[v] = b[tl];
else
st[v] = min(st[v * 2], st[v * 2 + 1]);
}
}
else {
# | 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... |