제출 #628758

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
628758		Iwanttobreakfree	Fancy Fence (CEOI20_fancyfence)	C++17	12 / 100	1092 ms	1984 KiB

fancyfence

#include <iostream>
#include <vector>
#include <map>
#include <stack>
using namespace std;
const int mod=1e9+7;
#define int long long
signed main(){
    int n;
    cin>>n;
    vector<int> v(n),h(n),pre(n+1);
    map<int,int> mp;
    for(int& i:h)cin>>i;
    for(int& i:v)cin>>i;
    for(int i=0;i<n;i++)pre[i+1]=(pre[i]+v[i])%mod;
    long long ans=0;
    for(int i=0;i<n;i++){
        ans+=(((v[i]*(v[i]+1)/2)%mod)*(h[i]*(h[i]+1)/2)%mod)%mod;
        ans%=mod;
        int he=h[i];
        for(int j=i+1;j<n;j++){
            he=min(he,h[j]);
            ans+=(((v[j]*(v[i]))%mod)*(he*(he+1)/2)%mod)%mod;
            ans%=mod;
            //cout<<ans<<' ';
        }
        //cout<<ans<<'\n';
    }
    cout<<ans;
}

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