zoukankan      html  css  js  c++  java
  • [UVA] 11991

    11991 - Easy Problem from Rujia Liu?

    Time limit: 1.000 seconds

    Problem E

    Easy Problem from Rujia Liu?

    Though Rujia Liu usually sets hard problems for contests (for example, regional contests like Xi'an 2006, Beijing 2007 and Wuhan 2009, or UVa OJ contests like Rujia Liu's Presents 1 and 2), he occasionally sets easy problem (for example, 'the Coco-Cola Store' in UVa OJ), to encourage more people to solve his problems :D

    Given an array, your task is to find the k-th occurrence (from left to right) of an integer v. To make the problem more difficult (and interesting!), you'll have to answer m such queries.

    Input

    There are several test cases. The first line of each test case contains two integers n, m(1<=n,m<=100,000), the number of elements in the array, and the number of queries. The next line contains n positive integers not larger than 1,000,000. Each of the following m lines contains two integer k and v (1<=k<=n, 1<=v<=1,000,000). The input is terminated by end-of-file (EOF). The size of input file does not exceed 5MB.

    Output

    For each query, print the 1-based location of the occurrence. If there is no such element, output 0 instead.

    Sample Input

    8 4
    1 3 2 2 4 3 2 1
    1 3
    2 4
    3 2
    4 2
    

    Output for the Sample Input

    2
    0
    7
    0
    

    Rujia Liu's Present 3: A Data Structure Contest Celebrating the 100th Anniversary of Tsinghua University
    Special Thanks: Yiming Li
    Note: Please make sure to test your program with the gift I/O files before submitting!

     

    题解:STL map、vector的应用。

    代码:

     1 #include<cstdio>
     2 #include<cstring>
     3 #include<algorithm>
     4 #include<queue>
     5 #include<stack>
     6 #include<vector>
     7 #include<map>
     8 #include<cmath>
     9 #include<stdbool.h>
    10 #include<stdlib.h>
    11 
    12 #define rep(i,a,b)      for(i=(a);i<=(b);i++)
    13 #define clr(x,y)        memset(x,y,sizeof(x))
    14 #define sqr(x)          ((x)*(x))
    15 
    16 using namespace std;
    17 
    18 map<int,vector<int> > a;
    19 
    20 int main()
    21 {
    22     int i,n,m,x,y;
    23     
    24     while(~scanf("%d%d",&n,&m)) {
    25        
    26         a.clear();
    27         rep(i,1,n) {
    28             scanf("%d",&x);
    29             if(!a.count(x)) a[x]=vector<int>();
    30             a[x].push_back(i);
    31         }
    32         
    33         while(m--) {
    34             scanf("%d%d",&x,&y);
    35             if(a[y].size()<x || !a.count(y)) printf("0
    ");
    36             else printf("%d
    ",a[y][x-1]);
    37         }
    38     }
    39     
    40     
    41     return 0;
    42 }
  • 相关阅读:
    js动态向li添加数据
    css实现立体字
    flex属性1
    Gluttonous Snake.css
    Gluttonous Snake.js
    Gluttonous Snake.html
    创建对象7种方法
    ORACLE数据库测试数据插入速度[z]
    maven打包不包含配置文件[z]
    互联网公司的面试官是如何360°无死角考察候选人的?[z]
  • 原文地址:https://www.cnblogs.com/sxiszero/p/4017783.html
Copyright © 2011-2022 走看看