[2002 KAKAO BLIND RECRUITMENT]未破壊の建物

#include <string>
#include <vector>

using namespace std;

int solution(vector<vector<int>> board, vector<vector<int>> skill) {
    int answer = 0;
    //쿼리의 모든 행동 기록
    vector<vector<int>> query(board.size()+1,vector<int>(board[0].size()+1,0));
    for(auto s:skill){
        //공격스킬
        if(s[0]==1){
            query[s[1]][s[2]] -=s[5];
            query[s[1]][s[4]+1] +=s[5];
            query[s[3]+1][s[2]] +=s[5];
            query[s[3]+1][s[4]+1] -=s[5];
        }else{//회복스킬
            query[s[1]][s[2]] +=s[5];
            query[s[1]][s[4]+1] -=s[5];
            query[s[3]+1][s[2]] -=s[5];
            query[s[3]+1][s[4]+1] +=s[5];
        }
    }
    for(int i = 0;i < query.size();i++)
        for(int j = 1;j < query[i].size();j++)
            query[i][j] += query[i][j-1];
    
    for(int j = 0;j<query[0].size();j++)
        for(int i = 1;i<query.size();i++)
            query[i][j] += query[i-1][j];    
    
    for(int i = 0;i<board.size();i++){
        for(int j = 0;j<board[i].size();j++){
            if((board[i][j]+query[i][j]) > 0)
                answer++;
        }
    }
    return answer;
}