結果

問題 No.1043 直列大学
ユーザー daut-dlang
提出日時 2020-05-01 22:55:44
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 89 ms / 2,000 ms
コード長 3,202 bytes
コンパイル時間 747 ms
コンパイル使用メモリ 120,764 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-06-22 06:52:16
合計ジャッジ時間 2,663 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 28
権限があれば一括ダウンロードができます

ソースコード

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

import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;
string FMT_F = "%.10f";
static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }
size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }
void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); }
long mod = 10^^9 + 7;
//long mod = 998_244_353;
//long mod = 1_000_003;
void moda(T)(ref T x, T y) { x = (x + y) % mod; }
void mods(T)(ref T x, T y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(T)(ref T x, T y) { x = (x * y) % mod; }
void modpow(T)(ref T x, T y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }
void modd(T)(ref T x, T y) { x.modm(y.modpow(mod - 2)); }
T binarySearch(alias pred, T)(T ok, T ng)
{ 
    while (abs(ok-ng) > 1)
    {
        auto mid = (ok+ng)/2;
        if (unaryFun!pred(mid)) ok = mid;
        else ng = mid;
    }
    return ok;
}
void main()
{
    auto N = RD;
    auto M = RD;
    auto V = RDA;
    auto R = RDA;
    auto A = RD;
    auto B = RD;
    auto dp1 = new long[](10^^5+1);
    dp1[0] = 1;
    foreach (i; 0..N)
    {
        foreach_reverse (j; 0..dp1.length)
        {
            if (dp1[j] == 0) continue;
            dp1[j+V[i]].moda(dp1[j]);
        }
    }
    /*auto arr1 = new long[](dp1.length+1);
    foreach (i; 0..dp1.length)
    {
        arr1[i+1] = arr1[i] + dp1[i];
    }*/
    auto dp2 = new long[](10^^5+1);
    dp2[0] = 1;
    foreach (i; 0..M)
    {
        foreach_reverse (j; 0..dp2.length)
        {
            if (dp2[j] == 0) continue;
            dp2[j+R[i]].moda(dp2[j]);
        }
    }
    dp2[0] = 0;
    auto arr2 = new long[](dp2.length+1);
    foreach (i; 0..dp2.length)
    {
        auto tmp = arr2[i];
        tmp.moda(dp2[i]);
        arr2[i+1].moda(tmp);
    }
    long ans;
    foreach (i; 1..dp1.length)
    {
        if (dp1[i] == 0) continue;
        bool f(long x)
        {
            return i > B * x;
        }
        bool g(long x)
        {
            return i >= A * x;
        }
        auto r = binarySearch!(f)(0, cast(long)dp2.length);
        auto l = binarySearch!(g)(0, cast(long)dp2.length);
        debug writeln("l:", l, " r:", r);
        auto tmp = dp1[i];
        auto tmp2 = arr2[l+1];
        tmp2.mods(arr2[r+1]);
        tmp.modm(tmp2);
        ans.moda(tmp);
        debug writeln("ans:", ans);
    }
    writeln(ans);
    stdout.flush;
    debug readln;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0