| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 61455 |
2018-07-26T04:21:48 Z |
김세빈(#1779) |
Homecoming (BOI18_homecoming) |
C++11 |
|
266 ms |
103724 KB |
#include "homecoming.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[2020202][2][2];
ll S[2020202];
ll solve(int n, int k, int *A, int *B)
{
int i;
S[0] = B[0];
for(i=1; i<n; i++){
S[i] = S[i-1] + B[i];
}
dp[0][0][0] = 0;
dp[0][0][1] = dp[0][1][0] = -1e18;
dp[0][1][1] = A[0] - S[k-1];
for(i=1; i<=n-k; i++){
dp[i][0][0] = max(dp[i-1][0][0], dp[i-1][1][0]);
dp[i][0][1] = max(dp[i-1][0][1], dp[i-1][1][1]);
dp[i][1][0] = max(dp[i-1][0][0] + A[i] - S[i+k-1] + S[i-1], dp[i-1][1][0] + A[i] - B[i+k-1]);
dp[i][1][1] = max(dp[i-1][0][1] + A[i] - S[i+k-1] + S[i-1], dp[i-1][1][1] + A[i] - B[i+k-1]);
}
for(; i<n; i++){
dp[i][0][0] = max(dp[i-1][0][0], dp[i-1][1][0]);
dp[i][0][1] = max(dp[i-1][0][1], dp[i-1][1][1]);
dp[i][1][0] = max(dp[i-1][0][0] + A[i] - S[n-1] + S[i-1] - S[k-n+i-1], dp[i-1][1][0] + A[i] - B[k-n+i-1]);
dp[i][1][1] = max(dp[i-1][0][1] + A[i] - S[n-1] + S[i-1], dp[i-1][1][1] + A[i]);
}
return max(max(dp[n-1][0][0], dp[n-1][1][0]), max(dp[n-1][0][1], dp[n-1][1][1]));
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
3 ms |
564 KB |
Output is correct |
| 3 |
Correct |
3 ms |
564 KB |
Output is correct |
| 4 |
Correct |
2 ms |
564 KB |
Output is correct |
| 5 |
Correct |
3 ms |
564 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
3 ms |
564 KB |
Output is correct |
| 3 |
Correct |
3 ms |
564 KB |
Output is correct |
| 4 |
Correct |
2 ms |
564 KB |
Output is correct |
| 5 |
Correct |
3 ms |
564 KB |
Output is correct |
| 6 |
Correct |
4 ms |
756 KB |
Output is correct |
| 7 |
Correct |
4 ms |
928 KB |
Output is correct |
| 8 |
Correct |
3 ms |
928 KB |
Output is correct |
| 9 |
Correct |
3 ms |
928 KB |
Output is correct |
| 10 |
Correct |
4 ms |
928 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
75 ms |
23996 KB |
Output is correct |
| 2 |
Correct |
1 ms |
23996 KB |
Output is correct |
| 3 |
Correct |
266 ms |
94572 KB |
Output is correct |
| 4 |
Correct |
4 ms |
94572 KB |
Output is correct |
| 5 |
Correct |
14 ms |
94572 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
3 ms |
564 KB |
Output is correct |
| 3 |
Correct |
3 ms |
564 KB |
Output is correct |
| 4 |
Correct |
2 ms |
564 KB |
Output is correct |
| 5 |
Correct |
3 ms |
564 KB |
Output is correct |
| 6 |
Correct |
4 ms |
756 KB |
Output is correct |
| 7 |
Correct |
4 ms |
928 KB |
Output is correct |
| 8 |
Correct |
3 ms |
928 KB |
Output is correct |
| 9 |
Correct |
3 ms |
928 KB |
Output is correct |
| 10 |
Correct |
4 ms |
928 KB |
Output is correct |
| 11 |
Correct |
75 ms |
23996 KB |
Output is correct |
| 12 |
Correct |
1 ms |
23996 KB |
Output is correct |
| 13 |
Correct |
266 ms |
94572 KB |
Output is correct |
| 14 |
Correct |
4 ms |
94572 KB |
Output is correct |
| 15 |
Correct |
14 ms |
94572 KB |
Output is correct |
| 16 |
Correct |
207 ms |
94648 KB |
Output is correct |
| 17 |
Correct |
116 ms |
94648 KB |
Output is correct |
| 18 |
Correct |
152 ms |
94648 KB |
Output is correct |
| 19 |
Correct |
149 ms |
94648 KB |
Output is correct |
| 20 |
Correct |
146 ms |
103724 KB |
Output is correct |
| 21 |
Correct |
145 ms |
103724 KB |
Output is correct |
