제출 #1234940

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1234940		jundi	Fancy Fence (CEOI20_fancyfence)	C++20	13 / 100	31 ms	2632 KiB

fancyfence

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

#define lint long long int
int mod=1e9+7;

int main(){
    int n;
    cin>>n;
    vector<lint> h(n);
    vector<lint> w(n);
    vector<lint> cntw(n,0);
    for(int i=0;i<n;i++){
        cin>>h[i];
    }
    for(int i=0;i<n;i++){
        cin>>w[i];
        if(i==0) cntw[i]=w[i];
        else cntw[i]=w[i]+cntw[i-1];
        cntw[i]%=mod;
    }
    lint sum=(((1+cntw[n-1])%mod)*(cntw[n-1]%mod)/2);
    lint re=0;
    sum%=mod;
    for(int i=0;i<n;i++){
        if(h[i]==2 && h[i+1]==2) re+=w[i];
        else if(h[i]==2){
            re+=w[i];
            lint huh=(((re+1)%mod)*(re%mod));
            huh%=mod;
            sum+=huh; sum%=mod;
            re=0;
        }
    }
    cout<<sum;
}

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