oj.uz

답안 #813435

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
813435 2023-08-07T17:55:12 Z JakobZorz Nuclearia (CEOI15_nuclearia) C++14
40 / 100
 1000 ms 22692 KB 
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <set>
#include <stack>
#include <limits.h>
#include <math.h>
#include <iomanip>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <cstring>
#include <sstream>
 
#pragma GCC target("popcnt")
 
typedef long long ll;
typedef long double ld;
using namespace std;
const int MOD=1e9+7;
typedef pair<ll,ll>point;
//#define x first
//#define y second

int w,h;

class Matrix{
    vector<ll>map_arr;
public:
    void init_map(){
        map_arr.resize(w*h);
    }

    ll get2(int x,int y){
        if(x<0||y<0)
            return 0;
        return map_arr[y*w+x];
    }

    ll&get(int x,int y){
        return map_arr[y*w+x];
    }

    void add_bounded(int x,int y,ll val){
        if(x<0)
            x=0;
        if(y<0)
            y=0;
        if(x>=w)
            return;
        if(y>=h)
            return;
        get(x,y)+=val;
    }
};
 
Matrix mat;

int main(){
    ios::sync_with_stdio(false);
    cout.tie(NULL);
    cin.tie(NULL);
    
    cin>>w>>h;
    mat.init_map();
    int n;
    cin>>n;
    while(n--){
        int x1,y1;
        ll center,step;
        cin>>x1>>y1>>center>>step;
        x1--;y1--;
        
        ll last_step=(center-1)%step+1;
        int num_steps=(int)(center+step-1)/step;
        
        if(x1>y1){
            // hits ceiling
            for(int i=0;i<num_steps-1&&i<y1;i++)
                mat.get(x1-i,y1-i)+=step;
            
            for(int i=y1;i<num_steps-1&&i<x1;i++)
                mat.get(x1-i,0)+=step;
            
            if(x1<num_steps-1)
                mat.get(0,0)+=step*(num_steps-1-x1);
            
        }else{
            // hits left wall
            for(int i=0;i<num_steps-1&&i<x1;i++)
                mat.get(x1-i,y1-i)+=step;
            
            for(int i=x1;i<num_steps-1&&i<y1;i++)
                mat.get(0,y1-i)+=step;
            
            if(y1<num_steps-1)
                mat.get(0,0)+=step*(num_steps-1-y1);
        }
        
        if(x1+y1<w){
            // hits ceiling
            for(int i=0;i<num_steps-1&&i<y1;i++)
                mat.get(x1+i+1,y1-i)-=step;
            
            for(int i=y1;i<num_steps-1&&x1+i+1<w;i++)
                mat.get(x1+i+1,0)-=step;
            
        }else{
            for(int i=0;i<num_steps-1&&x1+i+1<w;i++)
                mat.get(x1+i+1,y1-i)-=step;
        }
        
        for(int i=0;i<num_steps-1;i++){
            mat.add_bounded(x1-i,y1+i+1,-step);
        }
        
        for(int i=0;i<num_steps-1;i++)
            mat.add_bounded(x1+i+1,y1+i+1,step);
        
        mat.add_bounded(x1-num_steps+1, y1-num_steps+1, last_step);
        mat.add_bounded(x1-num_steps+1, y1+num_steps,   -last_step);
        mat.add_bounded(x1+num_steps,   y1-num_steps+1, -last_step);
        mat.add_bounded(x1+num_steps,   y1+num_steps,   last_step);
        
        /*for(int x=0;x<w;x++)
            for(int y=0;y<h;y++){
                int dist=max(abs(x1-x),abs(y1-y));
                ll val=max(0LL,center-dist*step);
                get(x,y)+=val;
            }*/
    }
    
    for(int x=0;x<w;x++)
        for(int y=0;y<h;y++)
            mat.get(x,y)+=mat.get2(x-1,y)+mat.get2(x,y-1)-mat.get2(x-1,y-1);
    
    /*for(int y=0;y<h;y++){
        for(int x=0;x<w;x++){
            cout<<mat.get(x,y)<<" ";
        }
        cout<<"\n";
    }*/
    
    for(int x=0;x<w;x++)
        for(int y=0;y<h;y++)
            mat.get(x,y)+=mat.get2(x-1,y)+mat.get2(x,y-1)-mat.get2(x-1,y-1);
    
    int q;
    cin>>q;
    while(q--){
        int x1,y1,x2,y2;
        cin>>x1>>y1>>x2>>y2;
        x1--;y1--;
        
        ll sum=mat.get2(x2-1,y2-1)+mat.get2(x1-1,y1-1)-mat.get2(x1-1,y2-1)-mat.get2(x2-1,y1-1);
        
        ll area=(x2-x1)*(y2-y1);
        ll res=sum/area;
        if((sum%area)*2>=area)
            res++;
        cout<<res<<"\n";
    }

    return 0;
}

/*

4 3
2
1 1 7 3
3 2 4 2
4
1 2 2 3
1 1 4 3
4 2 4 2
1 3 4 3

*/

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 247 ms 19796 KB Output is correct
2 Correct 49 ms 2652 KB Output is correct
3 Correct 44 ms 2220 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 257 ms 19796 KB Output is correct
2 Correct 53 ms 2600 KB Output is correct

Subtask #3
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 19792 KB Output is correct
2 Correct 46 ms 2644 KB Output is correct

Subtask #4
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 19772 KB Output is correct
2 Correct 46 ms 2712 KB Output is correct

Subtask #5
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 152 ms 22060 KB Output is correct
2 Correct 57 ms 2892 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 243 ms 10504 KB Output is correct
2 Correct 53 ms 2716 KB Output is correct

Subtask #7
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 133 ms 22200 KB Output is correct
2 Correct 48 ms 2836 KB Output is correct

Subtask #8
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 169 ms 10452 KB Output is correct
2 Correct 46 ms 2704 KB Output is correct

Subtask #9
0 / 15.0

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

Subtask #10
0 / 10.0

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

Subtask #11
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 629 ms 21796 KB Output is correct
2 Execution timed out 1079 ms 20940 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #12
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 985 ms 22056 KB Output is correct
2 Correct 605 ms 22692 KB Output is correct

Subtask #13
0 / 12.0

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

Subtask #14
0 / 8.0

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