CF714A.Meeting of Old Friends

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

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 l1l_{1} to minute r1r_{1} inclusive. Also, during the minute kk she prinks and is unavailable for Filya.

Filya works a lot and he plans to visit Sonya from minute l2l_{2} to minute r2r_{2} inclusive.

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

输入格式

The only line of the input contains integers l1l_{1} , r1r_{1} , l2l_{2} , r2r_{2} and kk ( 1<=l1,r1,l2,r2,k<=10181<=l_{1},r_{1},l_{2},r_{2},k<=10^{18} , l1<=r1l_{1}<=r_{1} , l2<=r2l_{2}<=r_{2} ), providing the segments of time for Sonya and Filya and the moment of time when Sonya prinks.

输出格式

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

输入输出样例

  • 输入#1

    1 10 9 20 1
    

    输出#1

    2
    
  • 输入#2

    1 100 50 200 75
    

    输出#2

    50
    

说明/提示

In the first sample, they will be together during minutes 99 and 1010 .

In the second sample, they will be together from minute 5050 to minute 7474 and from minute 7676 to minute 100100 .

首页