# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
140671 | Minnakhmetov | Valley (BOI19_valley) | C++14 | 393 ms | 34028 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 ll long long
#define all(aaa) aaa.begin(), aaa.end()
struct E {
int to, w;
};
const int N = 1e5 + 5;
vector<E> g[N];
vector<int>qr[N];
int hurdle[N], tin[N], tout[N], x[N], tour[N];
ll h[N], up[N * 4];
pair<int, ll> t[N * 4], ans[N];
bool isShop[N];
vector<pair<int, int>> edges;
int n, s, q, e, timer = -1;
void push(int v, int L, int R) {
if (up[v]) {
t[v].second += up[v];
if (L != R) {
up[v * 2] += up[v];
up[v * 2 + 1] += up[v];
# | 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... |