제출 #39491

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
39491		funcsr	Nuclearia (CEOI15_nuclearia)	C++14	0 / 100	1000 ms	275496 KiB

nuclearia

#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
#define rep(i, n) for (int i=0; i<(n); i++)
#define pb push_back
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())

int W, H, N, Q;
vector< vector<long long> > A;
vector< vector<long long> > T;

int main() {
  cin >> W >> H >> N;
  A.resize(W);
  rep(x, W) A[x].resize(H);
  rep(i, N) {
    int x, y, a, b;
    cin >> x >> y >> a >> b;
    x--, y--;
    rep(xx, W) rep(yy, H) {
      int dist = max(abs(xx-x), abs(y-yy));
      A[xx][yy] += max(0LL, a-1LL*b*dist);
    }
  }
  /*
  rep(y, H) {
    rep(x, W) cout << A[x][y] << " ";
    cout << "\n";
  }
  */
  T = vector< vector<long long> >(A);
  rep(y, H) rep(x, W-1) T[x+1][y] += T[x][y];
  rep(y, H-1) rep(x, W) T[x][y+1] += T[x][y];
  cin >> Q;
  rep(i, Q) {
    int x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    x1--, y1--, x2--, y2--;
    long long s = T[x2][y2];
    if (x1 > 0) s -= T[x1-1][y2];
    if (y1 > 0) s -= T[x2][y1-1];
    if (x1 > 0 && y1 > 0) s += T[x1-1][y1-1];
    long long q = 1LL*(x2-x1+1)*(y2-y1+1);
    //cout<<s<<"/"<<q<<"\n";
    cout << ((2LL*s/q)+1)/2 << "\n";
  }
  return 0;
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 2
• Subtask 3: 0 / 3
• Subtask 4: 0 / 2
• Subtask 5: 0 / 6
• Subtask 6: 0 / 4
• Subtask 7: 0 / 6
• Subtask 8: 0 / 4
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10
• Subtask 11: 0 / 15
• Subtask 12: 0 / 10
• Subtask 13: 0 / 12
• Subtask 14: 0 / 8