zoukankan      html  css  js  c++  java
  • Codeforces 714A 朋友聚会

    参考自:https://www.cnblogs.com/ECJTUACM-873284962/p/6395268.html

    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 friend 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 l1r1l2r2 and k (1 ≤ l1, r1, l2, r2, k ≤ 1018l1 ≤ r1l2 ≤ 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.

    解法

      

     1 #include <bits/stdc++.h>
     2 typedef long long ll;
     3 using namespace std;
     4 int main()
     5 {
     6     ll l1,l2,r1,r2,k;
     7     while(cin>>l1>>r1>>l2>>r2>>k){
     8         ll min = min(r1,r2);
     9         ll max = max(l1,l2);
    10         ll ans = min-max+1;
    11         if(max > min){
    12             cout<<0<<endl;
    13             continue;
    14         }
    15         if(k >= max && k <= min)
    16             ans--;
    17         cout<<ans<<endl;
    18     }
    19     return 0;
    20 }
  • 相关阅读:
    环形二维数组
    梦断代码(三)
    梦断代码(二)
    梦断代码(一)
    CNblogs用户体验
    《软件工程》--读书笔记三
    《软件工程》--读书笔记二
    《软件工程》--读书笔记一
    找出水王
    典型用户
  • 原文地址:https://www.cnblogs.com/cruelty_angel/p/10348857.html
Copyright © 2011-2022 走看看