zoukankan      html  css  js  c++  java
  • CodeForces

    Time Limit: 1000MS   Memory Limit: 262144KB   64bit IO Format: %I64d & %I64u

     Status

    Description

    During the "Russian Code Cup" programming competition, the testing system stores all sent solutions for each participant. We know that many participants use random numbers in their programs and are often sent several solutions with the same source code to check.

    Each participant is identified by some unique positive integer k, and each sent solution A is characterized by two numbers: x — the number of different solutions that are sent before the first solution identical to A, and k — the number of the participant, who is the author of the solution. Consequently, all identical solutions have the same x.

    It is known that the data in the testing system are stored in the chronological order, that is, if the testing system has a solution with numberx(x > 0) of the participant with number k, then the testing system has a solution with number x - 1 of the same participant stored somewhere before.

    During the competition the checking system crashed, but then the data of the submissions of all participants have been restored. Now the jury wants to verify that the recovered data is in chronological order. Help the jury to do so.

    Input

    The first line of the input contains an integer n (1 ≤ n ≤ 105) — the number of solutions. Each of the following n lines contains two integers separated by space x and k (0 ≤ x ≤ 1051 ≤ k ≤ 105) — the number of previous unique solutions and the identifier of the participant.

    Output

    A single line of the output should contain «YES» if the data is in chronological order, and «NO» otherwise.

    Sample Input

    Input
    2
    0 1
    1 1
    Output
    YES
    Input
    4
    0 1
    1 2
    1 1
    0 2
    Output
    NO
    Input
    4
    0 1
    1 1
    0 1
    0 2
    Output
    YES

    Source

    #include <iostream>
    #include <stdio.h>
    #include <stdlib.h>
    #include<string.h>
    #include<algorithm>
    #include<math.h>
    using namespace std;
    int a[100010];
    int main()
    {
        int i,n,m,x,k;
        while(cin>>n)
        {
            int flag=0;
            memset(a,-1,sizeof(a));
            for (i=0;i<n;i++)
            {
                cin>>x>>k;
                if (a[k]+1<x)
                flag=1;
                a[k]=max(a[k],x);
            }
            if (flag)
            cout<<"NO"<<endl;
            else
            cout<<"YES"<<endl;
        }
       return 0;
    }
  • 相关阅读:
    【GMT43智能液晶模块】例程十四:MODBUS TCP实验——电源监控
    【GM4008】GM4008升级固件发布(版本V4.2.1.1)
    【iCore4 双核心板_FPGA】实验二十:NIOS II之UART串口通信实验
    我将要离开,广州!
    带你Python入门,踏进人工智能领域
    您还差宝贝一张语文教学光盘!教你如何制作ISO文件
    数据采集之登录那些事
    潮汕七样羹之情
    劣湿为始《清明之冬》
    福利预告,跳一跳助手即将发布,您不知道还有这些...
  • 原文地址:https://www.cnblogs.com/Ritchie/p/5425158.html
Copyright © 2011-2022 走看看