Submission #857023

# Submission time Handle Problem Language Result Execution time Memory
857023 2023-10-05T08:59:03 Z StefanSebez Fire (JOI20_ho_t5) C++14
1 / 100
1000 ms 6992 KB
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
    int n,q;cin>>n>>q;
    int a[n+1];for(int i=1;i<=n;i++)cin>>a[i];
    while(q--)
	{
		int l,r,t;cin>>t>>l>>r;
		int b[n+1]={0};for(int i=1;i<=n;i++)b[i]=a[i];
		while(t--)
		{
			int c[n+1];
			for(int i=1;i<=n;i++)c[i]=max(b[i],b[i-1]);
			for(int i=1;i<=n;i++)b[i]=c[i];
		}
		int res=0;
		for(int i=l;i<=r;i++) res+=b[i];
		cout<<res<<endl;
	}
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 4 ms 348 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 5 ms 348 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
13 Correct 7 ms 444 KB Output is correct
14 Correct 6 ms 348 KB Output is correct
15 Correct 7 ms 348 KB Output is correct
16 Correct 6 ms 348 KB Output is correct
17 Correct 6 ms 348 KB Output is correct
18 Correct 6 ms 348 KB Output is correct
19 Correct 7 ms 600 KB Output is correct
20 Correct 7 ms 348 KB Output is correct
21 Correct 6 ms 348 KB Output is correct
22 Correct 6 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 436 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 2 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 1084 ms 6992 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 1055 ms 6912 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1091 ms 5464 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 4 ms 348 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 5 ms 348 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
13 Correct 7 ms 444 KB Output is correct
14 Correct 6 ms 348 KB Output is correct
15 Correct 7 ms 348 KB Output is correct
16 Correct 6 ms 348 KB Output is correct
17 Correct 6 ms 348 KB Output is correct
18 Correct 6 ms 348 KB Output is correct
19 Correct 7 ms 600 KB Output is correct
20 Correct 7 ms 348 KB Output is correct
21 Correct 6 ms 348 KB Output is correct
22 Correct 6 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 436 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 2 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Execution timed out 1084 ms 6992 KB Time limit exceeded
34 Halted 0 ms 0 KB -