# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1151980 | CodeLakVN | Dynamic Diameter (CEOI19_diameter) | C++20 | 2146 ms | 227600 KiB |
#include <bits/stdc++.h>
using namespace std;
#define task "DIAMETER"
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FOD(i, a, b) for (int i = (a); i >= (b); i--)
#define F first
#define S second
#define ll long long
typedef pair<int, int> ii;
typedef pair<int, ll> il;
const int N = (int)1e5 + 5;
int numNode, numQuery;
ll limit;
struct EDGE {
int u, v;
ll w;
};
vector<il> adj[N];
EDGE edges[N];
int sz[N];
bool del[N];
vector<ii> ancestors[N]; // storing ancestors of current node: {anc, DFS time of current node}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |