#474964 (C++17) No.1043 直列大学

• 問題: No.1043 直列大学
• ユーザー: mai
• 提出日時: 2020-05-01 23:19:37
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: WA
• 実行時間: -
• コード長: 7,587 bytes
• コンパイル時間: 4,815 ms
• コンパイル使用メモリ: 222,732 KB
• 最終ジャッジ日時: 2025-01-10 05:33:19
• ジャッジサーバーID （参考情報）: judge2 / judge2

ファイルパターン	結果
sample	WA * 3
other	AC * 8 WA * 20

ソースコード

#pragma GCC optimize ("O3")
#include "bits/stdc++.h"

using namespace std;
using ll = long long int;

#define all(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(typename remove_const<typename remove_reference<decltype(l)>::type>::type cnt={};(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt))
const long long MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L;
template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')'; return o; }
template<typename T> inline T& chmax(T& to, const T& val) { return to = max(to, val); }
template<typename T> inline T& chmin(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }
mt19937_64 randdev(8901016);
template<typename T, typename Random = decltype(randdev), typename enable_if<is_integral<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_int_distribution<T>(l, h)(rand); }
template<typename T, typename Random = decltype(randdev), typename enable_if<is_floating_point<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_real_distribution<T>(l, h)(rand); }

template <typename I>
struct MyRangeFormat{ I b,e; MyRangeFormat(I _b, I _e):b(_b),e(_e){} };
template<typename I>
static ostream& operator<<(ostream& o, const MyRangeFormat<I>& f) {
  o << "[ "; iterate(i,f.b,f.e) o<<*i<<' ';
  return o << ']';
}
template <typename I>
struct MyMatrixFormat{
  const I& p; long long n, m;
  MyMatrixFormat(const I& _p, long long _n, long long _m):p(_p),n(_n),m(_m){}
};
template<typename I>
static ostream& operator<<(ostream& o, const MyMatrixFormat<I>& f) {
  o<<'\n';
  repeat(i,(f.n)) {
    repeat(j,f.m) o<<f.p[i][j]<<' ';
    o<<'\n';
  }
  return o;
}
struct LOG_t { ~LOG_t() { cout << endl; } };
#define LOG (LOG_t(),cout<<'L'<<__LINE__<<": ")
#define FMTA(m,w) (MyRangeFormat<decltype(m+0)>(m,m+w))
#define FMTR(b,e) (MyRangeFormat<decltype(e)>(b,e))
#define FMTV(v) FMTR(v.begin(),v.end())
#define FMTM(m,h,w) (MyMatrixFormat<decltype(m+0)>(m,h,w))

#if defined(_WIN32) || defined(_WIN64)
#define getc_x _getc_nolock
#define putc_x _putc_nolock
#elif defined(__GNUC__)
#define getc_x getc_unlocked
#define putc_x putc_unlocked
#else
#define getc_x getc
#define putc_x putc
#endif
class MaiScanner {
  FILE* fp_;
  constexpr bool isvisiblechar(char c) noexcept { return (0x21<=(c)&&(c)<=0x7E); }
public:
  inline MaiScanner(FILE* fp):fp_(fp){}
  template<typename T> void input_integer(T& var) noexcept {
    var = 0; T sign = 1;
    int cc = getc_x(fp_);
    for (; cc < '0' || '9' < cc; cc = getc_x(fp_))
      if (cc == '-') sign = -1;
    for (; '0' <= cc && cc <= '9'; cc = getc_x(fp_))
      var = (var << 3) + (var << 1) + cc - '0';
    var = var * sign;
  }
  inline int c() noexcept { return getc_x(fp_); }
  template<typename T, typename enable_if<is_integral<T>::value, nullptr_t>::type = nullptr>
  inline MaiScanner& operator>>(T& var) noexcept { input_integer<T>(var); return *this; }
  inline MaiScanner& operator>>(string& var) {
    int cc = getc_x(fp_);
    for (; !isvisiblechar(cc); cc = getc_x(fp_));
    for (; isvisiblechar(cc); cc = getc_x(fp_))
      var.push_back(cc);
    return *this;
  }
  template<typename IT> inline void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
};
class MaiPrinter {
  FILE* fp_;
public:
  inline MaiPrinter(FILE* fp):fp_(fp){}
  template<typename T>
  void output_integer(T var) noexcept {
    if (var == 0) { putc_x('0', fp_); return; }
    if (var < 0)
      putc_x('-', fp_),
      var = -var;
    char stack[32]; int stack_p = 0;
    while (var)
      stack[stack_p++] = '0' + (var % 10),
      var /= 10;
    while (stack_p)
      putc_x(stack[--stack_p], fp_);
  }
  inline MaiPrinter& operator<<(char c) noexcept { putc_x(c, fp_); return *this; }
  template<typename T, typename enable_if<is_integral<T>::value, nullptr_t>::type = nullptr>
  inline MaiPrinter& operator<<(T var) noexcept { output_integer<T>(var); return *this; }
  inline MaiPrinter& operator<<(char* str_p) noexcept { while (*str_p) putc_x(*(str_p++), fp_); return *this; }
  inline MaiPrinter& operator<<(const string& str) {
    const char* p = str.c_str();
    const char* l = p + str.size();
    while (p < l) putc_x(*p++, fp_);
    return *this;
  }
  template<typename IT> void join(IT begin, IT end, char sep = ' ') { for (bool b = 0; begin != end; ++begin, b = 1) b ? *this << sep << *begin : *this << *begin; }
};
MaiScanner scanner(stdin);
MaiPrinter printer(stdout);

