# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
653649 | Kaang | 트리 (KOI16_tree) | C++17 | 6 ms | 5332 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<iostream>
#include<vector>
#define int long long
using namespace std;
int segtree[800001],cnt,n,q;
pair<int,int> range[200001];
vector <int> v[200001];
int dp[200001][19],arr[200001],depth[200001];
void dfs(int node,int dep)
{
int temp=++cnt;
depth[node]=dep;
for(int i=0;i<v[node].size();i++)
dfs(v[node][i],dep+1);
range[node]={temp,cnt};
}
void update(int node,int ts,int te,int s,int e,int val)
{
if(ts>=s&&te<=e)
segtree[node]=+val;
else if(ts>e||te<s)
return;
else
{
int mid=(ts+te)/2;
update(node*2,ts,mid,s,e,val);
update(node*2+1,mid+1,te,s,e,val);
}
}
int get(int node,int ts,int te,int x)
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |