# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
332861 | beso123 | Solar Storm (NOI20_solarstorm) | C++14 | 910 ms | 197320 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>
#define int long long
using namespace std;
const int N=1000006;
int n,s,d;
int a[N],v[N],pref[N],p[N],gr[N],par[N];
vector<int> b,g[N];
deque<int> q;
void DFS(int v,int pr){
q.push_back(v);
int pos=max(0LL,(int)q.size()-(int)s-1LL);
gr[v]=max(q[pos],0LL);
par[v]=pr;
for(auto to : g[v]){
if(pr==to)
continue;
DFS(to,v);
}
q.pop_back();
}
main(){
cin>>n>>s>>d;
b.push_back(0);
for(int k=2;k<=n;k++){
cin>>a[k];
p[k]=p[k-1]+a[k];
b.push_back(p[k]);
}
for(int k=1;k<=n;k++){
cin>>v[k];
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... |