結果
問題 | No.122 傾向と対策:門松列(その3) |
ユーザー | heno239 |
提出日時 | 2020-08-03 18:06:18 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 79 ms / 5,000 ms |
コード長 | 3,344 bytes |
コンパイル時間 | 1,097 ms |
コンパイル使用メモリ | 113,908 KB |
実行使用メモリ | 8,776 KB |
最終ジャッジ日時 | 2024-09-13 11:49:51 |
合計ジャッジ時間 | 2,379 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 79 ms
8,644 KB |
testcase_01 | AC | 77 ms
8,776 KB |
testcase_02 | AC | 73 ms
8,772 KB |
testcase_03 | AC | 75 ms
8,708 KB |
testcase_04 | AC | 77 ms
8,520 KB |
testcase_05 | AC | 74 ms
8,736 KB |
testcase_06 | AC | 78 ms
8,768 KB |
testcase_07 | AC | 79 ms
8,660 KB |
ソースコード
#include<iostream> #include<string> #include<cstdio> #include<vector> #include<cmath> #include<algorithm> #include<functional> #include<iomanip> #include<queue> #include<ciso646> #include<random> #include<map> #include<set> #include<bitset> #include<stack> #include<unordered_map> #include<utility> #include<cassert> #include<complex> #include<numeric> using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; constexpr ll mod = 1000000007; const ll INF = mod * mod; typedef pair<int, int>P; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i<n;i++) #define per(i,n) for(int i=n-1;i>=0;i--) #define Rep(i,sta,n) for(int i=sta;i<n;i++) #define rep1(i,n) for(int i=1;i<=n;i++) #define per1(i,n) for(int i=n;i>=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) #define all(v) (v).begin(),(v).end() typedef pair<ll, ll> LP; typedef long double ld; typedef pair<ld, ld> LDP; const ld eps = 1e-12; const ld pi = acos(-1.0); ll mod_pow(ll x, ll n, ll m) { ll res = 1; while (n) { if (n & 1)res = res * x % m; x = x * x % m; n >>= 1; } return res; } struct modint { ll n; modint() :n(0) { ; } modint(ll m) :n(m) { if (n >= mod)n %= mod; else if (n < 0)n = (n % mod + mod) % mod; } operator int() { return n; } }; bool operator==(modint a, modint b) { return a.n == b.n; } modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; } modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; } modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; } modint operator+(modint a, modint b) { return a += b; } modint operator-(modint a, modint b) { return a -= b; } modint operator*(modint a, modint b) { return a *= b; } modint operator^(modint a, int n) { if (n == 0)return modint(1); modint res = (a * a) ^ (n / 2); if (n % 2)res = res * a; return res; } ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); } modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); } const int max_n = 1 << 18; modint fact[max_n], factinv[max_n]; void init_f() { fact[0] = modint(1); for (int i = 0; i < max_n - 1; i++) { fact[i + 1] = fact[i] * modint(i + 1); } factinv[max_n - 1] = modint(1) / fact[max_n - 1]; for (int i = max_n - 2; i >= 0; i--) { factinv[i] = factinv[i + 1] * modint(i + 1); } } modint comb(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[b] * factinv[a - b]; } int l[7], r[7]; modint dp[20001][8]; void solve() { rep(i,7)cin >> l[i] >> r[i]; vector<int> v(7); rep(i, 7)v[i] = i; modint ans = 0; do { bool valid = false; { bool f = true; rep(i, 3)if (v[i] % 2 == 0)f = false; if (f)valid = true; } { bool f = true; rep(i, 4)if (v[i] % 2)f = false; if (f)valid = true; } if (!valid)continue; dp[0][0] = 1; rep1(i, 20000) { rep(j, 8) { dp[i][j] = dp[i - 1][j]; if (j - 1 >= 0 && l[v[j - 1]] <= i && i <= r[v[j - 1]]) { dp[i][j] += dp[i - 1][j - 1]; } } } ans += dp[20000][7]; } while (next_permutation(all(v))); cout << ans << "\n"; } signed main() { ios::sync_with_stdio(false); cin.tie(0); //cout << fixed << setprecision(10); //init_f(); //int t; cin >> t; rep(i, t) solve(); return 0; }