oj.uz

Submission #444979

# Submission time Handle Problem Language Result Execution time Memory
444979 2021-07-16T07:19:15 Z Khizri Fancy Fence (CEOI20_fancyfence) C++17
15 / 100
 30 ms 3880 KB 
#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=(sum+arr[i])%MOD;
	}
	ll a=k;
	ll b=k+1;
	if(a%2==0){
		a/=2;
	}
	else{
		b/=2;
	}
	ll x=(a*b)%MOD;
	a=sum;
	b=sum+1;
	if(a%2==0){
		a/=2;
	}
	else{
		b/=2;
	}
	ll y=(a*b)%MOD;
	ans=(x*y)%MOD;
	cout<<ans<<endl;
}
int main(){
	IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

Compilation message

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.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 588 KB Output is correct
3 Correct 13 ms 1992 KB Output is correct
4 Correct 26 ms 3780 KB Output is correct
5 Correct 30 ms 3880 KB Output is correct
6 Correct 1 ms 204 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -