結果

問題 No.754 畳み込みの和
ユーザー tossy
提出日時 2018-12-08 20:54:52
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 82 ms / 5,000 ms
コード長 2,860 bytes
コンパイル時間 1,634 ms
コンパイル使用メモリ 169,156 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-09-14 08:45:09
合計ジャッジ時間 2,908 ms
ジャッジサーバーID
(参考情報)
judge6 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 3
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
#define _MACRO(_1, _2, _3, NAME, ...) NAME
#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define _rep(i,n) _repl(i,0,n)
#define rep(...) _MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)
#define pb push_back
#define all(x) begin(x),end(x)
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#ifdef LOCAL
#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
void _dbg(string){cerr<<endl;}
template<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cerr<<s.substr(0,l)<<" = "<<h<<", ";_dbg(s.substr(l+1),t...);}
template<class T,class U> ostream& operator<<(ostream &o, const pair<T,U> &p){o<<"("<<p.first<<","<<p.second<<")";return o;}
template<class T> ostream& operator<<(ostream &o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}
#else
#define dbg(...) {}
#endif
template<int mod=1000000007>
class ModInt {
int x;
public:
ModInt() : x(0) {}
ModInt(const ModInt &y): x(y.x) {}
ModInt(int64_t y){ x = y % mod; if(x < 0) x += mod; }
ModInt &operator += (const ModInt &p){ x += p.x; if(x >= mod) x -= mod; return *this; }
ModInt &operator -= (const ModInt &p){ x -= p.x; if(x < 0) x += mod; return *this; }
ModInt &operator *= (const ModInt &p){ x = (int) (1LL * x * p.x % mod); return *this; }
ModInt &operator /= (const ModInt &p){ *this *= p.inverse(); return *this; }
ModInt operator -() const { return ModInt(-x); }
ModInt operator + (const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator - (const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator * (const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator / (const ModInt &p) const { return ModInt(*this) /= p; }
ModInt operator ^ (const int64_t y) const { return pow(y); }
bool operator == (const ModInt &p) const { return x == p.x; }
bool operator != (const ModInt &p) const { return x != p.x; }
ModInt operator = (const int64_t y) { return *this = ModInt(y); }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while(b > 0){
t = a/b; a -= t*b; swap(a, b);
u -= t*v; swap(u, v);
}
return ModInt(u);
}
ModInt pow(int64_t y) const {
if(x==0) return ModInt(0);
int64_t r = 1, t = x;
while(y > 0){
if(y&1) r = r*t%mod;
t = t*t%mod; y >>= 1;
}
return ModInt(r);
}
friend ostream &operator << (ostream &os, const ModInt<mod> &p) { return os<<p.x; }
friend istream &operator >> (istream &is, ModInt<mod> &a) { int64_t x; is>>x; a = ModInt<mod>(x); return is; }
};
using Int = ModInt<>;
int main(){
int n;
cin>>n;
vector<Int> a(n+1), b(n+1);
rep(i,n+1) cin>>a[i];
rep(i,n+1) cin>>b[i];
Int acc = 0;
rep(i,n+1) acc += a[i];
Int ans = 0;
rep(i,n+1){
ans += b[i]*acc;
acc -= a[n-i];
}
cout << ans << endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0