結果
問題 | No.1336 Union on Blackboard |
ユーザー | packer_jp |
提出日時 | 2021-01-16 00:47:42 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 4 ms / 2,000 ms |
コード長 | 5,476 bytes |
コンパイル時間 | 2,133 ms |
コンパイル使用メモリ | 203,032 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-05-05 02:19:17 |
合計ジャッジ時間 | 3,070 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 3 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 3 ms
5,376 KB |
testcase_04 | AC | 3 ms
5,376 KB |
testcase_05 | AC | 3 ms
5,376 KB |
testcase_06 | AC | 3 ms
5,376 KB |
testcase_07 | AC | 3 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 3 ms
5,376 KB |
testcase_10 | AC | 3 ms
5,376 KB |
testcase_11 | AC | 4 ms
5,376 KB |
testcase_12 | AC | 3 ms
5,376 KB |
testcase_13 | AC | 4 ms
5,376 KB |
testcase_14 | AC | 3 ms
5,376 KB |
testcase_15 | AC | 4 ms
5,376 KB |
testcase_16 | AC | 3 ms
5,376 KB |
testcase_17 | AC | 3 ms
5,376 KB |
testcase_18 | AC | 4 ms
5,376 KB |
testcase_19 | AC | 3 ms
5,376 KB |
testcase_20 | AC | 4 ms
5,376 KB |
testcase_21 | AC | 3 ms
5,376 KB |
testcase_22 | AC | 4 ms
5,376 KB |
testcase_23 | AC | 3 ms
5,376 KB |
testcase_24 | AC | 3 ms
5,376 KB |
testcase_25 | AC | 3 ms
5,376 KB |
testcase_26 | AC | 4 ms
5,376 KB |
testcase_27 | AC | 3 ms
5,376 KB |
testcase_28 | AC | 4 ms
5,376 KB |
testcase_29 | AC | 4 ms
5,376 KB |
testcase_30 | AC | 1 ms
5,376 KB |
testcase_31 | AC | 2 ms
5,376 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define int long long #define rep(i, n) for (int i = 0; i < (int) (n); i++) #define reps(i, n) for (int i = 1; i <= (int) (n); i++) #define all(a) (a).begin(), (a).end() #define uniq(a) (a).erase(unique(all(a)), (a).end()) #define dump(a) cerr << #a " = " << (a) << endl using vint = vector<int>; using pint = pair<int, int>; using vpint = vector<pint>; template<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>; constexpr double PI = 3.1415926535897932384626433832795028; constexpr int DY[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0}; constexpr int DX[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0}; int bit(int n) { return 1LL << n; } int sign(int a) { return (a > 0) - (a < 0); } int cdiv(int a, int b) { return (a - 1 + b) / b; } template<typename T> T sq(T a) { return a * a; } template<typename T> void fin(T a) { cout << a << endl; exit(0); } template<typename T, typename U> bool chmax(T &a, const U &b) { if (a < b) { a = b; return true; } return false; } template<typename T, typename U> bool chmin(T &a, const U &b) { if (b < a) { a = b; return true; } return false; } template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &a) { os << "(" << a.first << ", " << a.second << ")"; return os; } template<typename T, typename U, typename V> ostream &operator<<(ostream &os, const tuple<T, U, V> &a) { os << "(" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ")"; return os; } template<typename T> ostream &operator<<(ostream &os, const vector<T> &a) { os << "("; for (auto itr = a.begin(); itr != a.end(); itr++) { os << *itr << (next(itr) != a.end() ? ", " : ""); } os << ")"; return os; } template<typename T> ostream &operator<<(ostream &os, const deque<T> &a) { os << "("; for (auto itr = a.begin(); itr != a.end(); itr++) { os << *itr << (next(itr) != a.end() ? ", " : ""); } os << ")"; return os; } template<typename T> ostream &operator<<(ostream &os, const set<T> &a) { os << "{"; for (auto itr = a.begin(); itr != a.end(); itr++) { os << *itr << (next(itr) != a.end() ? ", " : ""); } os << "}"; return os; } template<typename T> ostream &operator<<(ostream &os, const multiset<T> &a) { os << "{"; for (auto itr = a.begin(); itr != a.end(); itr++) { os << *itr << (next(itr) != a.end() ? ", " : ""); } os << "}"; return os; } template<typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &a) { os << "{"; for (auto itr = a.begin(); itr != a.end(); itr++) { os << *itr << (next(itr) != a.end() ? ", " : ""); } os << "}"; return os; } struct setup { static constexpr int PREC = 20; setup() { cout << fixed << setprecision(PREC); cerr << fixed << setprecision(PREC); } } setup; template<int MOD = 1000000007> struct mod_int { int v; mod_int(long long v_ = 0) : v(v_ % MOD) { if (v < 0) { v += MOD; }} static int mod() { return MOD; } int val() const { return v; } mod_int &operator+=(const mod_int &a) { if ((v += a.v) >= MOD) { v -= MOD; } return *this; } mod_int &operator-=(const mod_int &a) { if ((v += MOD - a.v) >= MOD) { v -= MOD; } return *this; } mod_int &operator*=(const mod_int &a) { v = (int) ((long long) v * a.v % MOD); return *this; } mod_int &operator/=(const mod_int &a) { return *this *= a.inv(); } mod_int operator+() const { return *this; } mod_int operator-() const { return -v; } mod_int operator++() { return *this += 1; } mod_int operator--() { return *this -= 1; } mod_int operator++(signed) { const mod_int ret(*this); ++*this; return ret; } mod_int operator--(signed) { const mod_int ret(*this); --*this; return ret; } mod_int inv() const { int a = v, b = MOD, x = 1, u = 0; while (b) { int t = a / b; std::swap(a -= t * b, b), std::swap(x -= t * u, u); } return x; } mod_int pow(long long n) const { if (n < 0) { return pow(-n).inv(); } mod_int ret = 1, mul = *this; while (n) { if (n & 1) { ret *= mul; } mul *= mul, n >>= 1; } return ret; } friend bool operator==(const mod_int &a, const mod_int &b) { return a.v == b.v; } friend bool operator!=(const mod_int &a, const mod_int &b) { return std::rel_ops::operator!=(a, b); } friend mod_int operator+(mod_int a, const mod_int &b) { return a += b; } friend mod_int operator-(mod_int a, const mod_int &b) { return a -= b; } friend mod_int operator*(mod_int a, const mod_int &b) { return a *= b; } friend mod_int operator/(mod_int a, const mod_int &b) { return a /= b; } friend std::istream &operator>>(std::istream &is, mod_int &a) { long long v; is >> v, a = v; return is; } friend std::ostream &operator<<(std::ostream &os, const mod_int &a) { return os << a.v; } }; using mint = mod_int<>; signed main() { int T; cin >> T; while (T--) { int N; cin >> N; vint A(N); rep(i, N) { cin >> A[i]; } mint ans = 1; rep(i, N) { ans *= A[i] + 1; } ans--; cout << ans << endl; } }