oj.uz

답안 #565357

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
565357 2022-05-20T18:39:48 Z piOOE Nuclearia (CEOI15_nuclearia) C++17
64 / 100
 1000 ms 728848 KB 
//#define _GLIBCXX_DEBUG



#include <bits/stdc++.h>

#pragma GCC optimize ("O3,Ofast,fast-math,unroll-loops")
#pragma GCC target ("avx2,tune=native")

using namespace std;

#define all(x) begin(x), end(x)
#define sz(x) ((int)size(x))
#define trace(x) cout << #x << ": " << (x) << endl;

typedef long long ll;

const int N = 200001, M = 2500002;
int X[N], Y[N], A[N], B[N], n, m, k;
vector<ll> DL[M], DR[M], UR[M], UL[M], pref[M];

ll L[M], R[M], U[M], D[M];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n >> m >> k;
    for (int i = 1; i <= k; ++i) {
        cin >> X[i] >> Y[i] >> A[i] >> B[i];
    }
    
    for (int i = 0; i <= n + 1; ++i) {
        DL[i].resize(m + 2), DR[i].resize(m + 2), UR[i].resize(m + 2), UL[i].resize(m + 2), pref[i].resize(m + 2);
    }

    auto addDL = [](int x, int y, int len, ll val) {
        UR[x][y] += val;
        if (x + len - 1 <= n && y - len + 1 >= 1) {
            UR[x + len][y - len] -= val;
        } else {
            int mn = min(n - x + 1, y) - 1;
            x += mn, y -= mn;
            UR[x + 1][y - 1] -= val;
            len -= mn;
            if (y == 1) {
                U[x + 1] += val;
                if (x + len <= n) {
                    U[x + len] -= val;
                }
            }
        }
    };

    auto addDR = [](int x, int y, int len, ll val) {
        UL[x][y] += val;
        if (x + len - 1 <= n && y + len - 1 <= m) {
            UL[x + len][y + len] -= val;
        }
    };

    auto addUL = [](int x, int y, int len, ll val) {
        pref[1][1] += val * max(0, len - max(x, y));
        DR[x][y] += val;
        if (x - len + 1 >= 1 && y - len + 1 >= 1) {
            DR[x - len][y - len] -= val;
        } else {
            int mn = min(x, y) - 1;
            x -= mn, y -= mn;
            DR[x - 1][y - 1] -= val;
            len -= mn;
            if (y == 1) {
                D[x - 1] += val;
                if (x - len >= 1) {
                    D[x - len] -= val;
                }
            } else if (x == 1) {
                R[y - 1] += val;
                if (y - len >= 1) {
                    R[y - len] -= val;
                }
            }
        }
    };

    auto addUR = [](int x, int y, int len, ll val) {
        DL[x][y] += val;
        if (x - len + 1 >= 1 && y + len - 1 <= m) {
            DL[x - len][y + len] -= val;
        } else {
            int mn = min(x, m - y + 1) - 1;
            x -= mn, y += mn;
            DL[x - 1][y + 1] -= val;
            len -= mn;
            if (x == 1) {
                L[y + 1] += val;
                if (y + len <= m) {
                    L[y + len] -= val;
                }
            }
        }
    };

    auto addRect = [&](int x1, int y1, int x2, int y2, ll val) {
        x1 = max(x1, 1), y1 = max(y1, 1), y2 = min(y2, m), x2 = min(x2, n);
        pref[x1][y1] += val;
        pref[x2 + 1][y2 + 1] += val;
        pref[x1][y2 + 1] -= val;
        pref[x2 + 1][y1] -= val;
    };

    for (int i = 1; i <= k; ++i) {
        int h = A[i] / B[i];
        addRect(X[i] - h, Y[i] - h, X[i] + h, Y[i] + h, A[i] % B[i]);
        addUR(X[i], Y[i] + 1, h, -B[i]);
        addUL(X[i], Y[i], h, B[i]);
        addDR(X[i] + 1, Y[i] + 1, h, B[i]);
        addDL(X[i] + 1, Y[i], h, -B[i]);
    }
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            UR[i][j] += UR[i - 1][j + 1];
            UL[i][j] += UL[i - 1][j - 1];
        }
    }

    for (int i = n; i >= 1; --i) {
        for (int j = 1; j <= m; ++j) {
            DL[i][j] += DL[i + 1][j - 1];
            DR[i][j] += DR[i + 1][j + 1];
        }
    }

    for (int i = 1; i <= m; ++i) {
        L[i] += L[i - 1];
        pref[1][i] += L[i];
    }

    for (int i = m; i >= 1; --i) {
        R[i] += R[i + 1];
        pref[1][i] += R[i];
    }

    for (int i = 1; i <= n; ++i) {
        U[i] += U[i - 1];
        pref[i][1] += U[i];
    }

    for (int i = n; i >= 1; --i) {
        D[i] += D[i + 1];
        pref[i][1] += D[i];
    }

    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            pref[i][j] += DR[i][j] + DL[i][j] + UR[i][j] + UL[i][j];
            pref[i][j] = pref[i][j] + pref[i - 1][j] + pref[i][j - 1] - pref[i - 1][j - 1];
        }
    }

    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            pref[i][j] = pref[i][j] + pref[i - 1][j] + pref[i][j - 1] - pref[i - 1][j - 1];
        }
    }

    int q;
    cin >> q;
    for (int i = 1; i <= q; ++i) {
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        ll sum = pref[x2][y2] - pref[x1 - 1][y2] - pref[x2][y1 - 1] + pref[x1 - 1][y1 - 1];
        ll S = (x2 - x1 + 1) * (ll) (y2 - y1 + 1);
        cout << (sum * 2 / S + 1) / 2 << '\n';
    }
    return 0;
}

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1080 ms 724504 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1049 ms 724392 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 214 ms 392696 KB Output is correct
2 Correct 204 ms 296212 KB Output is correct

Subtask #4
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 196 ms 403788 KB Output is correct
2 Correct 193 ms 296216 KB Output is correct

Subtask #5
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1072 ms 726764 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 602 ms 468516 KB Output is correct
2 Correct 208 ms 296268 KB Output is correct

Subtask #7
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 285 ms 394608 KB Output is correct
2 Correct 215 ms 296536 KB Output is correct

Subtask #8
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 455 ms 421656 KB Output is correct
2 Correct 227 ms 296260 KB Output is correct

Subtask #9
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1117 ms 728848 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1113 ms 728332 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #11
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 460 ms 397840 KB Output is correct
2 Correct 432 ms 397372 KB Output is correct

Subtask #12
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 419 ms 397440 KB Output is correct
2 Correct 489 ms 397376 KB Output is correct

Subtask #13
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 455 ms 401520 KB Output is correct
2 Correct 468 ms 398896 KB Output is correct

Subtask #14
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 429 ms 398108 KB Output is correct
2 Correct 527 ms 632080 KB Output is correct