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;
    }
  • 相关阅读:
    AIR 移动设备上的存储控制
    air写文件 SecurityError: fileWriteResource 时报错的解决方法
    [Embed(source="asset.swf")] 使用其中的所有资源
    as3调用外部swf里的类的方法
    Starling性能优化技巧十五则
    air开发中的requestedDisplayResolution 扫盲
    粒子编辑器的选择
    关于粒子..
    清理缓存功能的实现
    SegmentedControl的使用
  • 原文地址:https://www.cnblogs.com/Ritchie/p/5425158.html
Copyright © 2011-2022 走看看