제출 #745759

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

fancyfence

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

#define int long long

const int MOD = 1e9 +7;

int binpow(int a, int b){
    int ans = 1;
    while(b != 0){
        if(b & 1){
            ans = ans * a % MOD;
        }
        a = a * a % MOD;
        b /= 2;
    }
    return ans;
}

signed main() {
    int n;
    cin >> n;
    vector<int> h(n), w(n);
    int cnt = 0;
    for(int i = 0; i < n; i++){
        cin >> h[i];
    }
    for(int i = 0; i < n; i++){
        cin >> w[i];
        cnt = (cnt + w[i]) % MOD;
    }
    int z = (((cnt * (cnt + 1) % MOD)* h[0]) % MOD) * (h[0] + 1) % MOD;
    int g = binpow(4, MOD - 2);
    z = z * g % MOD;
    cout << z << endl;
    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