oj.uz

답안 #197069

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
197069 2020-01-18T12:33:48 Z Pankin Maxcomp (info1cup18_maxcomp) C++14
15 / 100
 7 ms 4344 KB 
#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("Ofast")
#pragma GCC optimize("-O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
*/

#define mp make_pair
#define ll long long
#define ld long double
#define pb push_back
#define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define fs first
#define sc second
#define getfiles ifstream cin("input.txt"); ofstream cout("output.txt");
#define endl '\n'
#define pii pair<int, int>

const int INF = 2000000005;
const ll BIG_INF = 2000000000000000005;
const int mod = 1000000007;
const int P = 31;
const ld PI = 3.141592653589793238462643;
const double eps = 1e-9;

using namespace std;
using namespace __gnu_pbds;

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

mt19937 rng(1999999973);

typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;

const int N = 1005;
int a[N][N], n, m, tUp[4 * N], tDown[4 * N], ptUp[4 * N], ptDown[4 * N], sufMin[N][N], ans = -INF;

inline void push(int v, int tl, int tr, int t[4 * N], int pt[4 * N]) {
    t[v] += pt[v];
    if (tl != tr) {
        pt[v * 2] += pt[v];
        pt[v * 2 + 1] += pt[v];
    }
    pt[v] = 0;
}

void make_val(int v, int tl, int tr, int i, int val, int t[N], int pt[N]) {
    push(v, tl, tr, t, pt);
    if (i < tl || i > tr)
        return;
    if (tl == tr) {
        t[v] = val;
        return;
    }

    int tm = (tl + tr) / 2;
    make_val(v * 2, tl, tm, i, val, t, pt);
    make_val(v * 2 + 1, tm + 1, tr, i, val, t, pt);

    t[v] = min(t[v * 2], t[v * 2 + 1]);
}

void update(int v, int tl, int tr, int i, int val, int t[N], int pt[N]) {
    push(v, tl, tr, t, pt);
    if (i < tl || i > tr)
        return;
    if (tl == tr) {
        t[v] = min(val, t[v]);
        return;
    }

    int tm = (tl + tr) / 2;
    update(v * 2, tl, tm, i, val, t, pt);
    update(v * 2 + 1, tm + 1, tr, i, val, t, pt);

    t[v] = min(t[v * 2], t[v * 2 + 1]);
}

void inc(int v, int tl, int tr, int l, int r, int delta, int t[N], int pt[N]) {
    push(v, tl, tr, t, pt);
    if (tl > r || tr < l)
        return;
    if (tl >= l && tr <= r) {
        pt[v] += delta;
        push(v, tl, tr, t, pt);
        return;
    }

    int tm = (tl + tr) / 2;
    inc(v * 2, tl, tm, l, r, delta, t, pt);
    inc(v * 2 + 1, tm + 1, tr, l, r, delta, t, pt);

    t[v] = min(t[v * 2], t[v * 2 + 1]);
}

void init() {
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            sufMin[i][j] = INF;
        }
    }
    for (int i = 0; i < 4 * N; i++) {
        tUp[i] = INF;
        tDown[i] = INF;
    }

    for (int j = 0; j < m; j++) {
        for (int i = n - 1; i >= 0; i--) {
            sufMin[j][i] = min(a[i][j] - i, sufMin[j][i + 1]);
        }
    }

    for (int i = 0; i < m; i++) {
        make_val(1, 0, m - 1, i, sufMin[i][0] + i, tDown, ptDown);
    }
}

signed main() {
    fast_io;

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

    init();

    int coef = 1, x = 0, y = 0;
    while(true) {
        ans = max(ans, a[x][y] - tUp[1] - x);
        ans = max(ans, a[x][y] - tDown[1] + x);

        if (!(y + coef >= 0 && y + coef < m)) {
            if (x == n - 1)
                break;
            for (int i = 0; i < m; i++) {
                make_val(1, 0, m - 1, i, sufMin[i][x + 1] + abs(i - y), tDown, ptDown);
                update(1, 0, m - 1, i, a[x][i] + x + abs(i - y), tUp, ptUp);
            }

            x++; coef *= -1;
            continue;
        }

        if (coef == 1) {
            inc(1, 0, m - 1, 0, y, 1, tDown, ptDown);
            inc(1, 0, m - 1, y + 1, m - 1, -1, tDown, ptDown);
            inc(1, 0, m - 1, 0, y, 1, tUp, ptUp);
            inc(1, 0, m - 1, y + 1, m - 1, -1, tUp, ptUp);
        }
        else {
            inc(1, 0, m - 1, y, m, 1, tDown, ptDown);
            inc(1, 0, m - 1, 0, y - 1, -1, tDown, ptDown);
            inc(1, 0, m - 1, y, m, 1, tUp, ptUp);
            inc(1, 0, m - 1, 0, y - 1, -1, tUp, ptUp);
        }

        y += coef;
    }

    cout << ans - 1;

    return 0;
}

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 4344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4344 KB Output is correct
2 Correct 7 ms 4344 KB Output is correct
3 Correct 7 ms 4344 KB Output is correct

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 4344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 4344 KB Output isn't correct
2 Halted 0 ms 0 KB -