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 main() {
int n, q, t, l, p, s;
cin >> n >> q;
vector<int> dis;
vector<vector<int>> fakty;
vector<vector<pair<int, int>>> zap(2000000);
vector<int> dod;
for (int i = 0; i < n; i++) {
cin >> s;
dis.push_back(s);
}
for (int i = 0; i < q; i++) {
cin >> t >> l >> p;
zap[t - 1].push_back({l, p});
fakty.push_back({t, l, p});
}
map<vector<int>, int> wyniki;
int i = 0;
while (wyniki.size() < fakty.size()) {
for (int j = n - 1; j > 0; j--) {
if (dis[j - 1] > dis[j]) {
dis[j] = dis[j - 1];
}
}
for (pair<int, int> z : zap[i]) {
long long s = 0;
for(int y = z.first; y <= z.second; y++) {
s += dis[y - 1];
}
wyniki[{i + 1, z.first, z.second}] = s;
}
i += 1;
}
for(vector<int> i : fakty) {
cout << wyniki[i] << endl;
}
}
# | 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... |