# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
517114 | tzuyuna | Roadside Advertisements (NOI17_roadsideadverts) | C++14 | 137 ms | 16212 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 fi first
#define si second
#define ll long long
typedef pair<int,int> pi;
struct edge {
int u, v, c;
};
const int mxn = 100005;
int N, Q;
int dist[mxn], twok[mxn][18], depth[mxn], par[mxn];
vector<pi> adj[mxn];
void dfs(int x, int p, int d, long long wd) {
depth[x] = d;
dist[x] = wd;
twok[x][0] = p;
for (int i = 1; i <= 17; i++) {
if (twok[x][i - 1] == -1) break;
twok[x][i] = twok[twok[x][i - 1]][i - 1];
}
for (auto it: adj[x]) {
if (it.first != p) dfs(it.first,x,d+1,wd+it.second);
}
}
int kth_parent(int x, int k){
# | 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... |