oj.uz

Submission #110163

# Submission time Handle Problem Language Result Execution time Memory
110163 2019-05-09T17:22:38 Z naoai Nuclearia (CEOI15_nuclearia) C++14
30 / 100
 1000 ms 153476 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long i64;
const int nmax = 25e5;

//i64 **s;

i64 sum[nmax + 1];

struct aintnod {
    i64 s, r;
} aint[4 * nmax + 1];

void update (int nod, int x, int y, int st, int dr, i64 a, i64 b) {
    if (st <= x && y <= dr) {
        aint[nod].s += a + (x - st) * b;
        aint[nod].r += b;
        return ;
    }

    int mij = (x + y) / 2;
    if (st <= mij)
        update(2 * nod, x, mij, st, dr, a, b);
    if (mij < dr)
        update(2 * nod + 1, mij + 1, y, st, dr, a, b);
}

void build (int nod, int x, int y) {
    if (x == y) {
        sum[x] = aint[nod].s;
        return ;
    }

    int mij = (x + y) / 2;

    update(2 * nod, x, mij, x, mij, aint[nod].s, aint[nod].r);
    update(2 * nod + 1, mij + 1, y, mij + 1, y, aint[nod].s + aint[nod].r * (mij + 1 - x), aint[nod].r);

    build(2 * nod, x, mij);
    build(2 * nod + 1, mij + 1, y);
}

int main () {
    int w, h, n;
    cin >> w >> h >> n;

    if (h != 1) {
        i64 s[w+1][h+1];
        memset(s, 0, sizeof(s));
//        s = new i64*[w + 1];
//        for (int i = 0; i <= w; ++ i)
//            s[i] = new i64[h + 1]();
//
//        for (int i = 0; i <= w; ++ i)
//            for (int j = 0; j <= h; ++ j)
//                assert(s[i][j] == 0);

        for (int i = 1; i <= n; ++ i) {
            int x, y, a, b;
            cin >> x >> y >> a >> b;

            for (int j = 1; j <= w; ++ j)
                for (int k = 1; k <= h; ++ k) {
                    int c = max(0LL, a - 1LL * b * max(abs(x - j), abs(y - k)));
                    s[j][k] += c;
                }
        }

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

        int q;
        cin >> q;
        for (int i = 1; i <= q; ++ i) {
            int a, b, x, y;
            cin >> a >> b >> x >> y;

            i64 total = s[x][y] - s[a - 1][y] - s[x][b - 1] + s[a - 1][b - 1];
            i64 arie = (x - a + 1) * (y - b + 1);
            i64 r = total / arie;
            if (total % arie >= (arie + 1) / 2) ++ r;

            cout << r << "\n";
        }
    } else if (h == 1) {
        for (int i = 1; i <= n; ++ i) {
            int x, y, a, b;
            cin >> x >> y >> a >> b;

            int pfin = min(w, x + a / b);
            update(1, 1, w, x, pfin, a, -b);

            pfin = max(1, x - a / b);
            if (pfin <= x - 1)
                update(1, 1, w, pfin, x - 1, a - b * (x - pfin), b);
        }

        build(1, 1, w);
        for (int i = 1; i <= w; ++ i)
            sum[i] += sum[i - 1];

        int q;
        cin >> q;
        for (int i = 1; i <= q; ++ i) {
            int a, b, x, y;
            cin >> a >> b >> x >> y;

            i64 total = sum[x] - sum[a - 1];
            i64 arie = (x - a + 1);
            i64 r = total / arie;
            if (total % arie >= (arie + 1) / 2) ++ r;

            cout << r << "\n";
        }
        exit(0);
    }

    return 0;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 178 ms 151288 KB Output is correct
2 Correct 507 ms 2808 KB Output is correct
3 Correct 457 ms 2500 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 213 ms 151152 KB Output is correct
2 Correct 456 ms 2740 KB Output is correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 278 ms 19968 KB Output is correct
2 Correct 459 ms 2868 KB Output is correct

Subtask #4
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 265 ms 20900 KB Output is correct
2 Correct 477 ms 2756 KB Output is correct

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 781 ms 153476 KB Output is correct
2 Correct 505 ms 3064 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 656 ms 43556 KB Output is correct
2 Correct 445 ms 2808 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 766 ms 22280 KB Output is correct
2 Correct 542 ms 3084 KB Output is correct

Subtask #8
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 938 ms 14472 KB Output is correct
2 Correct 505 ms 4428 KB Output is correct

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1073 ms 152528 KB Time limit exceeded

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1093 ms 152768 KB Time limit exceeded

Subtask #11
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1062 ms 19968 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 1067 ms 19940 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 19968 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 1071 ms 19960 KB Time limit exceeded
2 Halted 0 ms 0 KB -