제출 #906427

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
906427		Ludissey	Fancy Fence (CEOI20_fancyfence)	C++14	15 / 100	23 ms	2040 KiB

fancyfence

#include <bits/stdc++.h>
using namespace std;
#define int long long
 
int n,m;
int mod=1e9+7;
int clc(int x) { return (((x*(x+1)))/(long long)2)%mod; }
signed main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    cin >> n;
    vector<int> h(n+1);
    vector<int> w(n+1);
    int totalw=0;
    for (int i = 1; i <= n; i++) cin>>h[i];
    for (int i = 1; i <= n; i++) { cin >> w[i]; totalw=(totalw+w[i])%mod; }
    int outp=0;
    h[0]=0;
    for (int i = 1; i <= n; i++)
    {
        int side1=(clc(totalw%mod)*clc(h[i]%mod));
        int side2=(clc(totalw%mod)*clc(h[i-1]%mod));
        side1-=side2;
        side1%=mod;
        outp+=side1;
        outp%=mod;
        totalw-=w[i];
    }
    outp%=mod;
    cout << outp << "\n";
    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