結果
| 問題 | No.1336 Union on Blackboard |
| ユーザー |
 Gosu_Hiroo
|
| 提出日時 | 2021-01-15 21:25:47 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 14 ms / 2,000 ms |
| コード長 | 13,528 bytes |
| コンパイル時間 | 2,574 ms |
| コンパイル使用メモリ | 198,512 KB |
| 最終ジャッジ日時 | 2025-01-17 18:32:47 |
|
ジャッジサーバーID （参考情報） |
judge1 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 31 |
ソースコード
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
template<typename T, typename U = T>
using P = pair<T, U>;
template<typename T>
using V = vector<T>;
using VI = vector<int>;
using VL = vector<long long>;
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC target("avx512f")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast")
#define G(size_1) vector<vector<int>>(size_1, vector<int>())
#define SZ(x) ((long long)(x).size())
#define READ ({long long t;cin >> t;t;})
#define FOR(i, __begin, __end) for (auto i = (__begin) - ((__begin) > (__end)); i != (__end) - ((__begin) > (__end)); i += 1 - 2 * ((__begin) > (__end)))
#define REP(i, __end) for (auto i = decltype(__end){0}; i < (__end); ++i)
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() )
#define EB emplace_back
#define PB push_back
#define fcout cout << fixed << setprecision(12)
#define fcerr cerr << fixed << setprecision(12)
#define print(x) cout << (x) << '\n'
#define printE(x) cout << (x) << endl;
#define fprint(x) cout << fixed << setprecision(12) << (x) << '\n'
# define BYE(a) do { cout << (a) << endl; return ; } while (false)
#define LB lower_bound
#define UB upper_bound
#define LBI(c, x) distance((c).begin(), lower_bound((c).begin(), (c).end(), (x)))
#define UBI(c, x) distance((c).begin(), upper_bound((c).begin(), (c).end(), (x)))
#ifdef DEBUG
#define DBG(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); _err(cerr,_it, args); }
#define ERR(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); _err(std::cerr,_it, args); }
#else
#define DBG(args...) {};
#define ERR(args...) {};
#endif
void _err(std::ostream& cerr, istream_iterator<string> it){cerr << endl;}
template<typename T, typename... Args>
void _err(std::ostream& cerr, istream_iterator<string> it, T a, Args... args){
cerr << *it << " = " << a << " ";
_err(cerr, ++it, args...);
}
namespace aux{
template<std::size_t...>
struct seq{
};
template<std::size_t N, std::size_t... Is>
struct gen_seq : gen_seq<N - 1, N - 1, Is...>{
};
template<std::size_t... Is>
struct gen_seq<0, Is...> : seq<Is...>{
};
template<class Ch, class Tr, class Tuple, std::size_t... Is>
void print_tuple(std::basic_ostream<Ch, Tr>& os, Tuple const& t, seq<Is...>){
using swallow = int[];
(void) swallow{0, (void(os << (Is == 0 ? "" : ",") << std::get<Is>(t)), 0)...};
}
template<class Ch, class Tr, class Tuple, std::size_t... Is>
void read_tuple(std::basic_istream<Ch, Tr>& os, Tuple& t, seq<Is...>){
using swallow = int[];
(void) swallow{0, (void(os >> std::get<Is>(t)), 0)...};
}
} // aux::
template<class Ch, class Tr, class... Args>
auto operator<<(std::basic_ostream<Ch, Tr>& os, std::tuple<Args...> const& t)
-> std::basic_ostream<Ch, Tr>&{
os << "(";
aux::print_tuple(os, t, aux::gen_seq<sizeof...(Args)>());
return os << ")";
}
template<class Ch, class Tr, class... Args>
auto operator>>(std::basic_istream<Ch, Tr>& os, std::tuple<Args...>& t)
-> std::basic_istream<Ch, Tr>&{
aux::read_tuple(os, t, aux::gen_seq<sizeof...(Args)>());
return os;
}
template<class T>
inline bool chmax(T& a, const T& b){
if(a < b){
a = b;
return 1;
}
return 0;
}
template<class T>
inline bool chmin(T& a, const T& b){
if(b < a){
a = b;
return 1;
}
return 0;
}
template<typename T, typename U>
istream& operator>>(istream& is, pair<T, U>& V){
is >> V.F >> V.S;
return is;
}
template<typename T>
istream& operator>>(istream& is, vector<T>& V){
for(auto&& ele : V)is >> ele;
return is;
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T> V){
os << "[";
int cnt = 0;
T curr;
if(!V.empty()){
for(int i = 0; i < V.size() - 1; ++i){
if(V[i] == curr)cnt++;
else cnt = 0;
if(cnt == 4)os << "... ";
if(cnt < 4)
os << i << ":" << V[i] << " ";
curr = V[i];
}
os << V.size() - 1 << ":" << V.back();
}
os << "]\n";
return os;
}
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U> P){
os << "(";
os << P.first << "," << P.second;
os << ")";
return os;
}
template<typename T, typename U>
ostream& operator<<(ostream& os, const set<T, U> V){
os << "{";
if(!V.empty()){
auto it = V.begin();
for(int i = 0; i < V.size() - 1; ++i){
os << *it << " ";
it++;
}
os << *it;
}
os << "}\n";
return os;
}
template<typename K, typename H, typename P>
ostream& operator<<(ostream& os, const unordered_set<K, H, P> V){
os << "{";
if(!V.empty()){
auto it = V.begin();
for(int i = 0; i < V.size() - 1; ++i){
os << *it << " ";
it++;
}
os << *it;
}
os << "}\n";
return os;
}
template<typename K, typename C>
ostream& operator<<(ostream& os, const multiset<K, C> V){
os << "{";
if(!V.empty()){
auto it = V.begin();
for(int i = 0; i < V.size() - 1; ++i){
os << *it << " ";
it++;
}
os << *it;
}
os << "}";
return os;
}
template<typename K, typename T, typename C>
ostream& operator<<(ostream& os, const map<K, T, C> V){
os << "{";
if(!V.empty()){
auto it = V.begin();
for(int i = 0; i < V.size() - 1; ++i){
os << "(";
os << it->first << "," << it->second;
os << ") ";
it++;
}
os << "(";
os << it->first << "," << it->second;
os << ")";
}
os << "}\n";
return os;
}
template<typename K, typename T, typename C>
ostream& operator<<(ostream& os, const unordered_map<K, T, C> V){
os << "{";
if(!V.empty()){
auto it = V.begin();
for(int i = 0; i < V.size() - 1; ++i){
os << "(";
os << it->first << "," << it->second;
os << ") ";
it++;
}
os << "(";
os << it->first << "," << it->second;
os << ")";
}
os << "}\n";
return os;
}
template<typename T>
ostream& operator<<(ostream& os, const deque<T> V){
os << "[";
if(!V.empty()){
for(int i = 0; i < V.size() - 1; ++i){
os << V[i] << "->";
}
if(!V.empty())os << V.back();
}
os << "]\n";
return os;
};
template<typename T, typename Cont, typename Comp>
ostream& operator<<(ostream& os, const priority_queue<T, Cont, Comp> V){
priority_queue<T, Cont, Comp> _V = V;
os << "[";
if(!_V.empty()){
while(_V.size() > 1){
os << _V.top() << "->";
_V.pop();
}
os << _V.top();
}
os << "]\n";
return os;
};
template<class F>
struct y_combinator{
F f; // the lambda will be stored here
// a forwarding operator():
template<class... Args>
decltype(auto) operator()(Args&& ... args) const{
// we pass ourselves to f, then the arguments.
// the lambda should take the first argument as `auto&& recurse` or similar.
return f(*this, std::forward<Args>(args)...);
}
};
// helper function that deduces the type of the lambda:
template<class F>
y_combinator<std::decay_t<F>> recursive(F&& f){
return {std::forward<F>(f)};
}
struct hash_pair{
template<class T1, class T2>
size_t operator()(const pair<T1, T2>& p) const{
auto hash1 = hash<T1>{}(p.first);
auto hash2 = hash<T2>{}(p.second);
return hash1^hash2;
}
};
template<typename U>
auto vec(int n, U v){
return std::vector(n, v);
}
template<typename... Args>
auto vec(int n, Args... args){
auto val = vec(std::forward<Args>(args)...);
return std::vector<decltype(val)>(n, std::move(val));
}
const double PI = 2*acos(.0);
const int INF = 0x3f3f3f3f;
template<class T>
inline T ceil(T a, T b){return (a + b - 1)/b;}
inline long long popcount(ll x){return __builtin_popcountll(x);}
template <signed M, unsigned T>
struct mod_int {
constexpr static signed MODULO = M;
constexpr static unsigned TABLE_SIZE = T;
signed x;
mod_int() : x(0) {}
mod_int(long long y) : x(static_cast<signed>(y >= 0 ? y % MODULO : MODULO - (-y) % MODULO)) {}
mod_int(int y) : x(y >= 0 ? y % MODULO : MODULO - (-y) % MODULO) {}
explicit operator int() const
{
return x;
}
explicit operator long long() const
{
return x;
}
explicit operator double() const
{
return x;
}
mod_int &operator+=(const mod_int &rhs) {
if ((x += rhs.x) >= MODULO) x -= MODULO;
return *this;
}
mod_int &operator-=(const mod_int &rhs) {
if ((x += MODULO - rhs.x) >= MODULO) x -= MODULO;
return *this;
}
mod_int &operator*=(const mod_int &rhs) {
x = static_cast<signed>(1LL * x * rhs.x % MODULO);
return *this;
}
mod_int &operator/=(const mod_int &rhs) {
x = static_cast<signed>((1LL * x * rhs.inv().x) % MODULO);
return *this;
}
mod_int operator-() const { return mod_int(-x); }
mod_int operator+(const mod_int &rhs) const { return mod_int(*this) += rhs; }
mod_int operator-(const mod_int &rhs) const { return mod_int(*this) -= rhs; }
mod_int operator*(const mod_int &rhs) const { return mod_int(*this) *= rhs; }
mod_int operator/(const mod_int &rhs) const { return mod_int(*this) /= rhs; }
bool operator<(const mod_int &rhs) const { return x < rhs.x; }
mod_int inv() const {
assert(x != 0);
if (x <= static_cast<signed>(TABLE_SIZE)) {
if (_inv[1].x == 0) prepare();
return _inv[x];
} else {
signed a = x, b = MODULO, u = 1, v = 0, t;
while (b) {
t = a / b;
a -= t * b;
std::swap(a, b);
u -= t * v;
std::swap(u, v);
}
return mod_int(u);
}
}
mod_int pow(long long t) const {
assert(!(x == 0 && t == 0));
mod_int e = *this, res = mod_int(1);
for (; t; e *= e, t >>= 1)
if (t & 1) res *= e;
return res;
}
mod_int fact() {
if (_fact[0].x == 0) prepare();
return _fact[x];
}
mod_int inv_fact() {
if (_fact[0].x == 0) prepare();
return _inv_fact[x];
}
mod_int choose(mod_int y) {
assert(y.x <= x);
return this->fact() * y.inv_fact() * mod_int(x - y.x).inv_fact();
}
static mod_int _inv[TABLE_SIZE + 1];
static mod_int _fact[TABLE_SIZE + 1];
static mod_int _inv_fact[TABLE_SIZE + 1];
static void prepare() {
_inv[1] = 1;
for (int i = 2; i <= (int)TABLE_SIZE; ++i) {
_inv[i] = 1LL * _inv[MODULO % i].x * (MODULO - MODULO / i) % MODULO;
}
_fact[0] = 1;
for (unsigned i = 1; i <= TABLE_SIZE; ++i) {
_fact[i] = _fact[i - 1] * int(i);
}
_inv_fact[TABLE_SIZE] = _fact[TABLE_SIZE].inv();
for (int i = (int)TABLE_SIZE - 1; i >= 0; --i) {
_inv_fact[i] = _inv_fact[i + 1] * (i + 1);
}
}
};
template <int M, unsigned F>
std::ostream &operator<<(std::ostream &os, const mod_int<M, F> &rhs) {
return os << rhs.x;
}
template <int M, unsigned F>
std::istream &operator>>(std::istream &is, mod_int<M, F> &rhs) {
long long s;
is >> s;
rhs = mod_int<M, F>(s);
return is;
}
template <int M, unsigned F>
mod_int<M, F> mod_int<M, F>::_inv[TABLE_SIZE + 1];
template <int M, unsigned F>
mod_int<M, F> mod_int<M, F>::_fact[TABLE_SIZE + 1];
template <int M, unsigned F>
mod_int<M, F> mod_int<M, F>::_inv_fact[TABLE_SIZE + 1];
template <int M, unsigned F>
bool operator==(const mod_int<M, F> &lhs, const mod_int<M, F> &rhs) {
return lhs.x == rhs.x;
}
template <int M, unsigned F>
bool operator!=(const mod_int<M, F> &lhs, const mod_int<M, F> &rhs) {
return !(lhs == rhs);
}
constexpr int MF = 1000010;
constexpr int MOD = 1000000007;
//constexpr int MOD = 998244353;
using mint = mod_int<MOD, MF>;
mint binom(int n, int r) { return (r < 0 || r > n || n < 0) ? 0 : mint(n).choose(r); }
mint fact(int n) { return mint(n).fact(); }
mint inv_fact(int n) { return mint(n).inv_fact(); }
void solve(std::istream& cin, std::ostream& cout, std::ostream& cerr){
auto solve = [&](){
int N;cin >> N;
VI a(N);cin>> a;
mint ans = 0;
REP(i,N)ans = ans*a[i]+ans+a[i];
print(ans);
};
int testcases;
cin >> testcases;
for(int case_num = 1; case_num <= testcases; case_num++){
solve();
}
}
#undef int
int main() {
istream& in(cin);
ostream& out(cout);
ostringstream err;
in.tie(0); ios::sync_with_stdio(0);
solve(in, out, err);
return 0;
}