제출 #1125701

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

fancyfence

#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define int long long
int mod=1e9+7;
int32_t main()
{
    int n;
    cin>>n;
    vector<pair<int,int>> fences(n);
    int ans=0;
    for(int i=0;i<n;i++)
    {
        cin>>fences[i].first;
        
    }
    int sum=0;
    for(int i=0;i<n;i++)
    {
        cin>>fences[i].second;
        sum=(sum+fences[i].second)%mod;
        
        
    }
    int col;
    col=(((sum+1)*sum)/2)%mod;
    //cout<<col<<"+";
    ans=(ans+col)%mod;
    int x=0;
    for(int i=0;i<n;i++)
    {
        if(fences[i].first==2)
        {
            x=(fences[i].second+x)%mod;
        }
        if(fences[i].first==1)
        {
            
            ans=(ans+(x+1)*x)%mod;
            //cout<<(((x+1)*x))%mod<<"+";
            x=0;
        }
    }
    ans=(ans+(x+1)*x)%mod;
    //cout<<(((x+1)*x))%mod<<"=";
    cout<<ans;
    return 0;
}

• 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