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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;
struct Q{
int l, r, time, index;
};
bool comp(const Q &q1, const Q &q2){
return q1.time<q2.time;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, q;
cin>>n>>q;
vector<int> vect(n);
for (int i=0;i<n;i++) cin>>vect[i];
vector<Q> qv(q);
for (int i=0;i<q;i++){
cin>>qv[i].time>>qv[i].l>>qv[i].r;
qv[i].index=i;
}
sort(qv.begin(), qv.end(), comp);
int t=0;
vector<int> out(q);
for (Q qe:qv){
int tDiff=qe.time-t;
t=qe.time;
for (int i=0;i<tDiff;i++){
for (int j=n-2;j>=0;j--){
if (vect[j]>vect[j+1]) vect[j+1]=vect[j];
}
}
for (int i=qe.l-1;i<=qe.r-1;i++) out[qe.index]+=vect[i];
}
for (int x:out) cout<<x<<'\n';
return 0;
}
# | 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... |