# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
224120 | tqbfjotld | Fire (JOI20_ho_t5) | C++14 | 5 ms | 384 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;
int arr[200005];
int ans[200005];
vector<pair<pair<int,pair<int,int> >,int> > queries;
int main(){
int n,q;
scanf("%d%d",&n,&q);
if (n<=200 && q<=200){
for (int x = 1; x<=n; x++){
scanf("%d",&arr[x]);
}
for (int x = 0; x<q; x++){
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
queries.push_back({{a,{b,c}},x});
}
sort(queries.begin(),queries.end());
int cur = 0;
for (auto x : queries){
while (x.first.first>cur){
cur++;
for (int y = n; y>=2; y--){
arr[y] = max(arr[y],arr[y-1]);
//printf("%d ",arr[y]);
}
//printf("\n");
}
ans[x.second] = 0;
for (int y = x.first.second.first; y<=x.first.second.second; y++){
ans[x.second] += arr[y];
}
}
for (int x = 0; x<q; x++){
printf("%d\n",ans[x]);
}
}
}
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... |