제출 #1147944

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1147944		LeonidCuk	Fancy Fence (CEOI20_fancyfence)	C++20	100 / 100	52 ms	2744 KiB

fancyfence

#include <bits/stdc++.h>
using namespace std;
long long int mod=1e9+7;
long long int najdi(long long int a)
{
    return ((a*(a+1))/2LL)%mod;
}
int main()
{
    long long int n,a,res=0;
    cin>>n;
    vector<long long int>v[2];
    stack<pair<int,int>>st;
    for(int i=0;i<n;i++)
    {
        cin>>a;
        v[0].push_back(a);
    }
    for(int i=0;i<n;i++)
    {
        cin>>a;
        v[1].push_back(a);
    }
    for(int i=0;i<n;i++)
    {
        res=(res+najdi(v[0][i])*najdi(v[1][i]))%mod;
        long long int sum=0;
        while(!st.empty()&&(st.top()).first>=v[0][i])
        {
            auto p=st.top();
            st.pop();
            res=(res+((najdi(p.first)*p.second)%mod)*sum)%mod;
            sum=(sum+p.second)%mod;
        }
        res=(res+((najdi(v[0][i])*v[1][i])%mod)*sum)%mod;
        st.push({v[0][i],(sum+v[1][i])%mod});
    }
    long long int sum=0;
    while(!st.empty())
        {
            auto p=st.top();
            st.pop();
            res=(res+((najdi(p.first)*p.second)%mod)*sum)%mod;
            sum=(sum+p.second)%mod;
        }
        cout<<res;
    return 0;
}

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