結果
問題 | No.755 Zero-Sum Rectangle |
ユーザー | sten_san |
提出日時 | 2022-01-22 17:07:12 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 141 ms / 2,000 ms |
コード長 | 3,171 bytes |
コンパイル時間 | 2,317 ms |
コンパイル使用メモリ | 206,804 KB |
実行使用メモリ | 13,752 KB |
最終ジャッジ日時 | 2024-07-01 02:19:40 |
合計ジャッジ時間 | 7,129 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
13,752 KB |
testcase_01 | AC | 102 ms
6,940 KB |
testcase_02 | AC | 81 ms
6,940 KB |
testcase_03 | AC | 108 ms
6,940 KB |
testcase_04 | AC | 124 ms
6,944 KB |
testcase_05 | AC | 137 ms
6,940 KB |
testcase_06 | AC | 89 ms
6,940 KB |
testcase_07 | AC | 83 ms
6,940 KB |
testcase_08 | AC | 112 ms
6,944 KB |
testcase_09 | AC | 127 ms
6,940 KB |
testcase_10 | AC | 141 ms
6,940 KB |
testcase_11 | AC | 2 ms
6,944 KB |
evil_1 | TLE | - |
ソースコード
#include <bits/stdc++.h> using namespace std; struct iofast_t { iofast_t() { ios::sync_with_stdio(false); cin.tie(nullptr); } } iofast; struct uns_t {} uns; template <typename Element, typename Head, typename ...Args> auto vec(Element init, Head arg, Args ...args) { if constexpr (sizeof...(Args) == 0) return vector(arg, init); else return vector(arg, vec(init, args...)); } template <typename Element, typename Head, typename ...Args> auto vec(uns_t, Head arg, Args ...args) { return vec(Element(), arg, args...); } template <typename Container> auto distance(const Container &c, decltype(begin(c)) iter) { return distance(begin(c), iter); } template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>> auto isort(RIter first, RIter last, Compare comp = Compare()) { vector<int> i(distance(first, last)); iota(begin(i), end(i), 0); sort(begin(i), end(i), [&](auto x, auto y) { return comp(*(first + x), *(first + y)); }); return i; } template <typename, template <typename> typename, typename = void_t<>> struct detect : false_type {}; template <typename T, template <typename> typename Check> struct detect<T, Check, void_t<Check<T>>> : true_type {}; template <typename T, template <typename> typename Check> constexpr inline bool detect_v = detect<T, Check>::value; template <typename T> using has_member_sort = decltype(declval<T>().sort()); template <typename Container, typename Compare = less<typename Container::value_type>> auto sorted(Container c, Compare comp = Compare()) { if constexpr (detect_v<Container, has_member_sort>) { c.sort(comp); return c; } else { sort(begin(c), end(c), comp); return c; } } template <typename Container, typename Compare = equal_to<typename Container::value_type>> auto uniqued(Container c, Compare comp = Compare()) { c.erase(unique(begin(c), end(c), comp), end(c)); return c; } template <typename T, typename Compare = less<T>> T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); } template <typename T, typename Compare = less<T>> T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); } int main() { int n, m; cin >> n >> m; auto a = vec<int64_t>(uns, m, m); for (auto &r : a) { for (auto &e : r) { cin >> e; } } auto b = vec<int64_t>(0, m + 1, m + 1); for (int i = 0; i < m; ++i) { for (int j = 0; j < m; ++j) { b[i + 1][j + 1] = b[i][j + 1] + b[i + 1][j] - b[i][j] + a[i][j]; } } auto sum = [&](int y1, int x1, int y2, int x2) { return b[y2][x2] - b[y1][x2] - b[y2][x1] + b[y1][x1]; }; while (n--) { int y, x; cin >> y >> x; int ans = 0; for (int y1 = 0; y1 < y; ++y1) { for (int x1 = 0; x1 < x; ++x1) { for (int y2 = y; y2 <= m; ++y2) { for (int x2 = x; x2 <= m; ++x2) { ans += (sum(y1, x1, y2, x2) == 0); } } } } cout << ans << endl; } }