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

提出ソース

結果

問題	No.1043 直列大学
ユーザー	FF256grhy
提出日時	2020-05-01 23:12:53
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	51 ms / 2,000 ms
コード長	4,704 bytes
コンパイル時間	2,194 ms
コンパイル使用メモリ	207,744 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-06-02 03:07:52
合計ジャッジ時間	3,071 ms
ジャッジサーバーID （参考情報）	judge5 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,812 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	1 ms 6,944 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	2 ms 6,944 KB
testcase_07	AC	2 ms 6,940 KB
testcase_08	AC	2 ms 6,940 KB
testcase_09	AC	3 ms 6,940 KB
testcase_10	AC	3 ms 6,944 KB
testcase_11	AC	13 ms 6,940 KB
testcase_12	AC	51 ms 6,944 KB
testcase_13	AC	22 ms 6,940 KB
testcase_14	AC	23 ms 6,940 KB
testcase_15	AC	28 ms 6,944 KB
testcase_16	AC	22 ms 6,944 KB
testcase_17	AC	10 ms 6,944 KB
testcase_18	AC	10 ms 6,940 KB
testcase_19	AC	19 ms 6,940 KB
testcase_20	AC	9 ms 6,944 KB
testcase_21	AC	17 ms 6,940 KB
testcase_22	AC	19 ms 6,940 KB
testcase_23	AC	30 ms 6,940 KB
testcase_24	AC	12 ms 6,944 KB
testcase_25	AC	18 ms 6,944 KB
testcase_26	AC	23 ms 6,940 KB
testcase_27	AC	7 ms 6,940 KB
testcase_28	AC	12 ms 6,940 KB
testcase_29	AC	3 ms 6,944 KB
testcase_30	AC	19 ms 6,940 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
using LL = long long int;
#define incID(i, l, r) for(int i = (l)    ; i <  (r); ++i)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); --i)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); ++i)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); --i)
#define inc(i, n)  incID(i, 0, n)
#define dec(i, n)  decID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec1(i, n) decII(i, 1, n)
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define FR front()
#define BA back()
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
auto setmin   = [](auto & a, auto b) { return (b <  a ? a = b, true : false); };
auto setmax   = [](auto & a, auto b) { return (b >  a ? a = b, true : false); };
auto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); };
auto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); };
#define SI(v) static_cast<int>(v.size())
#define RF(e, v) for(auto & e: v)
#define until(e) while(! (e))
#define if_not(e) if(! (e))
#define ef else if
#define UR assert(false)
#define IN(T, ...) T __VA_ARGS__; IN_(__VA_ARGS__);
void IN_() { };
template<typename T, typename ... U> void IN_(T & a, U & ... b) { cin >> a; IN_(b ...); };
template<typename T> void OUT(T && a) { cout << a << endl; }
template<typename T, typename ... U> void OUT(T && a, U && ... b) { cout << a << " "; OUT(b ...); }

// ---- ----

template<LL M> class ModInt {
private:
	LL v;
	pair<LL, LL> ext_gcd(LL a, LL b) {
		if(b == 0) { assert(a == 1); return { 1, 0 }; }
		auto p = ext_gcd(b, a % b);
		return { p.SE, p.FI - (a / b) * p.SE };
	}
public:
	ModInt(LL vv = 0) { v = vv; if(abs(v) >= M) { v %= M; } if(v < 0) { v += M; } }
	LL get_v() { return v; }
	ModInt inv() { return ext_gcd(M, v).SE; }
	ModInt exp(LL b) {
		ModInt p = 1, a = v; if(b < 0) { a = a.inv(); b = -b; }
		while(b) { if(b & 1) { p *= a; } a *= a; b >>= 1; }
		return p;
	}
	friend bool      operator< (ModInt    a, ModInt   b) { return (a.v <  b.v); }
	friend bool      operator> (ModInt    a, ModInt   b) { return (a.v >  b.v); }
	friend bool      operator<=(ModInt    a, ModInt   b) { return (a.v <= b.v); }
	friend bool      operator>=(ModInt    a, ModInt   b) { return (a.v >= b.v); }
	friend bool      operator==(ModInt    a, ModInt   b) { return (a.v == b.v); }
	friend bool      operator!=(ModInt    a, ModInt   b) { return (a.v != b.v); }
	friend ModInt    operator+ (ModInt    a            ) { return ModInt(+a.v); }
	friend ModInt    operator- (ModInt    a            ) { return ModInt(-a.v); }
	friend ModInt    operator+ (ModInt    a, ModInt   b) { return ModInt(a.v + b.v); }
	friend ModInt    operator- (ModInt    a, ModInt   b) { return ModInt(a.v - b.v); }
	friend ModInt    operator* (ModInt    a, ModInt   b) { return ModInt(a.v * b.v); }
	friend ModInt    operator/ (ModInt    a, ModInt   b) { return a * b.inv(); }
	friend ModInt    operator^ (ModInt    a, LL       b) { return a.exp(b); }
	friend ModInt  & operator+=(ModInt  & a, ModInt   b) { return (a = a + b); }
	friend ModInt  & operator-=(ModInt  & a, ModInt   b) { return (a = a - b); }
	friend ModInt  & operator*=(ModInt  & a, ModInt   b) { return (a = a * b); }
	friend ModInt  & operator/=(ModInt  & a, ModInt   b) { return (a = a / b); }
	friend ModInt  & operator^=(ModInt  & a, LL       b) { return (a = a ^ b); }
	friend istream & operator>>(istream & s, ModInt & b) { s >> b.v; b = ModInt(b.v); return s; }
	friend ostream & operator<<(ostream & s, ModInt   b) { return (s << b.v); }
};

// ----

using MI = ModInt< 1'000'000'007 >;

template<typename T> istream & operator>>(istream & s, vector<T> & v) { RF(e, v) { s >> e; } return s; }
template<typename T> ostream & operator<<(ostream & s, vector<T> const & v) {
	inc(i, SI(v)) { s << (i == 0 ? "" : " ") << v[i]; }
	return s;
}

#define SL(v) static_cast<LL>(v.size())

int main() {
	IN(int, n, m);
	vector<int> v(n), r(m);
	cin >> v >> r;
	IN(LL, a, b);
	
	auto f = [](vector<int> const & v) -> vector<MI> {
		int s = 0;
		RF(e, v) { s += e; }
		vector<MI> ans(s + 1);
		ans[0] = 1;
		RF(e, v) {
			dec(i, s) {
				if(i + e <= s) { ans[i + e] += ans[i]; }
			}
		}
		ans.FR = 0;
		return ans;
	};
	
	vector<MI> V = f(v), R = f(r), SV;
	{
		MI sum = 0;
		inc(i, SI(V)) { SV.PB(sum); sum += V[i]; }
		SV.PB(sum);
	}
	
	MI ans = 0;
	incID(j, 1, SI(R)) {
		LL h = clamp(b * j + 1, 0LL, SL(V));
		LL l = clamp(a * j    , 0LL, SL(V));
		// OUT(j, ":", b * j, a * j - 1, h, l, SV[h], SV[l]);
		ans += R[j] * (SV[h] - SV[l]);
	}
	OUT(ans);
}

yukicoder

結果

テストケース

ソースコード