zoukankan      html  css  js  c++  java
  • CodeForces

     Two TVs

    Polycarp is a great fan of television.
    He wrote down all the TV programs he is interested in for today. His list contains n shows, i-th of them starts at moment li and ends at moment ri.

    Polycarp owns two TVs. He can watch two different shows simultaneously with two TVs but he can only watch one show at any given moment on a single TV. If one show ends at the same moment some other show starts then you can't watch them on a single TV.
    Polycarp wants to check out all n shows. Are two TVs enough to do so?
    Input
    The first line contains one integer n (1 ≤ n ≤ 2·105) — the number of shows.
    Each of the next n lines contains two integers li and ri (0 ≤ li < ri ≤ 109) — starting and ending time of i-th show.


    Output
    If Polycarp is able to check out all the shows using only two TVs then print "YES" (without quotes). Otherwise, print "NO" (without quotes).


    Example
    Input
    3
    1 2
    2 3
    4 5
    Output
    YES
    Input
    4
    1 2
    2 3
    2 3
    1 2
    Output
    NO

    #include<stdio.h>
    #include<iostream>
    #include<algorithm>
    #include<map>
    #define ll long long
    using namespace std;
    typedef struct
    {
        int a,b;
    } node;
    node t[200005];
    bool cmp(node m,node n)
    {
        if(m.a==n.a)
            return m.b<n.b;
        return m.a<n.a;
    }
    int main()
    {
        int n;
        cin>>n;
        for(int i=0; i<n; i++)
            cin>>t[i].a>>t[i].b;
        sort(t,t+n,cmp);
        int tv1=t[0].b,tv2=t[1].b;
        for(int i=2; i<n; i++)
        {
            if(t[i].a<=tv1&&t[i].a<=tv2)
            {
                cout<<"NO"<<endl;
                return 0;
            }
            if(t[i].a>tv1)
            {
                tv1=t[i].b;
            }
            else if(t[i].a>tv2)
            {
                tv2=t[i].b;
            }
        }
        cout<<"YES"<<endl;
    }


  • 相关阅读:
    Mstsc 微软远程桌面控制工具
    session
    防止重复提交表单
    nginx日志格式及自定义日志配置
    代码审核:安全性测试方案
    代码审计:安全性测试方案
    Word转换为Html (用处:生成一些注册协议之类的)
    技术人员的发展之路 (转载)
    phpcms 杂记
    ThinkPHP 日志
  • 原文地址:https://www.cnblogs.com/da-mei/p/9053295.html
Copyright © 2011-2022 走看看