# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
807702 | AndiR | Solar Storm (NOI20_solarstorm) | C++14 | 598 ms | 169432 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 <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll Nmax=1000000;
ll n, s, k, d[Nmax], v[Nmax], r[Nmax];
ll st[Nmax+1], sol;
ll spd[Nmax], spv[Nmax], mx;
vector <ll >ad[Nmax+1];
ll dist(ll a, ll b){
if (a==b)
return 0;
if (a==0)
return spd[b-1];
return spd[b-1]-spd[a-1];
}
ll vp(ll a, ll b){
if (a==0)
return spv[b];
return spv[b]-spv[a-1];
}
void dfs(ll nod, ll lev){
st[lev]=nod;
if (nod!=n){
ll l;
if (lev<s)
l=n-1;
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... |