# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1165188 | Warinchai | Dynamic Diameter (CEOI19_diameter) | C++20 | 265 ms | 107772 KiB |
#include <bits/stdc++.h>
#define int long long
using namespace std;
vector<int> adj[800005];
int ar[800005];
int n, q, w;
struct path
{
int l, d, mxpre, mxsuf;
path(int x = 0)
{
l = d = mxpre = mxsuf = x;
}
friend path operator+(path &a, path &b)
{
path c;
c.l = a.l + b.l;
c.mxsuf = max(b.mxsuf, a.mxsuf + b.l);
c.mxpre = max(a.mxpre, b.mxpre + a.l);
c.d = max({a.d, b.d, a.mxsuf + b.mxpre});
return c;
}
} paths[1000005];
struct point
{
int mx, d;
point(int x = 0)
{
mx = d = x;
}
# | 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... |