oj.uz

답안 #552015

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
552015 2022-04-22T08:10:17 Z Aldas25 Nuclearia (CEOI15_nuclearia) C++14
34 / 100
 1000 ms 1045264 KB 
//#pragma GCC optimize ("O3")
//#pragma GCC optimize ("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

#define FAST_IO ios_base::sync_with_stdio(0); cin.tie(nullptr)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define REP(n) FOR(O, 1, (n))
#define f first
#define pb push_back
#define s second
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef long double ld;
//mt19937 rng(std::chrono::steady_clock().now().time_since_epoch().count());

const int MAXN = 2500100;

int w, h, n, q;
vector<vl> grid;
vector<vl> pref;
vl tmp;

//ll yk[MAXN], yb[MAXN];
//vector<vl> yk[2], yb[2], xk[2], xb[2];
vector<pair<int, ll>> xk[MAXN][2], xb[MAXN][2];
vector<pair<int, ll>> yk[MAXN][2], yb[MAXN][2];

ll d (ll x1, ll y11, ll x2, ll y2) {
    return max(abs(x1-x2), abs(y11-y2));
}

int getmxD (ll a, ll b) {
    return (a/b);
}

void addPlant (ll x, ll y, ll a, ll b) {
    int mxd = getmxD(a, b);

    int istr0 = h+y-x;
    int istr1 = x+y;

    /// x

    int frx = max((ll)1, x-mxd);
    int tox = min((ll)h, x+mxd);

    /// [frx; x]

    xb[frx][0].pb({istr0, a-b*x});
    xk[frx][0].pb({istr0, b});
    xb[frx][1].pb({istr1+1, -a + b*x});
    xk[frx][1].pb({istr1+1, -b});

    xb[x+1][0].pb({istr0, -a+b*x});
    xk[x+1][0].pb({istr0, -b});
    xb[x+1][1].pb({istr1+1, a - b*x});
    xk[x+1][1].pb({istr1+1, b});

    /// (x; tox]

    xb[x+1][1].pb({istr1, a+b*x});
    xk[x+1][1].pb({istr1, -b});
    xb[x+1][0].pb({istr0+1, -a-b*x});
    xk[x+1][0].pb({istr0+1, b});

    xb[tox+1][1].pb({istr1, -a-b*x});
    xk[tox+1][1].pb({istr1, +b});
    xb[tox+1][0].pb({istr0+1, a+b*x});
    xk[tox+1][0].pb({istr0+1, -b});


    /// y

    istr0 = w+x-y;
    int fry = max((ll)1, y-mxd);
    int toy = min((ll)w, y+mxd);
//cout << " istr0 " << istr0 << " istr1 = " << istr1 << " fry = " << fry << " toy=" << toy << endl;
    /// [y-mxd; y)

    yb[fry][0].pb({istr0+1, a-b*y});
    yk[fry][0].pb({istr0+1, b});
    yb[fry][1].pb({istr1, -a+b*y});
    yk[fry][1].pb({istr1, -b});

    yb[y][0].pb({istr0+1, -a+b*y});
    yk[y][0].pb({istr0+1, -b});
    yb[y][1].pb({istr1, a-b*y});
    yk[y][1].pb({istr1, b});

    /// (y; toy]

    yb[y+1][1].pb({istr1+1, a+b*y});
    yk[y+1][1].pb({istr1+1, -b});
    yb[y+1][0].pb({istr0, -a-b*y});
    yk[y+1][0].pb({istr0, b});

    yb[toy+1][1].pb({istr1+1, -a-b*y});
    yk[toy+1][1].pb({istr1+1, b});
    yb[toy+1][0].pb({istr0, a+b*y});
    yk[toy+1][0].pb({istr0, -b});
}

ll prefb[2][MAXN], prefk[2][MAXN]; /// prefixes for diagonals
ll sb[2][MAXN], sk[2][MAXN];

