Submission #1262214

#	Time	Username	Problem	Language	Result	Execution time	Memory
1262214		CodeLakVN	Maja (COCI18_maja)	C++20	44 / 110	9 ms	584 KiB

maja

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

#define task "main"
#define F first
#define S second
#define ii pair<int, int>
#define il pair<int, long long>
#define li pair<long long, int>
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)

template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }

template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }

template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }

const int MAX_N = 110;
const long long INF = (long long)1e18;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, 1, 0, -1};

int nRow, nCol, a, b, k;
int cost[MAX_N][MAX_N];

bool valid(int x, int y) {
    return x > 0 && x <= nRow && y > 0 && y <= nCol;
}

namespace sub1 {
    long long dp[2][MAX_N][MAX_N];

    void solve() {
        memset(dp, -0x3f, sizeof(dp));
        dp[0][a][b] = 0;

        bool cur = 1;

        FOR(_, 1, k) {
            FOR(i, 1, nRow) FOR(j, 1, nCol) {
                dp[cur][i][j] = -INF;
                FOR(t, 0, 3) {
                    int x = i + dx[t], y = j + dy[t];
                    if (!valid(x, y)) continue;
                    maximize(dp[cur][i][j], dp[!cur][x][y]);
                }
                dp[cur][i][j] += cost[i][j];
            }
            cur = !cur;
        }

        cout << dp[!cur][a][b] << "\n";
    }
}

void solve() {
    cin >> nRow >> nCol >> a >> b >> k;
    FOR(i, 1, nRow) FOR(j, 1, nCol) cin >> cost[i][j];

    if (k <= 10000) sub1::solve();
}

int32_t main() {
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    bool multitest = 0;
    int numTest = 1;
    if (multitest) cin >> numTest;

    while (numTest--) {
        solve();
    }

    return 0;
}

/* Lak lu theo dieu nhac!!!! */

Compilation message (stderr)

maja.cpp: In function 'int32_t main()':
maja.cpp:78:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   78 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
maja.cpp:79:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   79 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• 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: 0 / 11
• Subtask 10: 0 / 11