# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
224131 | 2020-04-17T08:39:26 Z | jamielim | Fire (JOI20_ho_t5) | C++14 | 6 ms | 688 KB |
#include <bits/stdc++.h> using namespace std; int main(){ int n,q; scanf("%d%d",&n,&q); long long arr[n+5][n]; for(int i=0;i<n;i++)scanf("%lld",&arr[0][i]); for(int i=1;i<=n;i++){ arr[i][0]=arr[i-1][0]; for(int j=1;j<n;j++){ arr[i][j]=max(arr[i-1][j-1],arr[i-1][j]); } } int t,l,r; for(int i=0;i<q;i++){ scanf("%d%d%d",&t,&l,&r);l--;r--; long long ans=0; for(int j=l;j<=r;j++){ ans+=arr[t][j]; } printf("%lld\n",ans); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 256 KB | Output is correct |
2 | Correct | 5 ms | 640 KB | Output is correct |
3 | Correct | 5 ms | 640 KB | Output is correct |
4 | Correct | 5 ms | 640 KB | Output is correct |
5 | Correct | 5 ms | 640 KB | Output is correct |
6 | Correct | 5 ms | 640 KB | Output is correct |
7 | Correct | 5 ms | 640 KB | Output is correct |
8 | Correct | 6 ms | 640 KB | Output is correct |
9 | Correct | 5 ms | 640 KB | Output is correct |
10 | Correct | 5 ms | 640 KB | Output is correct |
11 | Correct | 5 ms | 640 KB | Output is correct |
12 | Correct | 5 ms | 640 KB | Output is correct |
13 | Correct | 5 ms | 640 KB | Output is correct |
14 | Correct | 5 ms | 640 KB | Output is correct |
15 | Correct | 5 ms | 688 KB | Output is correct |
16 | Correct | 5 ms | 640 KB | Output is correct |
17 | Correct | 5 ms | 640 KB | Output is correct |
18 | Correct | 5 ms | 640 KB | Output is correct |
19 | Correct | 5 ms | 640 KB | Output is correct |
20 | Correct | 5 ms | 640 KB | Output is correct |
21 | Correct | 5 ms | 640 KB | Output is correct |
22 | Correct | 5 ms | 640 KB | Output is correct |
23 | Correct | 5 ms | 640 KB | Output is correct |
24 | Correct | 5 ms | 640 KB | Output is correct |
25 | Correct | 5 ms | 640 KB | Output is correct |
26 | Correct | 5 ms | 640 KB | Output is correct |
27 | Correct | 5 ms | 640 KB | Output is correct |
28 | Correct | 5 ms | 640 KB | Output is correct |
29 | Correct | 5 ms | 640 KB | Output is correct |
30 | Correct | 5 ms | 640 KB | Output is correct |
31 | Correct | 5 ms | 640 KB | Output is correct |
32 | Correct | 5 ms | 640 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 256 KB | Output is correct |
2 | Runtime error | 5 ms | 384 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 256 KB | Output is correct |
2 | Runtime error | 5 ms | 384 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 5 ms | 384 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 256 KB | Output is correct |
2 | Correct | 5 ms | 640 KB | Output is correct |
3 | Correct | 5 ms | 640 KB | Output is correct |
4 | Correct | 5 ms | 640 KB | Output is correct |
5 | Correct | 5 ms | 640 KB | Output is correct |
6 | Correct | 5 ms | 640 KB | Output is correct |
7 | Correct | 5 ms | 640 KB | Output is correct |
8 | Correct | 6 ms | 640 KB | Output is correct |
9 | Correct | 5 ms | 640 KB | Output is correct |
10 | Correct | 5 ms | 640 KB | Output is correct |
11 | Correct | 5 ms | 640 KB | Output is correct |
12 | Correct | 5 ms | 640 KB | Output is correct |
13 | Correct | 5 ms | 640 KB | Output is correct |
14 | Correct | 5 ms | 640 KB | Output is correct |
15 | Correct | 5 ms | 688 KB | Output is correct |
16 | Correct | 5 ms | 640 KB | Output is correct |
17 | Correct | 5 ms | 640 KB | Output is correct |
18 | Correct | 5 ms | 640 KB | Output is correct |
19 | Correct | 5 ms | 640 KB | Output is correct |
20 | Correct | 5 ms | 640 KB | Output is correct |
21 | Correct | 5 ms | 640 KB | Output is correct |
22 | Correct | 5 ms | 640 KB | Output is correct |
23 | Correct | 5 ms | 640 KB | Output is correct |
24 | Correct | 5 ms | 640 KB | Output is correct |
25 | Correct | 5 ms | 640 KB | Output is correct |
26 | Correct | 5 ms | 640 KB | Output is correct |
27 | Correct | 5 ms | 640 KB | Output is correct |
28 | Correct | 5 ms | 640 KB | Output is correct |
29 | Correct | 5 ms | 640 KB | Output is correct |
30 | Correct | 5 ms | 640 KB | Output is correct |
31 | Correct | 5 ms | 640 KB | Output is correct |
32 | Correct | 5 ms | 640 KB | Output is correct |
33 | Runtime error | 5 ms | 384 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
34 | Halted | 0 ms | 0 KB | - |