Submission #1219071

#	Time	Username	Problem	Language	Result	Execution time	Memory
1219071		maimot	Fancy Fence (CEOI20_fancyfence)	C++20	0 / 100	1 ms	328 KiB

fancyfence

#include<bits/stdc++.h>
using namespace std;
using ll = long long;

const ll maxn = 1e5+5;
const ll mod = 1e9+7;

ll n, h[maxn], w[maxn];

namespace sub3
{
    bool check()
    {
        for(int i=1; i<n; i++)
            if(h[i] != h[i+1])
            return 0;
        return 1;
    }

    void solve()
    {
        ll m =0;
        for(int i=1; i<=n; i++)
            m += w[i];
//        cout<<m<<' '<<h[1]<<'\n';
        ll res= (m*(m+1)%mod)/2 * ((h[1]*(h[1]+1)%mod)/2)%mod;
        cout<<res;
    }
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin.tie(0);

    cin>>n;
    for(int i=1; i<=n; i++)
        cin>>h[i];
    for(int i=1; i<=n; i++)
        cin>>w[i];

    if(sub3::check())return sub3::solve(), 0;

}
/*

2
2 2
1 2

*/

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