제출 #1256349

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

fancyfence

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

typedef long long ll;

#define pb push_back


const int maxn = 1e5 + 10;
const int mod = 1e9 + 7;

int n, L[maxn], dp[maxn], h[maxn], w[maxn], ps[maxn];


int C(int a) {
	return 1ll * a * (a - 1) % mod;
}
signed main() {
	cin >> n;
	for (int i = 1; i <= n; i++)
		cin >> h[i] >> w[i];

	stack<int> st;
	for (int i = 1; i <= n; i++) {
		while (!st.empty() && h[st.top()] >= h[i])
			st.pop();
		L[i] = 0;
		if (!st.empty())
			L[i] = st.top();
		st.push(i);
	}

	for (int i = 1; i <= n; i++) {
		ps[i] = ps[i - 1] + w[i];
		ps[i] %= mod;
	}

	ll ans = 0;
	for (int i = 1; i <= n; i++) {
		dp[i] = dp[L[i]] + (1ll * C(h[i] + 1) * ((ps[i] - ps[L[i]] + mod) % mod) % mod) % mod;
		ans += dp[i];
		ans %= mod;
		dp[i] %= mod;
	}
	cout << ans << '\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