Codeforces Round #371 (Div. 2) A. Meeting of Old Friends

A. Meeting of Old Friends time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output

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 <iostream> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; int main() { long long l1, l2, r1, r2, k; while(~scanf("%I64d%I64d%I64d%I64d%I64d",&l1, &r1, &l2, &r2, &k)) { long long ll = max(l1,l2); long long rr = min(r1,r2); long long ans = rr - ll + 1; if(ans < 0) ans = 0; if(k >= ll && k <= rr) ans--; printf("%I64d\n",ans); } return 0; }