# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
231662 | crimsonred | Solar Storm (NOI20_solarstorm) | C++17 | 516 ms | 193160 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 mod 1'000'000'007
typedef long long ll;
template<typename T>
void deb(initializer_list<T> l)
{
for (auto &e : l)
cout << e << ' ';
cout << endl;
}
ll n, s, k;
vector<ll> coord, a, parents, leftx, rightx, pref;
vector<vector<ll>> adj;
ll mx = 0;
pair<ll, ll> ans;
void dfs(ll u, ll parent, vector<ll>& stk)
{
stk.push_back(u);
for (auto &v : adj[u])
if (v != parent)
dfs(v, u, stk);
ll ancestor = stk.size() >= s ? stk[stk.size() - s] : stk[0];
// [u, ancestor]
ll sum = pref[rightx[ancestor]] - (leftx[u] ? pref[leftx[u] - 1] : 0);
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |