#include<bits/stdc++.h>
using namespace std;
vector<long long> mosaic(vector<int> x,vector<int> y,vector<int> t, vector<int> b,vector<int> l, vector<int> r){
//subtask 3
int n=x.size();
int q=t.size();
int preSum[n+1]={0};
for(int i=0;i<n;i++) preSum[i+1]=x[i];
for(int i=1;i<=n;i++) preSum[i]+=preSum[i-1];
vector<long long> ans(q);
for(int i=0;i<q;i++){
ans[i]=preSum[r[i]+1]-preSum[l[i]];
}
return ans;
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |