제출 #444995

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

fancyfence

#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
    // SUBTASK 4---->SOLUTION
    ll n;
    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];
    }
    ll res=(he*(he+1)*we*(we+1)/4)/mod;
    cout<<res;
}

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