A. Meeting of Old Friends
来源:互联网 发布:北交大知行pt网址 编辑:程序博客网 时间:2024/05/16 04:57
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.
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.
Print one integer — the number of minutes Sonya and Filya will be able to spend together.
1 10 9 20 1
2
1 100 50 200 75
50
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<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<string>#include<cmath>int main(){long long int l1,r1,l2,r2,k,x,y;scanf("%lld%lld%lld%lld%lld",&l1,&r1,&l2,&r2,&k);x=(l1>=l2)?l1:l2;y=(r1<=r2)?r1:r2;if(r1<l2||r2<l1){printf("0\n");}else{if(x<=k&&k<=y){printf("%lld\n",y-x);}else{printf("%lld\n",y-x+1);}}return 0;}
- A. Meeting of Old Friends
- Codeforces-714A-Meeting of Old Friends
- 714A. Meeting of Old Friends
- Codeforces Round #371 (Div. 2) A. Meeting of Old Friends
- Codeforces Problem 714A Meeting of Old Friends(区间交)
- 【31.42%】【CF 714A】Meeting of Old Friends
- CodeForces-714A. Meeting of Old Friends(水题)
- CodeForces 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了 (┬_┬)、集合交集
- A. The New Year: Meeting Friends
- overview of JVET- Meeting A
- [codeforces]A. The New Year: Meeting Friends 水题
- Codeforces723 A. The New Year: Meeting Friends (水题)
- Codeforces 723A The New Year: Meeting Friends
- HDU 1005
- const的用法
- android_01_电话拨号器
- BZOJ 3450 Tyvj1952 Easy
- 51nod-1478 括号序列的最长合法子段
- A. Meeting of Old Friends
- NYOJ-311-完全背包(DP)
- 操作系统
- JavaScript 浏览器对象模型2
- Codeforces700B. Connecting Universities
- 基于LPC11E68搭建Keil开发环境
- hadoop添加节点
- LeetCode : Majority Element
- 我是一个线程(对理解多线程很有帮助)