# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1045094 | Nickpapadak | Addk (eJOI21_addk) | C++14 | 562 ms | 856 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;
const unsigned int MAXN = 1e+5 + 10;
int N, K, Q;
int A[MAXN], ps[MAXN];
int solveBF(){
int ans = 0;
int l,r,m;
scanf("%d%d%d",&l,&r,&m);
// for(int i = l; i <= l+m-1;++i){
// ans += ps[l+m-1] - ps[i-1];
// // printf("%d %d: %d\n",i,i+m,ans);
// }
// ans += (ps[r-m] - ps[l+m-1])*m;
// for(int i = r-m+1; i <= r; ++i){
// ans += ps[i] - ps[r-m];
// }
for(int i = l; i+m-1 <= r; ++i){
ans += ps[i+m-1]-ps[i-1];
}
return max(ans, 0);
}
int scanBF(){
int k;
for(int i = 1; i<=K;++i){
scanf("%d",&k);
}
return -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... |