제출 #900639

#제출 시각아이디문제언어결과실행 시간메모리
9006393laaFancy Fence (CEOI20_fancyfence)C++14
0 / 100
1 ms348 KiB
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
#include <unordered_map>
#define endl '\n'
#define mid ((l+r)/2)
#define  F first
#define  S second
#define pb push_back
#define yes void (cout<<"YES"<<endl)
#define no void (cout<<"NO"<<endl)
#define ump unordered_map <ll,ll>
#define sp " "
#define vll vector<ll>
#define vint vector<int>
#define pll pair<ll,ll>
typedef long long ll;
using namespace std;
const ll inf=1e18+9;
//const int N=2e5+9;
const ll M=1e9+7;
ll n,m,N;
ll w[100009];
int main(){
    cin>>N;
    for(ll i=0 ; i<N ; i++){
        cin>>n;
    }
    for(ll i=0 ; i<N ; i++){
        cin>>w[i];
        m+=w[i];
    }
    ll x=((n*(n+1))/2)%M;
    ll y=((m*(m+1))/2)%M;
    cout<<(x*y)%M<<endl;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...