結果
問題 | No.440 2次元チワワ問題 |
ユーザー |
![]() |
提出日時 | 2016-10-28 23:34:30 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 113 ms / 5,000 ms |
コード長 | 2,484 bytes |
コンパイル時間 | 1,953 ms |
コンパイル使用メモリ | 184,428 KB |
実行使用メモリ | 9,216 KB |
最終ジャッジ日時 | 2024-11-24 06:29:11 |
合計ジャッジ時間 | 3,951 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 26 |
ソースコード
#include "bits/stdc++.h"using namespace std;#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;template<typename T, typename U> static void amin(T &x, U y) { if(y < x) x = y; }template<typename T, typename U> static void amax(T &x, U y) { if(x < y) x = y; }struct Query {int yL; int xL; int yR; int xR;};int main() {int H; int W;while(~scanf("%d%d", &H, &W)) {vector<vector<char>> S(H, vector<char>(W));rep(i, H) {char buf[501];scanf("%s", buf);rep(j, W)S[i][j] = buf[j];}auto calc = [](int n) { return (ll)n * (n - 1) / 2; };int Q;scanf("%d", &Q);vector<Query> queries(Q);rep(i, Q) {int yL; int xL; int yR; int xR;scanf("%d%d%d%d", &yL, &xL, &yR, &xR), -- yL, -- xL;queries[i] = Query{ yL,xL,yR,xR };}vector<ll> ans(Q, 0);rep(rot, 2) {vector<vi> sum(H, vi(W + 1));rep(i, H) rep(j, W)sum[i][j + 1] = sum[i][j] + (S[i][j] == 'w');vector<vector<ll>> sumL(H, vector<ll>(W + 1)), sumLR(H, vector<ll>(W + 1));rep(i, H) rep(j, W) {int wL = sum[i][j], cL = j - wL;int wR = sum[i][W] - sum[i][j + 1], cR = (W - (j + 1)) - wR;sumL[i][j + 1] = sumL[i][j] + (S[i][j] == 'w' ? cL : 0);sumLR[i][j + 1] = sumLR[i][j] + (S[i][j] == 'w' ? (ll)wL * cR + (ll)cL * wR : 0);}rep(qi, Q) {Query q = queries[qi];ll total = 0;reu(i, q.yL, q.yR) {int n = q.xR - q.xL;int w = sum[i][q.xR] - sum[i][q.xL], c = n - w;int wL = sum[i][q.xL], cL = q.xL - wL;int wR = sum[i][W] - sum[i][q.xR], cR = (W - q.xR) - wR;ll ww = calc(w), cc = calc(c);ll cw = (sumL[i][q.xR] - sumL[i][q.xL]) - (ll)w * cL;ll wc = calc(n) - ww - cc - cw;total += sumLR[i][q.xR] - sumLR[i][q.xL];total -= (ll)cL * w * wR + (ll)wL * w * cR;total -= cw * wR + wL * wc;total -= cL * ww + ww * cR;}ans[qi] += total;}vector<vector<char>> nS(W, vector<char>(H));rep(i, H) rep(j, W)nS[j][i] = S[i][j];for(auto &q : queries) {swap(q.yL, q.xL);swap(q.yR, q.xR);}swap(H, W);S.swap(nS);}for(int i = 0; i < Q; ++ i)printf("%lld\n", ans[i]);}return 0;}