Codeforces Round #371 (Div. 2)

最新推荐文章于 2024-10-21 16:28:31 发布

lu_1110

最新推荐文章于 2024-10-21 16:28:31 发布

阅读量241

点赞数

分类专栏： OJ练习

本文链接：https://blog.csdn.net/lu_1110/article/details/52535139

版权

OJ练习专栏收录该内容

218 篇文章 0 订阅

订阅专栏

Today an outstanding event is going to happen in the forest — hedgehog Filya will come to his old fried Sonya!

Sonya is an owl and she sleeps during the day and stay awake from minute l1 to minute r1 inclusive. Also, during the minute k she prinks and is unavailable for Filya.

Filya works a lot and he plans to visit Sonya from minute l2 to minute r2 inclusive.

Calculate the number of minutes they will be able to spend together.

Input

The only line of the input contains integers l1, r1, l2, r2 and k (1 ≤ l1, r1, l2, r2, k ≤ 1018, l1 ≤ r1, l2 ≤ r2), providing the segments of time for Sonya and Filya and the moment of time when Sonya prinks.

Output

Print one integer — the number of minutes Sonya and Filya will be able to spend together.

   Examples 
 
     input 
   
1 10 9 20 1

     output 
   
2

     input 
   
1 100 50 200 75

     output 
   
50

Note

In the first sample, they will be together during minutes 9 and 10.

In the second sample, they will be together from minute 50 to minute 74 and from minute 76 to minute 100.

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
	ll t,a,b,c,d,k;
	cin>>a>>b>>c>>d>>k;
	t=-max(a,c)+min(b,d)+1;
	if(k>=max(a,c)&&k<=min(b,d))
	    t--;
	t=max(t,0ll);//0后面加ll,表示ll 0,和t保持一致 
	cout<<t<<endl;
}

Today, hedgehog Filya went to school for the very first time! Teacher gave him a homework which Filya was unable to complete without your help.

Filya is given an array of non-negative integers a1, a2, ..., an. First, he pick an integer x and then he adds x to some elements of the array (no more than once), subtract x from some other elements (also, no more than once) and do no change other elements. He wants all elements of the array to be equal.

Now he wonders if it's possible to pick such integer x and change some elements of the array using this x in order to make all elements equal.

Input

The first line of the input contains an integer n (1 ≤ n ≤ 100 000) — the number of integers in the Filya's array. The second line contains n integers a1, a2, ..., an (0 ≤ ai ≤ 109) — elements of the array.

Output

If it's impossible to make all elements of the array equal using the process given in the problem statement, then print "NO" (without quotes) in the only line of the output. Otherwise print "YES" (without quotes).

    Examples 
  
      input 
    
5
1 3 3 2 1

      output 
    
YES

      input 
    
5
1 2 3 4 5

      output 
    
NO

Note

In the first sample Filya should select x = 1, then add it to the first and the last elements of the array and subtract from the second and the third elements.

#include<bits/stdc++.h>
using namespace std;
int n,ans,v[111111];
int main()
{
	cin>>n;
	for(int i=0;i<n;++i)
		cin>>v[i];
	sort(v,v+n);
	ans=unique(v, v+n)-v;
	if(ans>3) cout<<"NO";
	else if (ans<3) cout<<"YES";
	else if (v[0]+v[2]==v[1]*2) cout<<"YES";
	else cout<<"NO";
	return 0;
}