#774368 (C++17(clang)) No.1490 スライムと爆弾

• 問題: No.1490 スライムと爆弾
• ユーザー: siman
• 提出日時: 2022-06-29 00:11:41
• 言語: C++17(clang) (17.0.6 + boost 1.87.0)
• 結果: RE
• 実行時間: -
• コード長: 1,824 bytes
• コンパイル時間: 1,765 ms
• コンパイル使用メモリ: 141,300 KB
• 実行使用メモリ: 39,040 KB
• 最終ジャッジ日時: 2024-07-20 22:34:32
• 合計ジャッジ時間: 7,658 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

ファイルパターン	結果
sample	AC * 3
other	AC * 14 WA * 11 RE * 3

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
  int H, W, N, M;
  cin >> H >> W >> N >> M;
  int T[N];
  int U[N];
  int L[N];
  int R[N];
  ll A[N];
  for (int i = 0; i < N; ++i) {
    cin >> T[i] >> U[i] >> L[i] >> R[i] >> A[i];
  }
  int X[M];
  int Y[M];
  int B[M];
  ll C[M];
  for (int i = 0; i < M; ++i) {
    cin >> X[i] >> Y[i] >> B[i] >> C[i];
  }
  ll S[H + 2][W + 2];
  memset(S, 0, sizeof(S));
  for (int i = 0; i < M; ++i) {
    int y = Y[i];
    int x = X[i];
    int b = B[i];
    ll c = C[i];
    int ly = max(1, y - b);
    int lx = max(1, x - b);
    int ry = min(H, y + b);
    int rx = min(W, x + b);
    // fprintf(stderr, "(%d, %d) - (%d, %d)\n", ly, lx, ry, rx);
    S[ly][lx] += c;
    S[ly][rx + 1] -= c;
    S[ry + 1][lx] -= c;
    S[ry + 1][rx + 1] += c;
  }
  for (int i = 0; i < 2; ++i) {
    for (int y = 0; y <= H; ++y) {
      ll sum = 0;
      for (int x = 0; x <= W; ++x) {
        sum += S[y][x];
        S[y][x] = sum;
      }
    }
    for (int x = 1; x <= W; ++x) {
      ll sum = 0;
      for (int y = 1; y <= H; ++y) {
        sum += S[y][x];
        S[y][x] = sum;
      }
    }
  }
  /*
  for (int y = 0; y <= H; ++y) {
    for (int x = 0; x <= W; ++x) {
      cerr << S[y][x] << " ";
    }
    cerr << endl;
  }
  */
  int ans = 0;
  for (int i = 0; i < N; ++i) {
    int ly = T[i];
    int ry = U[i];
    int lx = L[i];
    int rx = R[i];
    // fprintf(stderr, "(%d, %d) - (%d, %d)\n", ly, lx, ry, rx);
    ll damage = S[ry][rx] - S[ry][lx - 1] - S[ly - 1][rx] + S[ly - 1][lx - 1];
    if (damage < A[i]) ++ans;
  }
  cout << ans << endl;
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX