제출 #922045

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

fancyfence

#include <bits/stdc++.h>
#define int long long
 
using namespace std;
 
const int MOD = 1e9+7, INV = 250000002;
 
int mod(int n) {
    return (n + 3 * MOD) % MOD;
}
int f(int h, int w) {
	h%=MOD, w%=MOD;
	int facteur=mod((h*(h+1))/2);
	int ans=mod((w*(w+1))/2);
	return mod(ans*facteur);
}
 
signed main() {
    //input and sum
    int n;
    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];
    //linearily go over and compute result
    int res = 0, temp;
    for(int i = 0; i < n; i++) {
        int minH = h[i], sumW = w[i];
        res = mod(res + f(minH, sumW));
        for(int j = i+1; j < n; j++) {
            minH = min(minH, h[i]), sumW = mod(sumW + w[j]);
            temp = f(minH, sumW);
            temp -= mod(f(minH, sumW - w[j]) + f(minH, sumW - w[i]));
            temp = mod(temp);
            temp += f(minH, sumW - w[i] - w[j]);
            res = mod(res + mod(temp));
        }
    }
    cout << res << "\n";
}

• 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