제출 #945586

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
945586		itslq	Fancy Fence (CEOI20_fancyfence)	C++17	30 / 100	1079 ms	2140 KiB

fancyfence

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

#define int long long

const int MOD = 1e9 + 7;

int md(int x) {
    if (x < 0) return (x % MOD) + MOD;
    if (x < MOD) return x;
    return x % MOD;
}

signed main() {
    int N, minH, ans = 0;
    cin >> N;
    vector<int> H(N), W(N);

    for (int i = 0; i < N; i++) cin >> H[i];
    for (int i = 0; i < N; i++) cin >> W[i];

    for (int i = 0; i < N; i++) {
        minH = H[i];
        ans = md(ans + md(H[i] * (H[i] + 1) / 2) * md(W[i] * (W[i] + 1) / 2));
        for (int j = i + 1; j < N; j++) {
            minH = min(minH, H[j]);
            ans = md(ans + md(W[i] * W[j]) * md(minH * (minH + 1) / 2));
        }
    }

    cout << ans;
}

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