void calcGrid () {
    /// x

    FOR(i, 0, w+h+5) FOR(k, 0, 1) prefb[k][i]= prefk[k][i] = 0;

    FOR(x, 1, h) {
        //cout << " x = " << x << endl;
        //ll sb = 0, sk = 0;
        FOR(k, 0, 1) {
            for (auto p : xb[x][k]) {
                int id = p.f;
                ll val = p.s;
                prefb[k][id] += val;
            }
            for (auto p : xk[x][k]) {
                int id = p.f;
                ll val = p.s;
                prefk[k][id] += val;
            }
        }

        FOR(istr, 0, w+h+5) {
            //cout << "   istr = " << istr << endl;
            FOR(k, 0, 1) {
                sb[k][istr] = sk[k][istr] = 0;
                if (istr > 0) sb[k][istr] += sb[k][istr-1];
                if (istr > 0) sk[k][istr] += sk[k][istr-1];
                sb[k][istr] += prefb[k][istr];
                sk[k][istr] += prefk[k][istr];

               // cout << "     k = " << k << endl;
             //   cout << "       prefk = " << prefk[k][istr] << " prefb = " << prefb[k][istr] << endl;
           //     cout << "       sk = " << sk[k][istr] << " sb = " << sb[k][istr] << endl;
            }
        }

        FOR(y, 1, w) {
            int istr0 = h+y-x;
            int istr1 = x+y;
            ll cur0 = sb[0][istr0] + sk[0][istr0] * x;
            ll cur1 = sb[1][istr1] + sk[1][istr1] * x;
         //   cout << "  x = " << x << " y = " << y << " cur0 = " << cur0 << " cur1 = " << cur1 << endl;
            grid[x][y] += cur0 + cur1;
        }
    }

    /// y

    FOR(i, 0, w+h+5) FOR(k, 0, 1) prefb[k][i]= prefk[k][i] = 0;

    FOR(y, 1, w) {
       // cout << " y = " << y << endl;
        //ll sb = 0, sk = 0;
        FOR(k, 0, 1) {
            for (auto p : yb[y][k]) {
                int id = p.f;
                ll val = p.s;
                prefb[k][id] += val;
            }
            for (auto p : yk[y][k]) {
                int id = p.f;
                ll val = p.s;
                prefk[k][id] += val;
            }
        }

        FOR(istr, 0, w+h+5) {
            //cout << "   istr = " << istr << endl;
            FOR(k, 0, 1) {
                sb[k][istr] = sk[k][istr] = 0;
                if (istr > 0) sb[k][istr] += sb[k][istr-1];
                if (istr > 0) sk[k][istr] += sk[k][istr-1];
                sb[k][istr] += prefb[k][istr];
                sk[k][istr] += prefk[k][istr];

                //cout << "     k = " << k << endl;
                //cout << "       prefk = " << prefk[k][istr] << " prefb = " << prefb[k][istr] << endl;
                //cout << "       sk = " << sk[k][istr] << " sb = " << sb[k][istr] << endl;
            }
        }

        FOR(x, 1, h) {
            int istr0 = w+x-y;
            int istr1 = x+y;
            ll cur0 = sb[0][istr0] + sk[0][istr0] * y;
            ll cur1 = sb[1][istr1] + sk[1][istr1] * y;
           // cout << "  x = " << x << " y = " << y << " cur0 = " << cur0 << " cur1 = " << cur1 << endl;
            grid[x][y] += cur0 + cur1;
        }
    }
}

void calcPref () {
    FOR(i, 1, h) {
        ll pr = 0;
        FOR(j, 1, w) {
            pref[i][j] += pref[i-1][j];
            pr += grid[i][j];
            pref[i][j] += pr;
        }
    }
}

ll sum (int x1, int y11, int x2, int y2) {
    ll ret = pref[x2][y2];
    ret -= pref[x1-1][y2];
    ret -= pref[x2][y11-1];
    ret += pref[x1-1][y11-1];
    return ret;
}

int main()
{
    FAST_IO;

    cin >> w >> h;

    REP(w+1) tmp.pb(0);
    REP(h+1) {
        grid.pb(tmp);
        pref.pb(tmp);
       // sb.pb(tmp);
       // sk.pb(tmp);
        //FOR(k, 0, 1) {
          //  yb[k].pb(tmp);
           // yk[k].pb(tmp);
            //xb[k].pb(tmp);
            //xk[k].pb(tmp);
        //}
    }
    /*tmp.clear();
    REP(2*h+5) tmp.pb(0);
    REP(2*w+5) {
        //grid.pb(tmp);
        //pref.pb(tmp);
        FOR(k, 0, 1) {
            //yb[k].pb(tmp);
            //yk[k].pb(tmp);
            xb[k].pb(tmp);
            xk[k].pb(tmp);
        }
    }*/

    cin >> n;
    REP(n) {
        int x, y;
        ll a, b;
        cin >> x >> y >> a >> b;
        swap(x, y);
        addPlant (x, y, a, b);
    }

    //cout << " asdas" << endl;

    calcGrid();
    calcPref();

    //FOR(i, 1, h) FOR(j, 1, w) cout << " i = " << i << " j = " << j << " grid = " << grid[i][j]<< " pref = " << pref[i][j] << endl;

    /*cout << " grid:" << endl;
    FOR(i, 1, h) {
        FOR(j, 1, w) cout << grid[i][j] << " ";
        cout << endl;
    }
    cout << " pref:" << endl;
    FOR(i, 1, h) {
        FOR(j, 1, w) cout << pref[i][j] << " ";
        cout << endl;
    }*/

    cin >> q;
    REP(q) {
        int x1, y11, x2, y2;
        cin >> x1 >> y11 >> x2 >> y2;
        swap(x1, y11);
        swap(x2, y2);
        ll s = sum(x1, y11, x2, y2);
        ll sz = ((ll)(x2-x1+1)) * ((ll)(y2-y11+1));
        ll ans = (s+(sz/2))/sz;
        cout << ans << "\n";
       // cout <<endl;
    }

    return 0;
}


/*

4 1
2
1 1 5 1
3 1 8 7

4 1
1
3 1 8 7

*/

Subtask #1
0 / 3.0

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

Subtask #2
0 / 2.0

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

Subtask #3
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 364 ms 509756 KB Output is correct
2 Correct 301 ms 474100 KB Output is correct

Subtask #4
0 / 2.0

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

Subtask #5
0 / 6.0

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

Subtask #6
0 / 4.0

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

Subtask #7
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 494 ms 515780 KB Output is correct
2 Correct 286 ms 475416 KB Output is correct

Subtask #8
0 / 4.0

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

Subtask #9
0 / 15.0

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

Subtask #10
0 / 10.0

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

Subtask #11
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 803 ms 669460 KB Output is correct
2 Correct 676 ms 671788 KB Output is correct

Subtask #12
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 667 ms 673928 KB Output is correct
2 Correct 751 ms 668508 KB Output is correct

Subtask #13
0 / 12.0

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

Subtask #14
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 725 ms 639132 KB Output is correct
2 Execution timed out 1136 ms 1045264 KB Time limit exceeded
3 Halted 0 ms 0 KB -