# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
933006 | velislavgarkov | Construction of Highway (JOI18_construction) | C++14 | 4 ms | 9052 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 <algorithm>
#include <vector>
using namespace std;
const int MAXN=1e5+10;
#define endl '\n'
struct Kopie {
int x;
int ind;
bool friend operator < (Kopie a, Kopie b) {
return a.x<b.x;
}
};
Kopie d[MAXN];
int a[MAXN], b[MAXN], c[MAXN];
int ss[MAXN], par[MAXN];
int heavy[MAXN], start[MAXN], op[MAXN], seg_pos[MAXN];
int heavy_cnt, cnt;
int tree[4*MAXN], lazy[4*MAXN];
int fen[MAXN];
vector <int> v[MAXN];
vector <pair <int,long long> > arr;
int n;
void dfs(int x, int p) {
ss[x]=0;
for (auto i:v[x]) {
if (i==p) continue;
dfs(i,x);
par[i]=x;
ss[x]=max(ss[x],ss[i]+1);
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... |