結果

問題 No.1043 直列大学
ユーザー suta28407928
提出日時 2020-05-01 22:04:09
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 3,315 bytes
コンパイル時間 579 ms
コンパイル使用メモリ 79,680 KB
最終ジャッジ日時 2025-01-26 09:34:33
合計ジャッジ時間 1,095 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
main.cpp:55:16: error: ‘std::uint_fast64_t’ has not been declared
   55 | template <std::uint_fast64_t Modulus> class modint {
      |                ^~~~~~~~~~~~~
main.cpp:56:20: error: ‘uint_fast64_t’ in namespace ‘std’ does not name a type
   56 |   using u64 = std::uint_fast64_t;
      |                    ^~~~~~~~~~~~~
main.cpp:14:1: note: ‘std::uint_fast64_t’ is defined in header ‘<cstdint>’; did you forget to ‘#include <cstdint>’?
   13 | #include <assert.h>
  +++ |+#include <cstdint>
   14 | using namespace std;
main.cpp:59:3: error: ‘u64’ does not name a type
   59 |   u64 a;
      |   ^~~
main.cpp:61:26: error: ‘u64’ does not name a type
   61 |   constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
      |                          ^~~
main.cpp:62:13: error: ‘u64’ does not name a type
   62 |   constexpr u64 &value() noexcept { return a; }
      |             ^~~
main.cpp:63:19: error: ‘u64’ does not name a type
   63 |   constexpr const u64 &value() const noexcept { return a; }
      |                   ^~~
main.cpp: In function ‘int main()’:
main.cpp:115:16: error: ‘mint’ was not declared in this scope; did you mean ‘uint’?
  115 |         vector<mint> cntv(101010,0), cntr(101010,0);
      |                ^~~~
      |                uint
main.cpp:115:20: error: template argument 1 is invalid
  115 |         vector<mint> cntv(101010,0), cntr(101010,0);
      |                    ^
main.cpp:115:20: error: template argument 2 is invalid
main.cpp:115:35: error: expression list treated as compound expression in initializer [-fpermissive]
  115 |         vector<mint> cntv(101010,0), cntr(101010,0);
      |                                   ^
main.cpp:115:51: error: expression list treated as compound expression in initializer [-fpermissive]
  115 |         vector<mint> cntv(101010,0), cntr(101010,0);
      |                                                   ^
main.cpp:117:13: error: invalid types �

ソースコード

diff #
プレゼンテーションモードにする

#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(ll i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 510000;
ll dy[8] = {0,1,0,-1,1,-1,1,-1};
ll dx[8] = {1,0,-1,0,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
    if(a>b){
        a = b; return true;
    }
    else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
    if(a<b){
        a = b; return true;
    }
    else return false;
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
    cout << a << " " << b << " " << c << "\n";
}
const int mod = 1e9 + 7;
//const int mod = 998244353;
template <std::uint_fast64_t Modulus> class modint {
  using u64 = std::uint_fast64_t;
public:
  u64 a;
  constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
  constexpr u64 &value() noexcept { return a; }
  constexpr const u64 &value() const noexcept { return a; }
  constexpr modint operator+(const modint rhs) const noexcept {
    return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
    return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
    return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
    return modint(*this) /= rhs;
  }
  constexpr modint &operator+=(const modint rhs) noexcept {
    a += rhs.a;
    if (a >= Modulus) {
      a -= Modulus;
    }
    return *this;
  }
  constexpr modint &operator-=(const modint rhs) noexcept {
    if (a < rhs.a) {
      a += Modulus;
    }
    a -= rhs.a;
    return *this;
  }
  constexpr modint &operator*=(const modint rhs) noexcept {
    a = a * rhs.a % Modulus;
    return *this;
  }
  constexpr modint &operator/=(modint rhs) noexcept {
    u64 exp = Modulus - 2;
    while (exp) {
      if (exp % 2) {
        *this *= rhs;
      }
      rhs *= rhs;
      exp /= 2;
    }
    return *this;
  }
};
using mint = modint<mod>;
int main(){
    ll n,m; cin >> n >> m;
    vl v(n),r(m);
    rep(i,n) cin >> v[i];
    rep(i,m) cin >> r[i];
    ll a,b; cin >> a >> b;
    vector<mint> cntv(101010,0), cntr(101010,0);
    vector<bool> vv(101010,false), rr(101010,false);
    cntv[0] = 1, cntr[0] = 1;
    vv[0] = true, rr[0] = true;
    rep(i,n){
        for(ll j=100000; j>=0; j--){
            if(vv[j]) cntv[j+v[i]] += cntv[j], vv[j+v[i]] = true;
        }
    }
    rep(i,m){
        for(ll j=100000; j>=0; j--){
            if(rr[j]) cntr[j+r[i]] += cntr[j], rr[j+r[i]] = true;;
        }
    }
    rep(i,100000) cntr[i+1] += cntr[i];
    mint ans = 0;
    REP(i,1,100001){
        ll lo = (i-1) / b;
        ll up = i / a;
        ans += cntv[i] * (cntr[up] - cntr[lo]);
    }
    cout << ans.value() << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0