Submission #745985

#TimeUsernameProblemLanguageResultExecution timeMemory
745985vjudge1Fancy Fence (CEOI20_fancyfence)C++17
0 / 100
8 ms468 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long

const int mod=1000000007;

int f(int wossz, int hossz){
	return (((((hossz*(hossz+1)%mod/2)%mod) * wossz)%mod)*(wossz+1)/2)%mod;
}

int32_t main() {
	// all hi are equal --> téglalap
	int s;
	cin>>s;
	int h[s];
	int w[s];
	int wossz = 0;
	bool teglalap = true;
	for (int i=0; i<s; i++){
		cin >> h[i];
		if (h[i] != h[0]) teglalap = false;
	}
	int hossz = h[0];
	for(int i=0; i<s; i++){
		cin>>w[i];
		wossz = (w[i] + wossz) % mod;
	}
	
	if (teglalap)	cout << f(wossz, hossz);
	//cout << (((((hossz*(hossz+1)/2)%mod) * wossz)%mod)*(wossz+1)/2)%mod<<"\n";
	// --------------- lépcső -----------------
	/*int ans = f(wossz, h[0]);
	wossz -= w[0];
	for (int i=1; i<s; i++){
		ans += f(wossz, h[i]);
		ans -=  f(wossz, h[i-1]);
		wossz -= w[i]; 
	}
	cout << ans;*/

	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...