Submission #444975

#	Time	Username	Problem	Language	Result	Execution time	Memory
444975		Khizri	Fancy Fence (CEOI20_fancyfence)	C++17	0 / 100	1 ms	332 KiB

fancyfence

#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll unsigned long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
	if(a>b) swap(a,b);
	if(a==0) return a+b;
	return gcd(b%a,a);
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
bool is_prime(ll n){
	ll k=sqrt(n);
	if(n==2) return true;
	if(n<2||n%2==0||k*k==n) return false;
	for(int i=3;i<=k;i+=2){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=2e5+5;
ll t=1,n,arr[mxn],h[mxn];
void solve(){
	ll ans=0;
	ll sum=0,k=0;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>h[i];
		k=h[i];
	}
	for(int i=1;i<=n;i++){
		cin>>arr[i];
		sum+=arr[i];
	}
	ans=(((k*(k+1)/2)%MOD)*((sum*(sum+1))/2)%MOD)%MOD;
	cout<<ans<<endl;
}
int main(){
	IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

Compilation message (stderr)

fancyfence.cpp: In function 'bool is_prime(long long unsigned int)':
fancyfence.cpp:33:15: warning: comparison of integer expressions of different signedness: 'int' and 'long long unsigned int' [-Wsign-compare]
   33 |  for(int i=3;i<=k;i+=2){
      |              ~^~~
fancyfence.cpp: In function 'void solve()':
fancyfence.cpp:48:15: warning: comparison of integer expressions of different signedness: 'int' and 'long long unsigned int' [-Wsign-compare]
   48 |  for(int i=1;i<=n;i++){
      |              ~^~~
fancyfence.cpp:52:15: warning: comparison of integer expressions of different signedness: 'int' and 'long long unsigned int' [-Wsign-compare]
   52 |  for(int i=1;i<=n;i++){
      |              ~^~~

• 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