Submission #503665

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
503665	2022-01-08T14:54:31 Z	fatemetmhr	Candies (JOI18_candies)	C++17	8 / 100	5000 ms	3540 KB

candies

//  ~Be name khoda~  //

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

#define pb       push_back
#define mp       make_pair
#define all(x)   x.begin(), x.end()
#define fi       first
#define se       second
#define cl       clear
#define endll    '\n'

const int maxn  =  1e6   + 10;
const int maxn5 =  5e5   + 10;
const int maxnt =  1.2e6 + 10;
const int maxn3 =  1e3   + 10;
const int mod   =  1e9   +  7;
const ll  inf   =  2e18;

ll dp[2][2][maxn5];

int main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	
	int n; cin >> n;

	for(int i = 0; i < n; i++){
		int a; cin >> a;
		dp[i%2][0][0] = 0;
		for(int k = 1; k <= (i + 2) / 2; k++){
			dp[i%2][0][k] = max(dp[(i + 1)%2][0][k], dp[(i + 1)%2][1][k]);
			dp[i%2][1][k] = k > 1 && dp[(i + 1)%2][0][k - 1] == 0 ? 0 : dp[(i + 1)%2][0][k - 1] + a;
			//cout << i << ' ' << k << ' ' << dp[i%2][0][k] << ' ' << dp[i%2][1][k] << '\n';
		}
	}
	for(int i = 1; i <= (n + 1) / 2; i++)
		cout << max(dp[(n - 1)%2][0][i], dp[(n - 1)%2][1][i]) << '\n';
}

Subtask #1

8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	336 KB	Output is correct
2	Correct	2 ms	332 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	332 KB	Output is correct
5	Correct	2 ms	332 KB	Output is correct
6	Correct	2 ms	332 KB	Output is correct
7	Correct	2 ms	332 KB	Output is correct
8	Correct	2 ms	332 KB	Output is correct
9	Correct	3 ms	336 KB	Output is correct
10	Correct	2 ms	332 KB	Output is correct
11	Correct	2 ms	332 KB	Output is correct
12	Correct	2 ms	332 KB	Output is correct
13	Correct	2 ms	340 KB	Output is correct
14	Correct	2 ms	336 KB	Output is correct
15	Correct	2 ms	336 KB	Output is correct
16	Correct	2 ms	380 KB	Output is correct
17	Correct	2 ms	332 KB	Output is correct
18	Correct	2 ms	332 KB	Output is correct
19	Correct	2 ms	332 KB	Output is correct
20	Correct	2 ms	332 KB	Output is correct

Subtask #2

0 / 92.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	336 KB	Output is correct
2	Correct	2 ms	332 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	332 KB	Output is correct
5	Correct	2 ms	332 KB	Output is correct
6	Correct	2 ms	332 KB	Output is correct
7	Correct	2 ms	332 KB	Output is correct
8	Correct	2 ms	332 KB	Output is correct
9	Correct	3 ms	336 KB	Output is correct
10	Correct	2 ms	332 KB	Output is correct
11	Correct	2 ms	332 KB	Output is correct
12	Correct	2 ms	332 KB	Output is correct
13	Correct	2 ms	340 KB	Output is correct
14	Correct	2 ms	336 KB	Output is correct
15	Correct	2 ms	336 KB	Output is correct
16	Correct	2 ms	380 KB	Output is correct
17	Correct	2 ms	332 KB	Output is correct
18	Correct	2 ms	332 KB	Output is correct
19	Correct	2 ms	332 KB	Output is correct
20	Correct	2 ms	332 KB	Output is correct
21	Execution timed out	5095 ms	3540 KB	Time limit exceeded
22	Halted	0 ms	0 KB	-