oj.uz

Submission #274874

# Submission time Handle Problem Language Result Execution time Memory
274874 2020-08-19T18:58:14 Z MarcoMeijer Nuclearia (CEOI15_nuclearia) C++14
30 / 100
 1000 ms 553976 KB 
#include <bits/stdc++.h>

using namespace std;

#define REP(a,b,c) for(int a=int(b); a<int(c); a++)     
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)     
#define RE(a,b) REP(a,0,b)
#define RE1(a,b) REP(a,1,b+1)
#define REI(a,b,c) REP(a,b,c+1)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define pb push_back
#define sz size()
#define fi first
#define se second

typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;

template<class T> void IN(T& a) {cin>>a;}
template<class T, class... L> void IN(T& a, L&... b) {IN(a); IN(b...);}
template<class T> void OUT(const T& a) {cout<<a;}
template<class T, class... L> void OUT(const T& a, const L&... b) {OUT(a); OUT(b...);}
template<class... T> void OUTL(const T&... a) {OUT(a..., '\n');}

const int MX = 3e5;
int w, h, n;
int x[MX], y[MX], a[MX], b[MX];
vector<vll> c, d, V, SUM;

int getV(int i, int X, int Y) {
    return a[i] - b[i]*max(abs(x[i]-X), abs(y[i]-Y));
}

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

    // input
    IN(w,h,n);
    RE(i,n) IN(x[i],y[i],a[i],b[i]), x[i]--, y[i]--;

    c.assign(w+1,vll(h+1,0));
    d.assign(w+1,vll(h+1,0));
    V.assign(w+1,vll(h+1,0));
    SUM.assign(w+1,vll(h+1,0));

    RE(i,n) {
        int r = (a[i]-1)/b[i];
        int mnj=max(y[i]-r,0);
        int mxj=min(h-1,y[i]+r);
        REI(j,mnj,mxj) {
            int cr = abs(j-y[i]);

            // increasing
            int bg = max(0, x[i] - r);
            int ed = x[i] - cr - 1;
            if(ed >= 0) {
                ll v = getV(i, bg, j);
                d[bg][j] += b[i];
                c[bg][j] += v - (ll)b[i]*(ll)bg;
                d[ed+1][j] -= b[i];
                c[ed+1][j] -= v - (ll)b[i]*(ll)bg;
            }

            // same
            bg = max(0, x[i] - cr);
            ed = min(w-1, x[i] + cr);
            ll v = getV(i, bg, j);
            c[bg][j] += v;
            c[ed+1][j] -= v;

            // decreasing
            bg = x[i] + cr + 1;
            ed = min(w-1, x[i] + r);
            if(bg < w) {
                ll v = getV(i, bg, j);
                d[bg][j] -= b[i];
                c[bg][j] += v + (ll)b[i]*(ll)bg;
                d[ed+1][j] += b[i];
                c[ed+1][j] -= v + (ll)b[i]*(ll)bg;
            }
        }
    }
    REP(i,1,w) RE(j,h) {
        c[i][j] += c[i-1][j];
        d[i][j] += d[i-1][j];
    }

    RE(i,w) RE(j,h) V[i][j] = c[i][j] + (ll)i*d[i][j];
    RE(i,w) SUM[i][0] = 0;
    RE(i,h) SUM[0][i] = 0;
    RE(i,w) RE(j,h) SUM[i+1][j+1] = SUM[i+1][j] + SUM[i][j+1] - SUM[i][j] + V[i][j];

    // anser queries
    int q;
    IN(q);
    RE(i,q) {
        int x1, x2, y1, y2;
        IN(x1,y1,x2,y2); x1--; y1--;
        ll sm = SUM[x2][y2] - SUM[x1][y2] - SUM[x2][y1] + SUM[x1][y1];
        ll area = abs(x2-x1)*abs(y2-y1);
        OUTL((sm+area/2)/area);
    }
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 743 ms 548472 KB Output is correct
2 Correct 80 ms 2808 KB Output is correct
3 Correct 74 ms 2464 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 793 ms 548472 KB Output is correct
2 Correct 78 ms 2808 KB Output is correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 79396 KB Output is correct
2 Correct 74 ms 2808 KB Output is correct

Subtask #4
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 83616 KB Output is correct
2 Correct 77 ms 2788 KB Output is correct

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 901 ms 550572 KB Output is correct
2 Correct 86 ms 3192 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 449 ms 222072 KB Output is correct
2 Correct 79 ms 2808 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 189 ms 81272 KB Output is correct
2 Correct 93 ms 3076 KB Output is correct

Subtask #8
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 301 ms 112508 KB Output is correct
2 Correct 75 ms 2808 KB Output is correct

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1067 ms 553976 KB Time limit exceeded

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1053 ms 553848 KB Time limit exceeded

Subtask #11
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1082 ms 82552 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 1102 ms 82168 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 1063 ms 83032 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 1092 ms 82556 KB Time limit exceeded
2 Halted 0 ms 0 KB -