結果

問題 No.755 Zero-Sum Rectangle
ユーザー iiljjiiljj
提出日時 2020-07-21 21:47:56
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 843 ms / 2,000 ms
コード長 7,536 bytes
コンパイル時間 2,179 ms
コンパイル使用メモリ 211,204 KB
実行使用メモリ 10,624 KB
最終ジャッジ日時 2024-06-10 01:34:55
合計ジャッジ時間 12,599 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
10,624 KB
testcase_01 AC 604 ms
5,248 KB
testcase_02 AC 464 ms
5,376 KB
testcase_03 AC 664 ms
5,376 KB
testcase_04 AC 747 ms
5,376 KB
testcase_05 AC 807 ms
5,376 KB
testcase_06 AC 507 ms
5,376 KB
testcase_07 AC 486 ms
5,376 KB
testcase_08 AC 672 ms
5,376 KB
testcase_09 AC 756 ms
5,376 KB
testcase_10 AC 843 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
evil_1 TLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

/* #region Head */

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

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c)                                                                                                        \
    sort(ALL(c));                                                                                                      \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());

#define endl '\n'
#define sqrt sqrtl
#define floor floorl
#define log2 log2l

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec) is >> x;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T> ostream &operator>>(ostream &os, vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) { return out_iter(os, map_var); }
template <typename T, typename U> ostream &operator<<(ostream &os, um<T, U> &map_var) {
    os << "{";
    REPI(itr, map_var) {
        auto [key, value] = *itr;
        os << "(" << key << ", " << value << ")";
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, pq<T> &pq_var) {
    pq<T> pq_cp(pq_var);
    os << "{";
    if (!pq_cp.empty()) {
        os << pq_cp.top(), pq_cp.pop();
        while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
    }
    return os << "}";
}

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#define DEBUG_

#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                                      \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                                    \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                                        \
            << "    ",                                                                                                 \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
        cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH) cout << unitbuf;
    }
} ATCODER_INITIALIZE;

void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }

/* #endregion */

/* #region Cumulative2D */

template <typename T> struct Cumulative2D {
    using F = function<T(T, T)>;

    vc<vc<T>> cum;
    F add;
    F subtract;
    Cumulative2D(vc<vc<T>> &data, int h, int w, F add, F subtract) : cum(h, vc<T>(w)), add(add), subtract(subtract) {
        REP(i, 0, h) REP(j, 0, w) {
            if (i == 0) {
                if (j == 0)
                    cum[i][j] = data[i][j];
                else
                    cum[i][j] = add(cum[i][j - 1], data[i][j]);
            } else {
                cum[i][j] = add(cum[i - 1][j], data[i][j]);
                if (j > 0) cum[i][j] = subtract(add(cum[i][j], cum[i][j - 1]), cum[i - 1][j - 1]);
            }
        }
    }

    // 0-indexed 閉区間で (行0, 列0, 行1, 列1) を渡す．
    T query(int i0, int j0, int i1, int j1) {
        T ret = cum[i1][j1];
        if (i0 == 0) {
            if (j0 > 0) ret = subtract(ret, cum[i1][j0 - 1]);
        } else {
            ret = subtract(ret, cum[i0 - 1][j1]);
            if (j0 > 0) ret = add(subtract(ret, cum[i1][j0 - 1]), cum[i0 - 1][j0 - 1]);
        }
        return ret;
    }
};

/* #endregion */

// Problem
void solve() {
    ll n, m;
    cin >> n >> m;
    vvll a(m, vll(m));
    cin >> a;
    vll x(n), y(n);
    REP(i, 0, n) {
        cin >> x[i] >> y[i];
        --x[i], --y[i];
    }

    auto add = [](ll a, ll b) -> ll { return a + b; };
    auto subtract = [](ll a, ll b) -> ll { return a - b; };
    Cumulative2D<ll> cum(a, m, m, add, subtract);

    REP(i, 0, n) {
        ll ret = 0;
        REPM(i0, 0, x[i]) REP(i1, x[i], m) REPM(j0, 0, y[i]) REP(j1, y[i], m) {
            ll v = cum.query(i0, j0, i1, j1);
            if (v == 0) ret++;
        }
        cout << ret << endl;
    }
}

// entry point
int main() {
    solve();
    return 0;
}
0