Submission #229135

#	Time	Username	Problem	Language	Result	Execution time	Memory
229135		Vimmer	Maja (COCI18_maja)	C++14	55 / 110	6 ms	512 KiB

maja

#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], 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);
        }
    cout << ans << endl;
}

• Subtask 1: 11 / 11
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 11 / 11
• Subtask 5: 0 / 11
• Subtask 6: 0 / 11
• Subtask 7: 0 / 11
• Subtask 8: 0 / 11
• Subtask 9: 11 / 11
• Subtask 10: 0 / 11