Submission #870437

#	Time	Username	Problem	Language	Result	Execution time	Memory
870437		gutzzy	Fancy Fence (CEOI20_fancyfence)	C++14	15 / 100	57 ms	3924 KiB

fancyfence

#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;

int main(){
    int n;
    cin >> n;
    vector<long long> h(n);
    vector<long long> w(n);
    long long m=0;
    for(int i=0;i<n;i++) cin >> h[i];
    for(int i=0;i<n;i++){
        cin >> w[i];
        m += w[i];
    }
    h[0] = h[0]%mod;
    m = m%mod;
    long long p = (h[0]*(h[0]+1)/2)%mod;
    long long q = (m*(m+1)/2)%mod;
    cout << (p*q)%mod << endl;
    

    return 0;
}

• Subtask 1: 0 / 0
• Subtask 2: 0 / 12
• Subtask 3: 0 / 13
• Subtask 4: 15 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 18
• Subtask 7: 0 / 27