제출 #229055

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
229055		ne4eHbKa	Maja (COCI18_maja)	C++17	55 / 110	6 ms	512 KiB

maja

//{ <defines>
#include <bits/stdc++.h>
using namespace std;

//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,-O3")

#define fr(i, n) for(int i = 0; i < n; ++i)
#define fo(n) fr(i, n)

#define re return
#define ef else if
#define ifn(x) if(!(x))
#define _  << ' ' <<

#define ft first
#define sd second
#define ve vector
#define pb push_back
#define eb emplace_back

#define sz(x) int((x).size())
#define ip2(x) (1 << (x))
#define lp2(x) (1ll << (x))
#define bnd(x) x.begin(), x.end()
#define clr(x, y) memset((x), (y), sizeof (x))

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef ve<int> vi;

inline ll time() {re chrono :: system_clock().now().time_since_epoch().count();}
mt19937 rnd(time());
mt19937_64 RND(time());

template<typename t> inline void umin(t &a, t b) {a = min(a, b);}
template<typename t> inline void umax(t &a, t b) {a = max(a, b);}

int md = 998244353;

inline int m_add(int&a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_sum(int a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_mul(int&a, int b) {re a = 1ll * a * b % md;}
inline int m_prod(int a, int b) {re 1ll * a * b % md;}

int m_bpow(ll A, ll b) {
    int a = A % md;
    ll ans = 1;
    for(ll p = lp2(63 - __builtin_clzll(b)); p; p >>= 1) {
        (ans *= ans) %= md;
        if(p & b)
            (ans *= a) %= md;
    }
    re ans;
}

//const ld pi = arg(complex<ld>(-1, 0));
//const ld pi2 = pi + pi;
const int oo = 2e9;
const ll OO = 4e18;
//} </defines>
const int N = 105;

int n, m, a, b, k;
ll f[N][N], c[N][N];

void solve() {
    cin >> n >> m >> a >> b >> k;
    --a, --b;
    fo(n) fr(j, m) cin >> c[i][j];
    f[a][b] = 0;
    for(int i = a; i < n; ++i)
        for(int j = b; j < m; ++j)
            f[i][j] = c[i][j] + (
                i == a
                    ? j == b
                        ? 0
                        : f[i][j - 1]
                    : j == b
                        ? f[i - 1][j]
                        : max(f[i - 1][j], f[i][j - 1])
            );
    for(int i = a; i >= 0; --i)
        for(int j = b; j < m; ++j)
            f[i][j] = c[i][j] + (
                i == a
                    ? j == b
                        ? 0
                        : f[i][j - 1]
                    : j == b
                        ? f[i + 1][j]
                        : max(f[i + 1][j], f[i][j - 1])
            );
    for(int i = a; i < n; ++i)
        for(int j = b; j >= 0; --j)
            f[i][j] = c[i][j] + (
                i == a
                    ? j == b
                        ? 0
                        : f[i][j + 1]
                    : j == b
                        ? f[i - 1][j]
                        : max(f[i - 1][j], f[i][j + 1])
            );
    for(int i = a; i >= 0; --i)
        for(int j = b; j >= 0; --j)
            f[i][j] = c[i][j] + (
                i == a
                    ? j == b
                        ? 0
                        : f[i][j + 1]
                    : j == b
                        ? f[i + 1][j]
                        : max(f[i + 1][j], f[i][j + 1])
            );
    ll ans = 0;
    k >>= 1;
    fr(i, n) fr(j, m) {
        int t = k - abs(i - a) - abs(j - b);
        if(t < 0) continue;
        ll v = 0;
        if(i) umax(v, c[i - 1][j]);
        if(j) umax(v, c[i][j - 1]);
        if(i + 1 < n) umax(v, c[i + 1][j]);
        if(j + 1 < m) umax(v, c[i][j + 1]);
        v += c[i][j];
        umax(ans, f[i][j] * 2 + v * t - c[i][j]);
    }
    cout << ans << endl;
}

int main() {
#ifdef _LOCAL
    freopen("in.txt", "r", stdin);
    int tests; cin >> tests;
    for(int test = 1; test <= tests; ++test) {
        cerr << test << " {\n";
        solve();
        cerr << "}\n\n";
    }
#else
    //freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
    ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
    solve();
#endif
    return 0;
}

• 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