제출 #1125712

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1125712		EfeBabagil	Fancy Fence (CEOI20_fancyfence)	C++20	15 / 100	61 ms	3400 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);
    vector<int> pref(n),suf(n);

    
    for(int i=0;i<n;i++)
    {
        cin>>fences[i].first;
    }
    
    for(int i=0;i<n;i++)
    {
        cin>>fences[i].second;
    }
    pref[0]=fences[0].second;
    suf[n-1]=fences[n-1].second;
    
    for(int i=n-2;i>=0;i--)
    {
        suf[i]=(suf[i+1]+fences[i].second)%mod;
        
    }
    /*
    for(int i=0;i<n;i++)
    cout<<suf[i]<<" ";
    cout<<endl;*/
    int ans=0;
    int w,h,row,col;
    for(int i=0;i<n;i++)
    {
        if(i==0)
        {
            w=suf[i];
            h=fences[i].first;
            row=(((h+1)*h)/2)%mod;
            col=(((w+1)*w)/2)%mod;
            
            ans=(ans+row*col)%mod;
        }
        else if(fences[i].first==fences[i-1].first)
        {
            continue;
        }
        else
        {
            h=fences[i].first;
            w=suf[i];
            row=(((h+1)*h)/2)%mod;
            h=fences[i-1].first;
            row=(row-((h+1)*h)/2)%mod;
            col=(((w+1)*w)/2)%mod;
            //cout<<row<<" "<<col<<endl;
            ans=(ans+row*col)%mod;
        }
    }
    cout<<ans;
    return 0;
}

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