oj.uz

Submission #570276

# Submission time Handle Problem Language Result Execution time Memory
570276 2022-05-29T06:37:41 Z 600Mihnea Nuclearia (CEOI15_nuclearia) C++17
30 / 100
 1000 ms 198648 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

signed main() {
  ios::sync_with_stdio(0); cin.tie(0);

 /// freopen ("input.txt", "r", stdin);

  bool Inverse = 0;

  int n, m;
  cin >> n >> m;
  if (n > m) {
    Inverse = 1;
    swap(n, m);
  }
  assert(n <= m);
  vector<vector<ll>> radiation(n + 2, vector<ll> (m + 2, 0)), v(n + 2, vector<ll> (m + 2, 0)), jmen(n + 2, vector<ll> (m + 2, 0));

  function<void(int, int, int, int, int)> proc = [&] (int dist, int r, int c, int a, int b) {
    int stop = min(max(m - c, c - 1), a / b);
    assert(a - dist * b >= 1);
    int L = max(1, c - dist), R = min(m, c + dist);
    jmen[r][L] += (a - dist * b);
    jmen[r][R + 1] -= (a - dist * b);
    if (dist + 1 <= stop) {
      if (dist + 1 <= min(stop, m - c)) {
        L = c + dist + 1;
        R = min(c + stop, m);
        assert(L <= R);
        for (int c2 = L; c2 <= R; c2++) {
          v[r][c2] += a + 1LL * b * c;
          v[r][c2] -= 1LL * b * c2;
        }
      }
      if (dist + 1 <= min(stop, c - 1)) {
        L = max(c - stop, 1);
        R = c - dist - 1;
        assert(L <= R);
        for (int c2 = L; c2 <= R; c2++) {
          v[r][c2] += a - 1LL * b * c;
          v[r][c2] += 1LL * b * c2;
        }
      }
    }
  };

  int ops;
  cin >> ops;
  for (int i = 1; i <= ops; i++) {
    int r, c, a, b;
    cin >> r >> c >> a >> b;
    if (Inverse) {
      swap(r, c);
    }
    for (int r2 = 1; r2 <= n; r2++) {
      for (int c2 = 1; c2 <= m; c2++) {
        int dist = max(abs(r - r2), abs(c - c2));
        radiation[r2][c2] += max(0LL, a - 1LL * b * dist);
      }
    }

    for (int dist = 0; (r + dist <= n || r - dist >= 1) && a - dist * b >= 1; dist++) {
      if (r + dist <= n) {
        proc(dist, r + dist, c, a, b);
      }
      if (r - dist >= 1 && dist >= 1) {
        proc(dist, r - dist, c, a, b);
      }
    }
  }
  for (int r = 1; r <= n; r++) {
    for (int c = 1; c <= m; c++) {
      jmen[r][c] += jmen[r][c - 1];
      v[r][c] += jmen[r][c];
    }
  }
  assert(v == radiation);

  {
    /// transform the radiation in the form of prefix rectangle sum

    for (int i = 1; i <= n; i++) {
      ll cur = 0;
      for (int j = 1; j <= m; j++) {
        cur += radiation[i][j];
        radiation[i][j] = radiation[i - 1][j] + cur;
      }
    }
  }

  int q;
  cin >> q;
  while (q--) {
    int r1, c1, r2, c2;
    cin >> r1 >> c1 >> r2 >> c2;
    if (Inverse) {
      swap(r1, c1);
      swap(r2, c2);
    }
    ll total = radiation[r2][c2] - radiation[r1 - 1][c2] - radiation[r2][c1 - 1] + radiation[r1 - 1][c1 - 1];
    ll area = (r2 - r1 + 1) * (c2 - c1 + 1);

    cout << total / area + (total % area >= area - total % area) << "\n";
  }
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 393 ms 196012 KB Output is correct
2 Correct 66 ms 3116 KB Output is correct
3 Correct 62 ms 2648 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 381 ms 196012 KB Output is correct
2 Correct 58 ms 3088 KB Output is correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 317 ms 59232 KB Output is correct
2 Correct 60 ms 3028 KB Output is correct

Subtask #4
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 315 ms 65948 KB Output is correct
2 Correct 58 ms 3064 KB Output is correct

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 294 ms 198648 KB Output is correct
2 Correct 74 ms 3304 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 408 ms 81440 KB Output is correct
2 Correct 60 ms 3036 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 422 ms 62168 KB Output is correct
2 Correct 66 ms 3356 KB Output is correct

Subtask #8
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 378 ms 54016 KB Output is correct
2 Correct 58 ms 3088 KB Output is correct

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1102 ms 196004 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1093 ms 196052 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #11
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1090 ms 59340 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #12
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1089 ms 59340 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #13
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1090 ms 60588 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #14
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1090 ms 59340 KB Time limit exceeded
2 Halted 0 ms 0 KB -