oj.uz

Submission #948971

# Submission time Handle Problem Language Result Execution time Memory
948971 2024-03-18T17:47:32 Z fskarica Nuclearia (CEOI15_nuclearia) C++14
30 / 100
 1000 ms 550600 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define fi first
#define se second
#define pii pair<ll, ll>

ll n, m;
ll x, y, a, b;
ll sirina, x2, y2, a2;
ll q, p;
vector <vector<ll>> kvadrat;
vector <vector<ll>> trokut;
vector <vector<ll>> trokut2;
vector <ll> bla;
ll zbr, sol, cnt;

bool granice(int x, int y) {
    if (1 <= x && x <= n && 1 <= y && y <= m) return true;
    return false;
}

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

    cin >> n >> m;

    vector<vector<ll>> mat(n + 2, vector<ll>(m + 2));
    vector<vector<ll>> kvadrat(n + 2, vector<ll>(m + 2));
    vector<vector<ll>> trokut(n + 2, vector<ll>(m + 2));
    vector<vector<ll>> trokut2(n + 2, vector<ll>(m + 2));

    cin >> p;
    for (int i = 0; i < p; i++) {
        cin >> x >> y >> a >> b;

        x2 = x;
        y2 = y;
        a2 = a;

        mat[x][y] += a;

        sirina = 1;
        while (a > 0 && granice(x, 1)) {
            trokut[x][max(1ll, y)] += a;
            trokut[x][max(1ll, min(m + 1, y + sirina))] -= a;

            x--;
            y--;
            sirina += 2;
            a -= b;
        }

        x = x2;
        y = y2;
        a = a2;
        sirina = 1;
        while (a > 0 && granice(x, 1)) {
            trokut[x][max(1ll, y)] += a;
            trokut[x][max(1ll, min(m + 1, y + sirina))] -= a;

            x++;
            y--;
            sirina += 2;
            a -= b;
        }

        x = x2;
        y = y2;
        a = a2;
        sirina = 1;
        while (a > 0 && granice(1, y)) {
            trokut2[max(1ll, x + 1)][y] += a;
            trokut2[max(1ll, min(n + 1, x + sirina - 1))][y] -= a;

            x--;
            y++;
            sirina += 2;
            a -= b;
        }

        x = x2;
        y = y2;
        a = a2;
        sirina = 1;
        while (a > 0 && granice(1, y)) {
            trokut2[max(1ll, x + 1)][y] += a;
            trokut2[max(1ll, min(n + 1, x + sirina - 1))][y] -= a;

            x--;
            y--;
            sirina += 2;
            a -= b;
        }
    }

    for (int i = 1; i <= n; i++) {
        zbr = 0;

        for (int j = 1; j <= m; j++) {
            zbr += trokut[i][j];
            mat[i][j] += zbr;
        }
    }

    for (int j = 1; j <= m; j++) {
        zbr = 0;

        for (int i = 1; i <= n; i++) {
            zbr += trokut2[i][j];
            mat[i][j] += zbr;
        }
    }

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

    cin >> q;
    while (q--) {
        cin >> x >> y >> x2 >> y2;

        sol = kvadrat[x2][y2] - kvadrat[x2][y - 1] - kvadrat[x - 1][y2] + kvadrat[x - 1][y - 1];
        cnt = ((x2 - x + 1) * (y2 - y + 1));

        if (sol % cnt >= (cnt + 1) / 2) sol = sol / ((x2 - x + 1) * (y2 - y + 1)) + 1;
        else sol = sol / ((x2 - x + 1) * (y2 - y + 1));

        cout << sol << "\n";
    }

    return 0;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 973 ms 548428 KB Output is correct
2 Correct 48 ms 2640 KB Output is correct
3 Correct 45 ms 2388 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 991 ms 548476 KB Output is correct
2 Correct 47 ms 2816 KB Output is correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 79844 KB Output is correct
2 Correct 46 ms 2856 KB Output is correct

Subtask #4
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 87428 KB Output is correct
2 Correct 51 ms 2772 KB Output is correct

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 660 ms 550600 KB Output is correct
2 Correct 53 ms 3156 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 690 ms 221852 KB Output is correct
2 Correct 47 ms 2656 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 81352 KB Output is correct
2 Correct 52 ms 2900 KB Output is correct

Subtask #8
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 437 ms 143668 KB Output is correct
2 Correct 47 ms 2640 KB Output is correct

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1081 ms 548380 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 1073 ms 548300 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 1043 ms 79696 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 1032 ms 79184 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 1038 ms 80568 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 1016 ms 79960 KB Time limit exceeded
2 Halted 0 ms 0 KB -