제출 #445015

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
445015		osmanallazov	Fancy Fence (CEOI20_fancyfence)	C++14	15 / 100	91 ms	1956 KiB

fancyfence

#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
    // SUBTASK 4---->SOLUTION
    ll n,z,s;
    ll mod=1e9+7;
    cin>>n;
    ll h[n];
    ll w[n];
    for(ll i=0;i<n;i++){
        cin>>h[i];
    }
    ll he=h[0];
    ll we=0;
    for(ll i=0;i<n;i++){
        cin>>w[i];
        we=(we+w[i])%mod;
    }
    if(he%2==0){
        ll p=he/2;
         z=p*(he+1)%mod;
    }
    else{
        ll p=(he+1)/2;
         z=(p*he)%mod;
    }
    if(we%2==0){
        ll p=we/2;
         s=p*(we+1)%mod;
    }
    else{
        ll p=(we+1)/2;
         s=(p*we)%mod;
    }
    ll res=z*s%mod;
    cout<<res;
}

• 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