結果
問題 | No.754 畳み込みの和 |
ユーザー |
![]() |
提出日時 | 2018-12-22 11:32:29 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 82 ms / 5,000 ms |
コード長 | 2,450 bytes |
コンパイル時間 | 1,650 ms |
コンパイル使用メモリ | 169,532 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-09-25 10:06:41 |
合計ジャッジ時間 | 2,271 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 3 |
ソースコード
#include<bits/stdc++.h>using namespace std;#define FOR(i,n,m) for(int i=(n);i<(m);i++)#define REP(i,n) FOR(i,0,n)#define all(vec) vec.begin(),vec.end()using ll=long long;using vi=vector<int>;using vvi=vector<vi>;using vl=vector<ll>;using vvl=vector<vl>;using P=pair<int,int>;using PP=pair<int,P>;#define pb push_back#define fi first#define se secondconst int MOD=1e9+7;const int INF=1e9;const ll LINF=1LL<<60;template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}template<class T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}template<int mod>struct ModInt{int x;ModInt():x(0){}ModInt(long long y):x(y>=0?y%mod:(mod-(-y)%mod)%mod){}ModInt &operator+=(const ModInt &p){if((x+=p.x)>=mod)x-=mod;return *this;}ModInt &operator-=(const ModInt &p){if((x+=mod-p.x)>=mod)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;}bool operator==(const ModInt &p)const{return x==p.x;}bool operator!=(const ModInt &p)const{return x!=p.x;}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);}friend ostream &operator<<(ostream &os,const ModInt<mod> &p){return os<<p.x;}friend istream &operator>>(istream &is,ModInt<mod> &a){long long x;is>>x;a=ModInt<mod>(x);return (is);}};const int mod=1e9+7;using mint=ModInt<mod>;int main(){int n;cin>>n;n++;vector<mint> a(n);REP(i,n){cin>>a[i];}vector<mint> b(n);REP(i,n){cin>>b[i];}mint ans=0;mint sum=0;REP(i,n){sum+=a[i];}REP(i,n){ans+=sum*b[i];sum-=a.back();a.pop_back();}cout<<ans<<endl;return 0;}