結果

問題 No.1490 スライムと爆弾
ユーザー rniyarniya
提出日時 2021-04-23 22:16:35
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 265 ms / 2,000 ms
コード長 5,383 bytes
コンパイル時間 2,167 ms
コンパイル使用メモリ 209,436 KB
実行使用メモリ 36,608 KB
最終ジャッジ日時 2024-07-04 08:12:20
合計ジャッジ時間 5,714 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 2 ms
6,944 KB
testcase_05 AC 2 ms
6,944 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 2 ms
6,944 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 AC 2 ms
6,944 KB
testcase_10 AC 2 ms
6,940 KB
testcase_11 AC 2 ms
6,944 KB
testcase_12 AC 2 ms
6,944 KB
testcase_13 AC 72 ms
17,792 KB
testcase_14 AC 94 ms
22,912 KB
testcase_15 AC 70 ms
18,944 KB
testcase_16 AC 52 ms
13,184 KB
testcase_17 AC 52 ms
21,504 KB
testcase_18 AC 90 ms
22,784 KB
testcase_19 AC 117 ms
20,992 KB
testcase_20 AC 91 ms
17,536 KB
testcase_21 AC 70 ms
16,896 KB
testcase_22 AC 61 ms
14,976 KB
testcase_23 AC 2 ms
6,940 KB
testcase_24 AC 2 ms
6,940 KB
testcase_25 AC 220 ms
36,608 KB
testcase_26 AC 220 ms
36,608 KB
testcase_27 AC 215 ms
36,608 KB
testcase_28 AC 209 ms
34,816 KB
testcase_29 AC 213 ms
34,688 KB
testcase_30 AC 265 ms
36,608 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
#pragma endregion

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int H, W, N, M;
    cin >> H >> W >> N >> M;
    vector<int> T(N), U(N), L(N), R(N), A(N);
    for (int i = 0; i < N; i++) cin >> T[i] >> U[i] >> L[i] >> R[i] >> A[i], T[i]--, L[i]--;
    vector<vector<ll>> sum(H + 2, vector<ll>(W + 2, 0));
    for (; M--;) {
        int X, Y, B, C;
        cin >> X >> Y >> B >> C;
        X--, Y--;
        int mx = max(0, X - B + 1), Mx = min(H + 1, X + B + 2);
        int my = max(0, Y - B + 1), My = min(W + 1, Y + B + 2);
        sum[mx][my] += C;
        sum[Mx][My] += C;
        sum[mx][My] -= C;
        sum[Mx][my] -= C;
    }

    for (int i = 0; i < H + 2; i++) {
        for (int j = 0; j < W + 1; j++) {
            sum[i][j + 1] += sum[i][j];
        }
    }
    for (int j = 0; j < W + 2; j++) {
        for (int i = 0; i < H + 1; i++) {
            sum[i + 1][j] += sum[i][j];
        }
    }

    for (int i = 0; i < H + 2; i++) {
        for (int j = 0; j < W + 1; j++) {
            sum[i][j + 1] += sum[i][j];
        }
    }
    for (int j = 0; j < W + 2; j++) {
        for (int i = 0; i < H + 1; i++) {
            sum[i + 1][j] += sum[i][j];
        }
    }

    int ans = 0;
    for (int i = 0; i < N; i++) {
        ll damage = sum[U[i]][R[i]] - sum[U[i]][L[i]] - sum[T[i]][R[i]] + sum[T[i]][L[i]];
        if (A[i] > damage) ans++;
    }
    cout << ans << '\n';
    return 0;
}
0