結果
問題 | No.1336 Union on Blackboard |
ユーザー |
![]() |
提出日時 | 2021-02-06 19:32:32 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3 ms / 2,000 ms |
コード長 | 5,231 bytes |
コンパイル時間 | 2,141 ms |
コンパイル使用メモリ | 194,228 KB |
最終ジャッジ日時 | 2025-01-18 13:41:50 |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 31 |
ソースコード
//#pragma GCC target("avx2")//#pragma GCC optimize("O3")//#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>#define ll long long#define ull unsigned long long#define ld long double#define rep(i, n) for(int i = 0; i < n; ++i)#define rep2(i, a, b) for(int i = a; i <= b; ++i)#define rrep(i, a, b) for(int i = a; i >= b; --i)#define pii pair<int, int>#define pll pair<ll, ll>#define fi first#define se second#define pb push_back#define eb emplace_back#define vi vector<int>#define vll vector<ll>#define vpii vector<pii>#define vpll vector<pll>#define vvi(a,b,c,d) vector<vector<int>> a(b,vector<int>(c,d));#define vvll(a,b,c,d) vector<vector<ll>> a(b,vector<ll>(c,d));#define all(a) a.begin(), a.end()#define rall(a) a.rbegin(), a.rend()#define sz(c) ((ll)(c).size())#define endl '\n'using namespace std;template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }//const int MOD = 1000000007;//const int MOD = 998244353;const ll INF = 1e18+1;const int inf = 1e9+1;const double PI = acos(-1);int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};int dy[8] = {0, 1, 0, -1, -1, 1, 1, -1};bool range(int y, int x, int h, int w){if(y < 0 || x < 0 || y >= h || x >= w) return false;else return true;}const int M = 510000;template<int MOD> struct Fp {long long val;constexpr Fp(long long v = 0) noexcept : val(v % MOD) {if (val < 0) val += MOD;}constexpr int getmod() const { return MOD; }constexpr Fp operator - () const noexcept {return val ? MOD - val : 0;}constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }constexpr Fp& operator += (const Fp& r) noexcept {val += r.val;if (val >= MOD) val -= MOD;return *this;}constexpr Fp& operator -= (const Fp& r) noexcept {val -= r.val;if (val < 0) val += MOD;return *this;}constexpr Fp& operator *= (const Fp& r) noexcept {val = val * r.val % MOD;return *this;}constexpr Fp& operator /= (const Fp& r) noexcept {long long a = r.val, b = MOD, u = 1, v = 0;while (b) {long long t = a / b;a -= t * b, swap(a, b);u -= t * v, swap(u, v);}val = val * u % MOD;if (val < 0) val += MOD;return *this;}constexpr bool operator == (const Fp& r) const noexcept {return this->val == r.val;}constexpr bool operator != (const Fp& r) const noexcept {return this->val != r.val;}friend constexpr istream& operator >> (istream& is, Fp<MOD>& x) noexcept {is >> x.val;x.val %= MOD;if (x.val < 0) x.val += MOD;return is;}friend constexpr ostream& operator << (ostream& os, const Fp<MOD>& x) noexcept {return os << x.val;}friend constexpr Fp<MOD> modpow(const Fp<MOD>& r, long long n) noexcept {if (n == 0) return 1;if (n < 0) return modpow(modinv(r), -n);auto t = modpow(r, n / 2);t = t * t;if (n & 1) t = t * r;return t;}friend constexpr Fp<MOD> modinv(const Fp<MOD>& r) noexcept {long long a = r.val, b = MOD, u = 1, v = 0;while (b) {long long t = a / b;a -= t * b, swap(a, b);u -= t * v, swap(u, v);}return Fp<MOD>(u);}};const int MOD = 1000000007;//const int MOD = 998244353;using mint = Fp<MOD>;// Binomial coefficienttemplate<class T> struct BiCoef {vector<T> fact_, inv_, finv_;constexpr BiCoef() {}constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {init(n);}constexpr void init(int n) noexcept {fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);int MOD = fact_[0].getmod();for(int i = 2; i < n; i++){fact_[i] = fact_[i-1] * i;inv_[i] = -inv_[MOD%i] * (MOD/i);finv_[i] = finv_[i-1] * inv_[i];}}constexpr T com(int n, int k) const noexcept {if (n < k || n < 0 || k < 0) return 0;return fact_[n] * finv_[k] * finv_[n-k];}constexpr T fact(int n) const noexcept {if (n < 0) return 0;return fact_[n];}constexpr T inv(int n) const noexcept {if (n < 0) return 0;return inv_[n];}constexpr T finv(int n) const noexcept {if (n < 0) return 0;return finv_[n];}};BiCoef<mint> bc;signed main(){cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(10);int t; cin >> t;while(t--){mint ans = 1;int n; cin >> n;rep(i, n){mint a; cin >> a;ans *= (a+1);}ans -= 1;cout << ans << endl;}return 0;}