# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
224342 | maximath_1 | Solar Storm (NOI20_solarstorm) | C++14 | 398 ms | 120516 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 ll long long
const int MAX=1000005;
const int LOG=21;
int n, s, lf[MAX], rg[MAX], par[LOG][MAX];
ll k, d[MAX], v[MAX], ans;
vector<int>ansv;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin>>n>>s>>k;
for(int i=2; i<=n; i++){
cin>>d[i];
d[i]+=d[i-1];
}
for(int i=1; i<=n; i++){
cin>>v[i];
v[i]+=v[i-1];
}
rg[0]=1;
for(int i=1, l=1, r=1, x=0; i<=n; i++){
for(; r<=n && d[r]<=d[i]+k; r++);
for(; l<=n && d[l]<d[i]-k; l++);
for(; rg[x]<l; x++);
lf[i]=l; rg[i]=r;
par[0][i]=x;
}
for(int lg=1; lg<LOG; lg++)
for(int i=1; i<=n; i++)
# | 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... |