Codeforces-714A-Meeting of Old Friends
来源:互联网 发布:淘宝甩手铺货 编辑:程序博客网 时间:2024/05/29 19:19
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.
给两个区间,求不包含某个点k的交集大小
找到上下界,然后讨论k就好了
#include<cstdio>#include<cstring>#include<algorithm>#include<iostream>using namespace std;typedef long long ll;int main(){ ll l1,r1,l2,r2,k; while(scanf("%I64d%I64d%I64d%I64d%I64d",&l1,&r1,&l2,&r2,&k)!=EOF) { ll ans = min(r2,r1)-max(l2,l1)+1; if(k>=max(l2,l1)&&k<=min(r2,r1)){ ans--; }ans =max(0ll,ans); printf("%I64d\n",ans); } return 0;}
- Codeforces-714A-Meeting of Old Friends
- Codeforces Problem 714A Meeting of Old Friends(区间交)
- CodeForces-714A. Meeting of Old Friends(水题)
- CodeForces 714A Meeting of Old Friends 【数学计算】【基础】
- 714A. Meeting of Old Friends
- A. Meeting of Old Friends
- Codeforces Round #371 (Div. 2) A. Meeting of Old Friends
- 【31.42%】【CF 714A】Meeting of Old Friends
- Codeforces Round #371 (Div. 2) A. Meeting of Old Friends (水题)
- Codeforces #371(Div.2)A.Meeting of Old Friends【模拟+思维】
- Codeforces Round #371 (Div. 2) A. Meeting of Old Friends(水题)
- Codeforces Round #371 (Div. 2) A. Meeting of Old Friends【思维,求区间交集】
- Codeforces Round #371 (Div. 2) A. Meeting of Old Friends 数学、A题第三次被系统hack了 (┬_┬)、集合交集
- [codeforces]A. The New Year: Meeting Friends 水题
- Codeforces 723A The New Year: Meeting Friends
- 【69.77%】【codeforces 723A】The New Year: Meeting Friends
- Codeforces — 723A. The New Year: Meeting Friends
- The New Year: Meeting Friends Codeforces Round#375-A
- Linux环境进程间通信(五): 共享内存(下)
- java内存模型学习
- 第三周项目3--求集合并集
- LeetCode----8. String to Integer (atoi)
- STCT: Sequentially Training Convolutional Networks for visual tracking
- Codeforces-714A-Meeting of Old Friends
- bitmap 图片优化
- JSP与Servlet的跳转及得到路径方法整理
- JavaScript原型、闭包、继承和原型链等等总结
- PAT乙级训练题--1001
- 绘制地图&热力图-R语言
- 2016秋季练习
- Thread类
- 如何用spring集成mongodb实现文件上传