oj.uz

Submission #60598

# Submission time Handle Problem Language Result Execution time Memory
60598 2018-07-24T11:25:50 Z paulica Nuclearia (CEOI15_nuclearia) C++14
55 / 100
 1000 ms 337820 KB 
#include <bits/stdc++.h>
using namespace std;

#define _ << " _ " <<
#define TRACE(x) cout << #x << " = " << x << endl

typedef long long ll;

int w, h, n, q;
vector<vector<ll>> s, a, b;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> w >> h;

    w += 4;
    h += 4;
    
    bool flip = false;
    if (w > h) {
        swap(w, h);
        flip = true;
    }

    s.resize(w);
    a.resize(w);
    b.resize(w);

    for (int i = 0; i < w; i++) {
        s[i].resize(h);
        a[i].resize(h);
        b[i].resize(h);
    }

    cin >> n;

    int x, y, k, lo, hi, l, r;
    ll ai, bi;

    int absj;

    for (int i = 0; i < n; i++) {
        cin >> x >> y >> ai >> bi;

        if (flip) swap(x, y);

        k = ai / bi;

        lo = max(1, y - k);
        hi = min(h - 2, y + k + 1);

        for (int j = max(-k, -x + 1); j <= min(k, w - 2 - x); j++) {
            absj = abs(j);

            l = max(lo, y - absj);
            r = min(hi, y + absj + 1);

            a[x + j][lo] += ai - bi * y;
            a[x + j][l] += bi * (y - absj);
            a[x + j][r] += bi * (y + absj);
            a[x + j][hi] += -ai - bi * y;

            b[x + j][lo] += bi;
            b[x + j][l] -= bi;
            b[x + j][r] -= bi;
            b[x + j][hi] += bi;
        }
    }
//    assert(false);

    for (int i = 1; i < w; i++) {
        for (int j = 1; j < h; j++) {
            a[i][j] += a[i][j - 1];
            b[i][j] += b[i][j - 1];

            s[i][j] = a[i][j] + b[i][j] * j 
                    + s[i - 1][j]
                    + s[i][j - 1]
                    - s[i - 1][j - 1];
        }
    }

    cin >> q;
    for (int i = 0; i < q; i++) {
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;

        if (flip) {
            swap(x1, y1);
            swap(x2, y2);
        }

        ll sum = s[x2][y2]
               - s[x1 - 1][y2]
               - s[x2][y1 - 1]
               + s[x1 - 1][y1 - 1];

        ll cnt = (x2 - x1 + 1) * (y2 - y1 + 1);

        cout << (sum + cnt / 2) / cnt << "\n";
    }

    return 0;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 314 ms 293920 KB Output is correct
2 Correct 108 ms 293920 KB Output is correct
3 Correct 136 ms 293920 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 363 ms 294128 KB Output is correct
2 Correct 138 ms 294128 KB Output is correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 294128 KB Output is correct
2 Correct 91 ms 294128 KB Output is correct

Subtask #4
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 294128 KB Output is correct
2 Correct 108 ms 294128 KB Output is correct

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 522 ms 305716 KB Output is correct
2 Correct 94 ms 305716 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 344 ms 305716 KB Output is correct
2 Correct 119 ms 305716 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 256 ms 305716 KB Output is correct
2 Correct 112 ms 305716 KB Output is correct

Subtask #8
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 277 ms 305716 KB Output is correct
2 Correct 106 ms 305716 KB Output is correct

Subtask #9
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 825 ms 331120 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 743 ms 337820 KB Output is correct

Subtask #11
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1061 ms 337820 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 1050 ms 337820 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 1074 ms 337820 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 1089 ms 337820 KB Time limit exceeded
2 Halted 0 ms 0 KB -