test/verify/aoj-0560.test.cpp

View this file on GitHub
Last update: 2024-05-01 23:44:47+09:00
Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0560

Depends on

Code

// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0560

#include "../../template/template.hpp"

#include "../../dp/cumulative-sum-2d.hpp"


int main() {
  int N, M, Q;
  cin >> N >> M >> Q;
  vector< CumulativeSum2D< int > > sum(3, CumulativeSum2D< int >(N, M));
  const string P = "JOI";
  for(int i = 0; i < N; i++) {
    string s;
    cin >> s;
    for(int j = 0; j < M; j++) {
      for(int k = 0; k < 3; k++) {
        sum[k].add(i, j, s[j] == P[k]);
      }
    }
  }
  for(int k = 0; k < 3; k++) {
    sum[k].build();
  }
  while(Q--) {
    int a, b, c, d;
    cin >> a >> b >> c >> d;
    --a, --b;
    vector< int > v(3);
    for(int k = 0; k < 3; k++) {
      v[k] = sum[k].query(a, b, c, d);
    }
    cout << v << "\n";
  }

}

#line 1 "test/verify/aoj-0560.test.cpp"
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0560

#line 1 "template/template.hpp"
#include <bits/stdc++.h>

using namespace std;

using int64 = long long;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;

template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << p.first << " " << p.second;
  return os;
}

template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < (int)v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &in : v) is >> in;
  return is;
}

template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}

template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}

template <typename T = int64>
vector<T> make_v(size_t a) {
  return vector<T>(a);
}

template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
  t = v;
}

template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
  for (auto &e : t) fill_v(e, v);
}

template <typename F>
struct FixPoint : F {
  explicit FixPoint(F &&f) : F(forward<F>(f)) {}

  template <typename... Args>
  decltype(auto) operator()(Args &&...args) const {
    return F::operator()(*this, forward<Args>(args)...);
  }
};

template <typename F>
inline decltype(auto) MFP(F &&f) {
  return FixPoint<F>{forward<F>(f)};
}
#line 4 "test/verify/aoj-0560.test.cpp"

#line 1 "dp/cumulative-sum-2d.hpp"
template <class T>
struct CumulativeSum2D {
  vector<vector<T> > data;

  CumulativeSum2D(int W, int H) : data(W + 1, vector<T>(H + 1, 0)) {}

  void add(int x, int y, T z) {
    ++x, ++y;
    if (x >= data.size() || y >= data[0].size()) return;
    data[x][y] += z;
  }

  void build() {
    for (int i = 1; i < data.size(); i++) {
      for (int j = 1; j < data[i].size(); j++) {
        data[i][j] += data[i][j - 1] + data[i - 1][j] - data[i - 1][j - 1];
      }
    }
  }

  T query(int sx, int sy, int gx, int gy) const {
    return (data[gx][gy] - data[sx][gy] - data[gx][sy] + data[sx][sy]);
  }
};
#line 6 "test/verify/aoj-0560.test.cpp"


int main() {
  int N, M, Q;
  cin >> N >> M >> Q;
  vector< CumulativeSum2D< int > > sum(3, CumulativeSum2D< int >(N, M));
  const string P = "JOI";
  for(int i = 0; i < N; i++) {
    string s;
    cin >> s;
    for(int j = 0; j < M; j++) {
      for(int k = 0; k < 3; k++) {
        sum[k].add(i, j, s[j] == P[k]);
      }
    }
  }
  for(int k = 0; k < 3; k++) {
    sum[k].build();
  }
  while(Q--) {
    int a, b, c, d;
    cin >> a >> b >> c >> d;
    --a, --b;
    vector< int > v(3);
    for(int k = 0; k < 3; k++) {
      v[k] = sum[k].query(a, b, c, d);
    }
    cout << v << "\n";
  }

}

Test cases

Env	Name	Status	Elapsed	Memory
g++	testcase_00	AC	7 ms	4 MB
g++	testcase_01	AC	6 ms	4 MB
g++	testcase_02	AC	7 ms	4 MB
g++	testcase_03	AC	28 ms	4 MB
g++	testcase_04	AC	30 ms	4 MB
g++	testcase_05	AC	51 ms	18 MB
g++	testcase_06	AC	53 ms	19 MB
g++	testcase_07	AC	57 ms	19 MB
g++	testcase_08	AC	60 ms	19 MB
g++	testcase_09	AC	57 ms	19 MB
clang++	testcase_00	AC	6 ms	4 MB
clang++	testcase_01	AC	7 ms	4 MB
clang++	testcase_02	AC	7 ms	4 MB
clang++	testcase_03	AC	26 ms	4 MB
clang++	testcase_04	AC	32 ms	4 MB
clang++	testcase_05	AC	51 ms	18 MB
clang++	testcase_06	AC	54 ms	19 MB
clang++	testcase_07	AC	58 ms	19 MB
clang++	testcase_08	AC	59 ms	19 MB
clang++	testcase_09	AC	61 ms	19 MB