# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
229163 |
2020-05-03T14:21:58 Z |
Vimmer |
Maja (COCI18_maja) |
C++14 |
|
312 ms |
888 KB |
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")
#define F first
#define S second
#define sz(x) ll(x.size())
#define pb push_back
#define N 100005
#define MOD ll(998244353)
using namespace std;
//using namespace __gnu_pbds;
typedef long double ld;
typedef long long ll;
typedef short int si;
//typedef tree <int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
ll dp[105][105], f[2][105][105], ar[105][105], ans;
int main()
{
//freopen("input.txt", "r", stdin);
ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll n, m, a, b, k;
cin >> n >> m >> a >> b >> k;
for (ll i = 1; i <= n; i++)
for (ll j = 1; j <= m; j++) cin >> ar[i][j];
for (ll i = a; i <= n; i++)
for (ll j = b; j <= m; j++)
{
if (i == a && j == b) continue;
dp[i][j] = max(dp[i][j], ar[i][j] + max((i - 1 >= a ? dp[i - 1][j] : 0), (j - 1 >= b ? dp[i][j - 1] : 0)));
}
for (ll i = a; i >= 1; i--)
for (ll j = b; j >= 1; j--)
{
if (i == a && j == b) continue;
dp[i][j] = max(dp[i][j], ar[i][j] + max((i + 1 <= a ? dp[i + 1][j] : 0), (j + 1 <= b ? dp[i][j + 1] : 0)));
}
for (ll i = a; i >= 1; i--)
for (ll j = b; j <= m; j++)
{
if (i == a && j == b) continue;
dp[i][j] = max(dp[i][j], ar[i][j] + max((i + 1 <= a ? dp[i + 1][j] : 0), (j - 1 >= b ? dp[i][j - 1] : 0)));
}
for (ll i = a; i <= n; i++)
for (ll j = b; j >= 1; j--)
{
if (i == a && j == b) continue;
dp[i][j] = max(dp[i][j], ar[i][j] + max((i - 1 >= a ? dp[i - 1][j] : 0), (j + 1 <= b ? dp[i][j + 1] : 0)));
}
for (ll i = 1; i <= n; i++)
for (ll j = 1; j <= m; j++)
{
if (i == a && j == b) continue;
ll rst = abs(a - i) + abs(b - j);
if (rst * 2 > k) continue;
ll sum = 2 * dp[i][j];
ll kol = k - (rst * 2);
ll mx = 0;
if (i - 1 >= 1) mx = max(mx, ar[i - 1][j]);
if (j - 1 >= 1) mx = max(mx, ar[i][j - 1]);
if (i + 1 <= n) mx = max(mx, ar[i + 1][j]);
if (j + 1 <= m) mx = max(mx, ar[i][j + 1]);
kol /= 2;
sum += mx * kol;
sum += ar[i][j] * (kol - 1);
ans = max(ans, sum);
}
int mn = min(n * m, k / 2);
for (int i = 0; i <= n; i++)
for (int j = 0; j <= m; j++) f[0][i][j] = f[1][i][j] = -1e18;
f[0][a][b] = 0;
for (int u = 0; u < mn; u++)
{
int nt = (u + 1) % 2, t = u % 2;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) f[nt][i][j] = -1e18;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) f[nt][i][j] = ar[i][j] + max(i - 1 == 0 ? -1e18 : f[t][i - 1][j], max(i + 1 > n ? -1e18 : f[t][i + 1][j], max(j - 1 == 0 ? -1e18 : f[t][i][j - 1], j + 1 > m ? -1e18 : f[t][i][j + 1])));
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
{
ll sum = 2 * f[mn % 2][i][j];
ll rst = k - mn * 2;
ll mx = 0;
if (i - 1 >= 1) mx = max(mx, ar[i - 1][j]);
if (j - 1 >= 1) mx = max(mx, ar[i][j - 1]);
if (i + 1 <= n) mx = max(mx, ar[i + 1][j]);
if (j + 1 <= m) mx = max(mx, ar[i][j + 1]);
sum += max(0ll, (rst / 2)) * mx;
sum += max(0ll, ((rst / 2) - 1)) * ar[i][j];
if (sum == 2 * f[mn % 2][i][j]) sum -= ar[i][j];
ans = max(ans, sum);
}
cout << ans << endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
33 ms |
512 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
3 |
Correct |
256 ms |
888 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
384 KB |
Output is correct |
2 |
Correct |
177 ms |
640 KB |
Output is correct |
3 |
Correct |
243 ms |
772 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
183 ms |
888 KB |
Output is correct |
2 |
Correct |
312 ms |
888 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
22 ms |
512 KB |
Output is correct |
2 |
Correct |
27 ms |
640 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
512 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
20 ms |
640 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |