제출 #945279

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

fancyfence

#include <bits/stdc++.h>
using namespace std;
#define int long long

int n;
int w[100005];
int h[100005];
int ans = 0;
int width = 0;
int height;
int mod = 1000000000 + 7;

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    // w(w+1)h(h+1)/4
    cin >> n;
    for(int i = 0; i < n; i++)cin >> h[i];
        for(int i = 0; i < n; i++){
        cin >> w[i];
        width += w[i];
        width %= mod;
    }
    if(width % 2 == 0){ // all rectangle for h=1
        ans += (width+1)*(width/2);
        ans %= mod;
    } else {
        ans += (width*(width-1)/2)+width;
        ans %= mod;
    }
    height = h[0]%mod;
    if(height % 2 == 0){ // all rectangle for h=1
        ans *= (height+1)*(height/2);
        ans %= mod;
    } else {
        ans *= (height*(height-1)/2)+height;
        ans %= mod;
    }
    cout << ans;


    // int temp = (width*(width+1)/2)%mod;
    // int ht = h[0]%mod;
    // int temp2 = ht*(ht+1)/2%mod;
    // ans = (temp*temp2)%mod;
    // cout << ans;
    return 0;
}

• 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