Submission #990150

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
990150	2024-05-29T17:18:01 Z	LOLOLO	Maja (COCI18_maja)	C++17	Compilation error	0 ms	0 KB

maja

#include <bits/stdc++.h>
using namespace std;
typedef long double ll;

#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (ll)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 1e2 + 10;
ll mat[N][N], sum[N][N], dp[N * N][N][N];

ll solve() {
    ll k;
    int n, m, a, b;
    cin >> n >> m >> a >> b >> k;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cin >> mat[i][j];
        }
    }

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            sum[i][j] = max({mat[i - 1][j], mat[i][j - 1], mat[i + 1][j], mat[i][j + 1]}) + mat[i][j];
        }
    }

    for (int i = 0; i <= n + 1; i++) {
        for (int j = 0; j <= m + 1; j++) {
            dp[0][i][j] = -1e18;
        }
    }

    dp[0][a][b] = 0;

    ll sz = n * m;

    for (int id = 1; id <= sz; id++) {
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                dp[id][i][j] = max({dp[id - 1][i - 1][j], dp[id - 1][i][j - 1], dp[id - 1][i + 1][j], dp[id - 1][i][j + 1]}) + mat[i][j];
            }
        }
    }

    ll ans = 0;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            for (int id = 1; id * 2 <= k && id <= sz; id++) {
                ans = max(ans, dp[id][i][j] * (ll)2 + sum[i][j] * ((k - id * 2) / 2) - mat[i][j]);
            }
        }
    }

    return ans;
}

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

    int t = 1;
    //cin >> t;

    while (t--) {
        cout << solve() << '\n';
    }

    return 0;
} 
 

Compilation message

/usr/bin/ld: failed to convert GOTPCREL relocation; relink with --no-relax
collect2: error: ld returned 1 exit status