제출 #945732

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

fancyfence

#include <bits/stdc++.h>
//#define DEBUG 1106
#define int long long
#define ll long long
#define ld long double
#define pb push_back
#define p_q priority_queue
#define m_p make_pair
#define pii pair<int,int>
#define endl '\n'
#define INIT ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define FOR(i,a,b) for(int i = a; i <= b; i++)
#define forn(i,n) for (int i = 0; i < n; i++)
#define forn1(i,n) for (int i = 1; i <= n; i++)
#define all(x) x.begin(),x.end()
#define ft first
#define sd second
#define lowbit(x) (x&(-x))
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
#ifdef DEBUG
#define debug(x) cout << #x << ": " << x << endl;
#else
#define debug(x) 1106;
#endif

using namespace std;
const int N = 2e5+5;
const int inf = 1e9;
const int INF = 1e18;
const int MOD = 1e9+7;

int h[N],w[N];

signed main() {
	INIT
	#ifdef DEBUG
	freopen("input.txt", "r", stdin);
	#endif
	///////////
	int n;
	cin >> n;
	forn1(i,n) {
		cin >> h[i];
	}
	int t = 0;
	forn1(i,n) {
		cin >> w[i];
		t += w[i];
		t = (t%MOD+MOD+MOD)%MOD;
	}
	int ans = t*(t+1)/2;
	ans = (ans%MOD+MOD+MOD)%MOD;
	t = 0;
	forn1(i,n) {
		if(h[i]==1) {
			ans += w[i];
			if(h[i-1]==1) {
				
			} else {
				ans += t*(t+1)/2;
				t = 0;
			}
		} else {
			ans += w[i]*2;
			if(h[i-1]==1) {
				ans += w[i]-1;
				ans += t*(t+1)/2;
				t = 0;
			} else {
				ans += w[i];
				t += w[i];
				t = (t%MOD+MOD+MOD)%MOD;
			}
		}
		ans = (ans%MOD+MOD+MOD)%MOD;
	}
	cout << ans;
}

• 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