Submission #1022545

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <tuple>
#include <cassert>
#define repeat(i,n) for (int i = 0; (i) < (n); ++(i))
#define whole(f,x,...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)
typedef long long ll;
using namespace std;
template <typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template <typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }
pair<int, bool> func(vector<ll> const & a, vector<ll> b) {
    int w = a.size();
    if (a < b) {
        return { 0, false };
    } else if (a[0] > b[0]) {
        return { -1, false };
    } else {
        assert (a[0] == b[0]);
        if (w == 1) {
            return { -1, false };
        } else {
            assert (b[0] >= 1);
            assert (a[1] >= b[1]);
            ll k = (a[1] - b[1] + b[0]-1) / b[0];
            if (b[1] + k * b[0] > a[1]) {
                return { k, false };
            } else {
                assert (b[1] + k * b[0] == a[1]);
                if (w == 2) {
                    return { k, true };
                } else {
                    repeat (j,k) {
                        repeat (i,w-1) {
                            if (b[i] > a[i]) break;
                            b[i+1] += b[i];
                            assert (b[i+1] >= 1);
                        }
                        if (b[2] > a[2]) {
                            b[1] = a[1];
                            break;
                        }
                    }
                    return { k + (a > b), a == b };
                }
            }
        }
    }
}
int main() {
    int h, w; cin >> h >> w;
    vector<vector<ll> > f = vectors(h, w, ll());
    repeat (y,h) repeat (x,w) cin >> f[y][x];
    ll ans = 0;
    ll acc = 0;
    repeat (y,h-1) {
        vector<ll> const & a = f[y];
        vector<ll> const & b = f[y+1];
        if (a < b) {
            int k; bool is_just; tie(k, is_just) = func(b, a);
            if (k == -1) {
                acc = 0;
            } else {
                acc = max<int>(0, acc-k+1);
            }
        } else {
            int k; bool is_just; tie(k, is_just) = func(a, b);
            if (k == -1) {
                ans = -1;
                break;
            } else {
                acc += k + is_just;
            }
        }
        ans += acc;
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result