제출 #790875

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
790875		12345678	Fancy Fence (CEOI20_fancyfence)	C++17	25 / 100	19 ms	6864 KiB

fancyfence

#include <bits/stdc++.h>

using namespace std;

#define ll long long

const ll nx=1e5+5, mod=1e9+7;
ll n, ans, h, w, sm, H[nx], W[nx];
stack<pair<pair<ll, ll>, ll>> s;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    for (int i=0; i<n; i++) cin>>H[i];
    for (int i=0; i<n; i++) cin>>W[i];
    for (int i=0; i<n; i++)
    {
        ll h=H[i], w=W[i];
        ans=(ans+(((h+1)*h/2)%mod*((w+1)*w/2)%mod)%mod)%mod;
        //cout<<i<<' '<<ans<<' '<<sm<<'\n';
        ll sw=0;
        while (!s.empty()&&s.top().first.first>h)
        {
            sw+=s.top().first.second;
            sm=((sm-s.top().second)%mod+mod)%mod;
            s.pop();
        }
        ll tmp=(((h+1)*h/2)%mod*sw)%mod;
        s.push({{h, sw}, tmp});
        sm=(sm+tmp)%mod;
        ans=(ans+sm*w)%mod;
        //cout<<i<<' '<<ans<<' '<<sm<<'\n';
        tmp=(((h+1)*h/2)%mod*w)%mod;
        s.push({{h, w}, tmp});
        sm+=tmp;
    }
    cout<<ans;
}

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