답안 #540235

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
540235	2022-03-19T17:17:34 Z	alextodoran	Nuclearia (CEOI15_nuclearia)	C++17	8 / 100	1000 ms	798576 KB

nuclearia

/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N_MAX = 2500000;

vector <ll> mat[N_MAX + 2];
vector <ll> UL[N_MAX + 2];
vector <ll> UR[N_MAX + 2];
vector <ll> DL[N_MAX + 2];
vector <ll> DR[N_MAX + 2];
ll U[N_MAX + 2];
ll D[N_MAX + 2];
ll L[N_MAX + 2];
ll R[N_MAX + 2];

int N, M;

void addUL (int x, int y, int len, int val) {
    mat[1][1] += (ll) 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;
            }
        }
    }
}
void addUR (int x, int y, int len, int 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;
            }
        }
    }
}
void addDL (int x, int y, int len, int 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;
            }
        }
    }
}
void addDR (int x, int y, int len, int val) {
    UL[x][y] += val;
    if (x + len <= N && y + len <= M) {
        UL[x + len][y + len] -= val;
    }
}
void add (int x, int y, int len, int val) {
    int x1 = x - len + 1, y1 = y - len + 1;
    int x2 = x + len - 1, y2 = y + len - 1;
    x1 = max(1, x1); y1 = max(1, y1);
    x2 = min(N, x2); y2 = min(M, y2);
    mat[x1][y1] += val;
    mat[x1][y2 + 1] -= val;
    mat[x2 + 1][y1] -= val;
    mat[x2 + 1][y2 + 1] += val;
}

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

    cin >> N >> M;
    for (int i = 0; i <= N + 1; i++) {
        mat[i] = vector <ll> (M + 2, 0);
        UL[i] = vector <ll> (M + 2, 0);
        UR[i] = vector <ll> (M + 2, 0);
        DL[i] = vector <ll> (M + 2, 0);
        DR[i] = vector <ll> (M + 2, 0);
    }

    int K;
    cin >> K;
    while (K--) {
        int x, y, a, b;
        cin >> x >> y >> a >> b;
        int len = a / b;
        addUL(x, y, len, +b);
        addUR(x, y + 1, len, -b);
        addDL(x + 1, y, len, -b);
        addDR(x + 1, y + 1, len, +b);
        add(x, y, len + 1, a % b);
    }

    for (int i = 1; i <= N; i++) {
        U[i] += U[i - 1];
        mat[i][1] += U[i];
    }
    for (int i = N; i >= 1; i--) {
        D[i] += D[i + 1];
        mat[i][1] += D[i];
    }
    for (int j = 1; j <= M; j++) {
        L[j] += L[j - 1];
        mat[1][j] += L[j];
    }
    for (int j = M; j >= 1; j--) {
        R[j] += R[j + 1];
        mat[1][j] += R[j];
    }
    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= M; j++) {
            UL[i][j] += UL[i - 1][j - 1];
            UR[i][j] += UR[i - 1][j + 1];
        }
    }
    for (int i = N; i >= 1; i--) {
        for (int j = M; j >= 1; j--) {
            DL[i][j] += DL[i + 1][j - 1];
            DR[i][j] += DR[i + 1][j + 1];
        }
    }

    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= M; j++) {
            mat[i][j] += UL[i][j];
            mat[i][j] += UR[i][j];
            mat[i][j] += DL[i][j];
            mat[i][j] += DR[i][j];
            mat[i][j] += mat[i - 1][j] + mat[i][j - 1] - mat[i - 1][j - 1];
        }
    }
    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= M; j++) {
            mat[i][j] += mat[i - 1][j] + mat[i][j - 1] - mat[i - 1][j - 1];
        }
    }

    int Q;
    cin >> Q;
    while (Q--) {
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        ll sum = mat[x2][y2] - mat[x1 - 1][y2] - mat[x2][y1 - 1] + mat[x1 - 1][y1 - 1];
        ll area = (ll) (x2 - x1 + 1) * (y2 - y1 + 1);
        ll answer = sum / area;
        if (sum % area >= (area + 1) / 2 && area != 1) {
            answer++;
        }
        cout << answer << "\n";
    }

    return 0;
}

Subtask #1
0 / 3.0

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

Subtask #2
2.0 / 2.0

#	결과	실행 시간	메모리	Grader output
1	Correct	928 ms	724424 KB	Output is correct
2	Correct	186 ms	298232 KB	Output is correct

Subtask #3
0 / 3.0

#	결과	실행 시간	메모리	Grader output
1	Correct	209 ms	392624 KB	Output is correct
2	Runtime error	416 ms	598160 KB	Execution killed with signal 6
3	Halted	0 ms	0 KB	-

Subtask #4
2.0 / 2.0

#	결과	실행 시간	메모리	Grader output
1	Correct	229 ms	403780 KB	Output is correct
2	Correct	195 ms	296288 KB	Output is correct

Subtask #5
0 / 6.0

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

Subtask #6
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	592 ms	468504 KB	Output is correct
2	Correct	189 ms	296308 KB	Output is correct

Subtask #7
0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	304 ms	394656 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #8
0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	446 ms	421568 KB	Output is correct
2	Runtime error	409 ms	598224 KB	Execution killed with signal 6
3	Halted	0 ms	0 KB	-

Subtask #9
0 / 15.0

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

Subtask #10
0 / 10.0

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

Subtask #11
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	435 ms	395028 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #12
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	421 ms	394668 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #13
0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	377 ms	398432 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #14
0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	718 ms	798576 KB	Execution killed with signal 6
2	Halted	0 ms	0 KB	-

답안 #540235

Compilation message