Submission #1008058

#	Time	Username	Problem	Language	Result	Execution time	Memory
1008058		kaysan	Fancy Fence (CEOI20_fancyfence)	C++17	0 / 100	1 ms	348 KiB

fancyfence

#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pp pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define pll pair<ll,ll> 
#define pii pair<int,int> 
#define vl vector<ll> 
#define nikah ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const ll maxn = 1e5+7, modn1 = 1e9+7, modn2 = 998244353;
using namespace std;

// kalo kamu ngga emas nanti nadya merasa bersalah, ayo san demi nadya!!!
// Kalo emang soalnya susah, pindah soal dulu 
// Jangan sampe diem, pikirin sesuatu, pasti bisa!!!
// Cobain semua approach, jangan ngestuck di satu pemikiran
// Jangan overthinking, jangan panik, tenangin pikiranmu


ll t,n;
ll h[maxn], w[maxn];

ll f (ll x) {
	ll ret = 1;
	ret = ((x * (x+1)) / 2) % modn1;
	return ret;
}

void solve () {
	cin>>n;
	for (ll i=1; i<=n; i++) {
		cin>>h[i];
	}
	ll sum = 0;
	for (ll i=1; i<=n; i++) {
		cin>>w[i];
		sum += w[i];
	}
	/*for (ll i=1; i<=n; i++) {
		if (h[i] == 2) {
			cnt+=w[i];
		} else {
			ans += (cnt * (cnt + 1)) % modn1;
			cnt = 0;
		}
	}
	ans += (cnt * (cnt + 1)) % modn1;*/
	ll ans = (f(sum) * f(h[1])) % modn1; 
	cout<<ans<<endl;
}           


int main () {
  nikah
  t = 1;
//  cin>>t;
  while (t--) {
    solve();
  //  cout<<endl;
  }
}

• 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