제출 #1013107

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

fancyfence

#include <bits/stdc++.h>
#define ll long long
#define ar array
#define db double
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define rint(l, r) uniform_int_distribution<int>(l, r)(rng)
template<typename T> bool ckmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; }
template<typename T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }
const int mod = 1e9+7;
int f(int x) {
	return ((ll)x*(x+1)/2)%mod;
}
int mul(int a, int b) {
	return (ll)a*b%mod;
}
void fadd(int &a, int b) {
	a += b;
	if (a >= mod) a -= mod;
}
void test_case() {
	int n; cin >> n;
	vector<int> h(n), w(n);
	for (int &x : h) cin >> x;
	for (int &x : w) cin >> x;
	int ans = 0;
	for (int i = 0; i < n; i++) {
		fadd(ans, mul(f(h[i]), f(w[i])));
		int he = h[i];
		for (int j = i-1; j >= 0; j--) {
			ckmin(he, h[j]);
			fadd(ans, mul(w[i], mul(w[j], f(he))));
		}
	}
	cout << ans << '\n';


}
int main() {
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
//    cin >> t;
    while (t--) test_case();
}

• 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