oj.uz

답안 #151615

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
151615 2019-09-03T19:58:33 Z evpipis Nuclearia (CEOI15_nuclearia) C++11
92 / 100
 1000 ms 892132 KB 
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;

//#pragma loop(no_vector)

#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef pair<int, int> ii;
typedef long long ll;
typedef pair<ll, ll> pll;

const int len = 2e5+5;
pair<ii, ii> arr[len];
vector<vector<ll> > pref;
int n, m, k;

struct node{
    ll ax, ay, b;

    node(ll ax_ = 0, ll ay_ = 0, ll b_ = 0){
        ax = ax_;
        ay = ay_;
        b = b_;
    }

    node operator+(const node &other) const{
        return node(ax+other.ax, ay+other.ay, b+other.b);
    }

    void operator+=(const node &other){
        ax += other.ax;
        ay += other.ay;
        b += other.b;
    }

    void operator-=(const node &other){
        ax -= other.ax;
        ay -= other.ay;
        b -= other.b;
    }
};

vector<vector<node> > ver, diag1, diag2;

void read(int &res){
    char c;
    while (c = getchar(), c < '0' || c > '9'){}

    res = c-'0';
    while (c = getchar(), '0' <= c && c <= '9'){
        res = res*10+c-'0';
    }
}

int main(){
    read(m), read(n), read(k);
    for (int i = 0; i < k; i++)
        read(arr[i].fi.se), read(arr[i].fi.fi), read(arr[i].se.fi), read(arr[i].se.se);

    pref.resize(n+1);
    for (int i = 0; i <= n; i++)
        pref[i].resize(m+1, 0);

    ver.resize(n+2);
    for (int i = 0; i <= n+1; i++)
        ver[i].resize(m+2, node());

    diag1.resize(n+2);
    for (int i = 0; i <= n+1; i++)
        diag1[i].resize(m+2, node());

    diag2.resize(n+2);
    for (int i = 0; i <= n+1; i++)
        diag2[i].resize(m+2, node());

    for (int i = 0; i < k; i++){
        int r = arr[i].fi.fi, c = arr[i].fi.se;
        int a = arr[i].se.fi, b = arr[i].se.se;
        int s = a/b;
        int r0 = max(1, r-s), r1 = min(n, r+s);
        int c0 = max(1, c-s), c1 = min(m, c+s);

        // case 1
        node val = node(0, b, a-c*1LL*b);
        ver[r0][c0] += val;
        ver[r1+1][c0] -= val;

        // case 4
        val = node(0, b, -a-b*1LL*c);
        if (c1 < m){
            ver[r0][c1+1] += val;
            ver[r1+1][c1+1] -= val;
        }

        // case 2
        val = node(b, -b, b*1LL*c-b*1LL*r);
        if ((r-r0) <= (c-c0)){
            diag1[r0][c-r+r0] += val;
        }
        else{
            diag1[r-c+c0][c0] += val;
            ver[r0][c0] += val;
            ver[r-c+c0][c0] -= val;
        }

        if ((r1-r) <= (c1-c)){
            diag1[r1+1][c+r1-r+1] -= val;
        }

        // case 3
        val = node(-b, -b, b*1LL*c+b*1LL*r);
        if ((r1-r) <= (c-c0)){
            diag2[r1][c-r1+r] += val;
        }
        else{
            diag2[r+c-c0][c0] += val;
            ver[r+c-c0+1][c0] += val;
            ver[r1+1][c0] -= val;
        }

        if ((r-r0) <= (c1-c)){
            diag2[r0-1][c+r-r0+1] -= val;
        }
    }

    for (int x = 1; x <= n; x++)
        for (int y = 1; y <= m; y++){
            ver[x][y] += ver[x-1][y];
            diag1[x][y] += diag1[x-1][y-1];
        }

    for (int x = n; x >= 1; x--)
        for (int y = 1; y <= m; y++){
            diag2[x][y] += diag2[x+1][y-1];
        }

    for (int x = 1; x <= n; x++)
        for (int y = 1; y <= m; y++){
            ver[x][y] += (diag1[x][y] + diag2[x][y] + ver[x][y-1]);

            pref[x][y] = ver[x][y].ax*x + ver[x][y].ay*y + ver[x][y].b;
            pref[x][y] += pref[x-1][y]+pref[x][y-1]-pref[x-1][y-1];
        }

    int q;
    read(q);
    for (int i = 0; i < q; i++){
        int x1, y1, x2, y2;
        read(y1), read(x1), read(y2), read(x2);
        ll sum = (pref[x2][y2]-pref[x1-1][y2]-pref[x2][y1-1]+pref[x1-1][y1-1]);
        ll many = (x2-x1+1)*1LL*(y2-y1+1);
        ll ans = sum/many;
        if ((sum%many)*2 >= many)
            ans++;
        printf("%lld\n", ans);
    }
    return 0;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 538 ms 567928 KB Output is correct
2 Correct 62 ms 3576 KB Output is correct
3 Correct 50 ms 3320 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 510 ms 567800 KB Output is correct
2 Correct 60 ms 3572 KB Output is correct

Subtask #3
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 215 ms 196856 KB Output is correct
2 Correct 57 ms 3636 KB Output is correct

Subtask #4
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 294 ms 233208 KB Output is correct
2 Correct 60 ms 3576 KB Output is correct

Subtask #5
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 632 ms 571512 KB Output is correct
2 Correct 68 ms 4088 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 376 ms 231288 KB Output is correct
2 Correct 61 ms 3576 KB Output is correct

Subtask #7
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 342 ms 201408 KB Output is correct
2 Correct 63 ms 3960 KB Output is correct

Subtask #8
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 265 ms 156828 KB Output is correct
2 Correct 57 ms 3704 KB Output is correct

Subtask #9
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 755 ms 574712 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 749 ms 574712 KB Output is correct

Subtask #11
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 452 ms 203384 KB Output is correct
2 Correct 466 ms 203512 KB Output is correct

Subtask #12
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 459 ms 203424 KB Output is correct
2 Correct 491 ms 204296 KB Output is correct

Subtask #13
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 453 ms 208632 KB Output is correct
2 Correct 412 ms 205688 KB Output is correct

Subtask #14
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 430 ms 203728 KB Output is correct
2 Execution timed out 1118 ms 892132 KB Time limit exceeded