oj.uz

Submission #1091785

# Submission time Handle Problem Language Result Execution time Memory
1091785 2024-09-22T05:30:34 Z anhthi Maja (COCI18_maja) C++14
110 / 110
 417 ms 1464 KB 
#include <bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define ll long long
#define mp(x, y) make_pair(x, y)
#define sz(v) ((int) (v).size())
#define all(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define BIT(x, y) (((x) >> (y)) & 1)
#define pb push_back
#define max_rng *max_element
#define min_rng *min_element
#define rep(i, n) for(int i = 1, _n = (n); i <= _n; ++i)
#define forn(i, a, b) for(int i = (a), _b = (b); i <= _b; ++i)
#define ford(i, a, b) for(int i = (a), _b = (b); i >= _b; --i)

template <class X, class Y>
    inline bool maximize(X &x, Y y) {
        return (x < y ? x = y, true : false);
    }

template <class X, class Y>
    inline bool minimize(X &x, Y y) {
        return (x > y ? x = y, true : false);
    }

template <class X>
    inline void compress(vector<X> &a) {
        sort(all(a));
        a.resize(unique(all(a)) - a.begin());
    }

int ctz(ll x) { return __builtin_ctzll(x); }
int lg(ll x) { return 63 - __builtin_clzll(x); }
int popcount(ll x) { return __builtin_popcount(x); }

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) {
    return l + abs((ll) rng()) % (r - l + 1);
}

const ll oo = (ll) 1e17;
const int inf = (int) 1e9, mod = (int) 998244353;

const int mxn = 2e2 + 5, mxm = 2e2 + 5, base = 307, LOG = 19;

void add(int &x, int y) { x += y; if (x >= mod) x -= mod; }
void sub(int &x, int y) { x -= y; if (x < 0) x += mod; }

int subtask;
int n, m, k;
ll a[mxn][mxn];

int u, v;

ll Max[mxn][mxn];
int dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};

ll f[2][mxn][mxn];

int main(void) {
    // think what before starting to code
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    #define TASK "partner"
    if (fopen(TASK".inp", "r")) {
        freopen(TASK".inp", "r", stdin);
        freopen(TASK".out", "w", stdout);
    }
    cin >> n >> m >> u >> v >> k;
    rep(i, n) rep(j, m) cin >> a[i][j];

    forn(i, 1, n) forn(j, 1, m) {
        forn(t, 0, 3) {
            maximize(Max[i][j], a[i + dx[t]][j + dy[t]]);
        }
    }
    memset(f, -0x3f, sizeof f);

    bool now = 0;
    f[now][u][v] = a[u][v];

    ll ans = 0;
    forn(turn, 1, min(k / 2, n * m)) {
        forn(i, 1, n) forn(j, 1, m) {
            forn(t, 0, 3) {
                maximize(f[now ^ 1][i][j], f[now][i + dx[t]][j + dy[t]] + a[i][j]);
            }
            maximize(ans, 2LL * f[now ^ 1][i][j] - a[i][j] + 1LL * (a[i][j] + Max[i][j]) * (k - 2 * turn) / 2);
        }
        memset(f[now], -0x3f, sizeof f[now]);
        now ^= 1;
    }

    cout << ans;

    return 0;
}

Compilation message

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

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 3 ms 1116 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 976 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 1116 KB Output is correct
2 Correct 2 ms 1116 KB Output is correct
3 Correct 371 ms 1372 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1116 KB Output is correct
2 Correct 282 ms 1404 KB Output is correct
3 Correct 366 ms 1464 KB Output is correct

Subtask #7
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 228 ms 1372 KB Output is correct
2 Correct 417 ms 1456 KB Output is correct

Subtask #8
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 1112 KB Output is correct
2 Correct 29 ms 1372 KB Output is correct

Subtask #9
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1116 KB Output is correct
2 Correct 4 ms 1284 KB Output is correct

Subtask #10
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 1372 KB Output is correct
2 Correct 3 ms 1116 KB Output is correct