# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1151151 | 12345678 | Grapevine (NOI22_grapevine) | C++20 | 1452 ms | 150704 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int nx=1e5+5, kx=17;
struct node
{
ll mn, lz;
node(): mn(0), lz(0){}
};
ll n, q, u, v, w, in[nx][kx], out[nx][kx], pa[nx], sz[nx], lvl[nx], used[nx], dif, t, open[nx], cur, segsz[nx], cnt, res;
vector<ll> d[nx];
vector<node> seg[nx];
map<pair<ll, ll>, ll> mp;
vector<tuple<ll, ll, ll>> edg;
int dfssz(int u, int p)
{
sz[u]=1;
for (auto v:d[u]) if (v!=p&&!used[v]) sz[u]+=dfssz(v, u);
return sz[u];
}
int findcentroid(int u, int p, int rtsz)
{
for (auto v:d[u]) if (v!=p&&!used[v]&&2*sz[v]>rtsz) return findcentroid(v, u, rtsz);
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |