제출 #963038

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
963038		anton	Fancy Fence (CEOI20_fancyfence)	C++17	13 / 100	15 ms	4208 KiB

fancyfence

#include<bits/stdc++.h>

using namespace std;
#define int long long
#define pii pair<int,int>

const int MAX_N = 1e5+1;
const int mod =1e9+7;

int h[MAX_N];
int w[MAX_N];

int nbp(int u){
    return (u*(u+1LL)/2LL)%mod;
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n; 
    cin>>n;
    int sw = 0;
    vector<pair<int, int>> ev;
    for(int i = 0; i<n; i++){
        cin>>h[i];
    }
    for(int i = 0; i<n; i++){
        cin>>w[i];
        sw = (sw+w[i])%mod;
    }

    h[n] = 0;
    w[n] = 0;

    for(int i= 0; i<=n; i++){
        if(i == 0 || h[i] != h[i-1]){
            ev.push_back({h[i], w[i]});
        }
        else{
            ev.back().second  =(ev.back().second+w[i])%mod;
        }
    }




    int res= 0;
    
    res= nbp(sw);

    for(auto e: ev){
        if(e.first == 2){
            res = (res + 2LL*nbp(e.second))%mod;
        }
    }
    cout<<res<<endl;


}

• 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