oj.uz

답안 #274879

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
274879 2020-08-19T19:17:23 Z MarcoMeijer Nuclearia (CEOI15_nuclearia) C++14
55 / 100
 1000 ms 99832 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 = 3e6;
int w, h, n;
int x[MX], y[MX], a[MX], b[MX];
ll c[MX], d[MX], V[MX], SUM[MX];

int f(int i, int j) {return i+j*(w+1);}
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]--;

    RE(i,MX) c[i]=d[i]=V[i]=SUM[i]=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 = (ll)getV(i, bg, j) - (ll)b[i]*(ll)bg;
                d[f(bg,j)] += b[i];
                c[f(bg,j)] += v;
                d[f(ed+1,j)] -= b[i];
                c[f(ed+1,j)] -= v;
            }

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

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

    RE(i,w) RE(j,h) V[f(i,j)] = c[f(i,j)] + (ll)i*d[f(i,j)];
    RE(i,w) SUM[f(i,0)] = 0;
    RE(i,h) SUM[f(0,i)] = 0;
    RE(i,w) RE(j,h) SUM[f(i+1,j+1)] = SUM[f(i+1,j)] + SUM[f(i,j+1)] - SUM[f(i,j)] + V[f(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[f(x2,y2)] - SUM[f(x1,y2)] - SUM[f(x2,y1)] + SUM[f(x1,y1)];
        ll area = abs(x2-x1)*abs(y2-y1);
        OUTL((sm+area/2)/area);
    }
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 81 ms 94328 KB Output is correct
2 Correct 131 ms 96760 KB Output is correct
3 Correct 131 ms 96248 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 94328 KB Output is correct
2 Correct 133 ms 96760 KB Output is correct

Subtask #3
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 148 ms 94328 KB Output is correct
2 Correct 135 ms 96888 KB Output is correct

Subtask #4
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 259 ms 94344 KB Output is correct
2 Correct 145 ms 96760 KB Output is correct

Subtask #5
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 202 ms 96504 KB Output is correct
2 Correct 140 ms 96888 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 194 ms 96824 KB Output is correct
2 Correct 140 ms 96764 KB Output is correct

Subtask #7
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 380 ms 96760 KB Output is correct
2 Correct 140 ms 96888 KB Output is correct

Subtask #8
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 191 ms 96800 KB Output is correct
2 Correct 139 ms 96760 KB Output is correct

Subtask #9
15.0 / 15.0

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

Subtask #10
10.0 / 10.0

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

Subtask #11
0 / 15.0

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

Subtask #12
0 / 10.0

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

Subtask #13
0 / 12.0

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

Subtask #14
0 / 8.0

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