# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1148716 | CodeLakVN | Dynamic Diameter (CEOI19_diameter) | C++20 | 1276 ms | 3908 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
template<class X, class Y>
bool maximize(X &x, Y y) {
if (x < y) {
x = y;
return true;
}
return false;
}
const int N = (int)1e5 + 5;
int numNode, numQuery;
long long limit;
struct EDGE {
int u, v, c;
} edges[N];
pair<int, int> query[N];
typedef pair<int, long long> il;
namespace sub2 {
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... |