template <typename T = long long>
class Bitree {
  const int size_;
  vector<T> data_;
  static int nlz(uint32_t x) {
    union {
      uint32_t i;
      float f;
    } data;
    data.f = (float)x + 0.5;
    return 158 - (data.i >> 23);
  }

 public:
  Bitree(int size_) : size_(size_), data_(size_ + 1) {}

  // 1..rの範囲の値の和を求める．
  T sum(int r) const {
    T s = 0;
    while (r) {
      s += data_[r];
      r -= r & -r;  //  r&-r と書くことで最下のビットを得る
    }
    return s;
  }
  // l..rの範囲の値の和を求める
  inline T sum(int l, int r) const { return sum(r) - sum(l - 1); }
  // i番目の値を求める(1index)
  T get(int i) const {
    int j = i - 1;
    T s = 0;
    while (i != j) {
      s += data_[i] - data_[j];
      i -= i & -i;
      j -= j & -j;
    }
    return s;
  }
  // idxの要素の値をval増やす
  void add(int idx, T val) {
    while (idx <= size_) {
      data_[idx] += val;
      idx += idx & -idx;
    }
  }
  // sum(i)がvalを超える最初のiを返す
  // get(j)<0となるjが存在すると正しく動作しない
  int upper_bound(T val) const {
    int li = 1 << (31 - nlz(size_));
    int p = 0;
    T d = 0;
    while (li && p < size_) {
      T k = data_[p | li];
      if (!(val < d + k))
        p |= li, d += k;
      li >>= 1;
    }
    if (p > size_)
      p = size_;
    return p + 1;
  }
  // sum(i)がval以上である最初のiを返す
  // get(j)<0となるjが存在すると正しく動作しない
  int lower_bound(T val) const {
    int li = 1 << (31 - nlz(size_));
    int p = 0;
    T d = 0;
    while (li && p < size_) {
      T k = data_[p | li];
      if (d + k < val)
        p |= li, d += k;
      li >>= 1;
    }
    if (p > size_)
      p = size_;
    return p + 1;
  }
};

//

int N, M;
ll A, B;

//


int main() {
  scanner >> N >> M;
  
  map<int, int> vv, rr;
  
  vv[0] = 1;
  rr[0] = 1;
  repeat(i, N) {
    int v; scanner >> v;
    
    decltype(vv) vv2 = vv;
    for (auto v2 : vv) {
      vv2[v2.first + v] += v2.second;
    }
    vv.swap(vv2);
  }
  repeat(i, M) {
    int r; scanner >> r;
    
    decltype(rr) rr2 = rr;
    for (auto r2 : rr) {
      rr2[r2.first + r] += r2.second;
    }
    rr.swap(rr2);
  }
  scanner >> A >> B;
  
  // auto itv = vv.begin();
  // auto itr = rr.begin();
  // ++itr;
  Bitree<ll> bitr(100010);
  repeat(i, 100005) {
    bitr.add(i+1, rr[i+1]);
  }
  ll cnt = 0;
  for (auto p : vv) {
    ll v = p.first;
    ll low_r = (v+A-1)/A;
    ll high_r = v/B;
    auto l = rr.lower_bound(low_r);
    auto h = rr.upper_bound(high_r);
    // LOG << *l;
    // LOG << *h;
    if (l->first <= h->first)
      cnt += bitr.sum(max<ll>(1, l->first), h->first);
    cnt %= MD;
  }
  cout << cnt << endl;
  
  return 0;
}