| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 650331 |
2022-10-13T13:41:12 Z |
600Mihnea |
Fire (JOI20_ho_t5) |
C++17 |
|
1000 ms |
11196 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct Op {
int limit;
int k;
int id;
};
int main() {
#ifndef ONPC
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#endif
int n, q;
cin >> n >> q;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
// l, r, t
vector<ll> prn(2 * q, 0);
vector<Op> ops;
for (int i = 0; i < q; i++) {
int l, r, t;
cin >> t >> l >> r;
l--, r--;
ops.push_back({l - 1, t, i});
ops.push_back({r, t, i + q});
}
for (auto &it : ops) {
int limit = it.limit;
if (limit < 0) {
//cout << "skip\n";
continue;
}
int k = it.k;
int id = it.id;
ll sol = 0;
for (int i = 0; i <= limit; i++) {
ll mx = a[i];
for (int j = i; j >= i - k && j >= 0; j--) {
mx = max(mx, a[j]);
}
sol += mx;
}
prn[id] = sol;
}
for (int i = 0; i < q; i++) {
cout << prn[i + q] - prn[i] << "\n";
}
cout << "\n";
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
3 ms |
340 KB |
Output is correct |
| 3 |
Correct |
3 ms |
340 KB |
Output is correct |
| 4 |
Correct |
3 ms |
340 KB |
Output is correct |
| 5 |
Correct |
3 ms |
320 KB |
Output is correct |
| 6 |
Correct |
4 ms |
340 KB |
Output is correct |
| 7 |
Correct |
3 ms |
340 KB |
Output is correct |
| 8 |
Correct |
3 ms |
340 KB |
Output is correct |
| 9 |
Correct |
4 ms |
324 KB |
Output is correct |
| 10 |
Correct |
4 ms |
340 KB |
Output is correct |
| 11 |
Correct |
5 ms |
312 KB |
Output is correct |
| 12 |
Correct |
6 ms |
340 KB |
Output is correct |
| 13 |
Correct |
6 ms |
348 KB |
Output is correct |
| 14 |
Correct |
4 ms |
324 KB |
Output is correct |
| 15 |
Correct |
4 ms |
340 KB |
Output is correct |
| 16 |
Correct |
4 ms |
340 KB |
Output is correct |
| 17 |
Correct |
4 ms |
340 KB |
Output is correct |
| 18 |
Correct |
4 ms |
340 KB |
Output is correct |
| 19 |
Correct |
4 ms |
340 KB |
Output is correct |
| 20 |
Correct |
4 ms |
328 KB |
Output is correct |
| 21 |
Correct |
5 ms |
340 KB |
Output is correct |
| 22 |
Correct |
4 ms |
340 KB |
Output is correct |
| 23 |
Correct |
1 ms |
340 KB |
Output is correct |
| 24 |
Correct |
1 ms |
340 KB |
Output is correct |
| 25 |
Correct |
1 ms |
340 KB |
Output is correct |
| 26 |
Correct |
2 ms |
316 KB |
Output is correct |
| 27 |
Correct |
1 ms |
340 KB |
Output is correct |
| 28 |
Correct |
2 ms |
320 KB |
Output is correct |
| 29 |
Correct |
1 ms |
340 KB |
Output is correct |
| 30 |
Correct |
1 ms |
212 KB |
Output is correct |
| 31 |
Correct |
1 ms |
340 KB |
Output is correct |
| 32 |
Correct |
1 ms |
340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Execution timed out |
1085 ms |
11056 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Execution timed out |
1090 ms |
11196 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1086 ms |
11108 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
3 ms |
340 KB |
Output is correct |
| 3 |
Correct |
3 ms |
340 KB |
Output is correct |
| 4 |
Correct |
3 ms |
340 KB |
Output is correct |
| 5 |
Correct |
3 ms |
320 KB |
Output is correct |
| 6 |
Correct |
4 ms |
340 KB |
Output is correct |
| 7 |
Correct |
3 ms |
340 KB |
Output is correct |
| 8 |
Correct |
3 ms |
340 KB |
Output is correct |
| 9 |
Correct |
4 ms |
324 KB |
Output is correct |
| 10 |
Correct |
4 ms |
340 KB |
Output is correct |
| 11 |
Correct |
5 ms |
312 KB |
Output is correct |
| 12 |
Correct |
6 ms |
340 KB |
Output is correct |
| 13 |
Correct |
6 ms |
348 KB |
Output is correct |
| 14 |
Correct |
4 ms |
324 KB |
Output is correct |
| 15 |
Correct |
4 ms |
340 KB |
Output is correct |
| 16 |
Correct |
4 ms |
340 KB |
Output is correct |
| 17 |
Correct |
4 ms |
340 KB |
Output is correct |
| 18 |
Correct |
4 ms |
340 KB |
Output is correct |
| 19 |
Correct |
4 ms |
340 KB |
Output is correct |
| 20 |
Correct |
4 ms |
328 KB |
Output is correct |
| 21 |
Correct |
5 ms |
340 KB |
Output is correct |
| 22 |
Correct |
4 ms |
340 KB |
Output is correct |
| 23 |
Correct |
1 ms |
340 KB |
Output is correct |
| 24 |
Correct |
1 ms |
340 KB |
Output is correct |
| 25 |
Correct |
1 ms |
340 KB |
Output is correct |
| 26 |
Correct |
2 ms |
316 KB |
Output is correct |
| 27 |
Correct |
1 ms |
340 KB |
Output is correct |
| 28 |
Correct |
2 ms |
320 KB |
Output is correct |
| 29 |
Correct |
1 ms |
340 KB |
Output is correct |
| 30 |
Correct |
1 ms |
212 KB |
Output is correct |
| 31 |
Correct |
1 ms |
340 KB |
Output is correct |
| 32 |
Correct |
1 ms |
340 KB |
Output is correct |
| 33 |
Execution timed out |
1085 ms |
11056 KB |
Time limit exceeded |
| 34 |
Halted |
0 ms |
0 KB |
- |
