# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
126991 | TadijaSebez | Valley (BOI19_valley) | C++11 | 452 ms | 114552 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 pb push_back
#define ll long long
const int N=100050;
const ll inf=1e18;
const ll lim=1e17;
const int M=80*N;
int ls[M],rs[M],tsz,root[N];
ll mn[M],lzy[M];
bool shop[N];
vector<pair<int,int>> E[N];
ll dep[N];
int lid[N],rid[N],tid,nod[N],n;
void DFS(int u, int p)
{
lid[u]=++tid;
nod[tid]=u;
for(auto e:E[u]) if(e.first!=p)
{
dep[e.first]=dep[u]+e.second;
DFS(e.first,u);
}
rid[u]=tid;
}
void Build(int &c, int ss, int se)
{
c=++tsz;
if(ss==se)
{
Compilation message (stderr)
# | 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... |