uva:Easy Problem from Rujia Liu?

最新推荐文章于 2019-12-09 10:02:13 发布

yangchangshu

最新推荐文章于 2019-12-09 10:02:13 发布

阅读量678

点赞数

分类专栏：解题报告

本文链接：https://blog.csdn.net/lovechangshu/article/details/22788923

版权

解题报告专栏收录该内容

14 篇文章 0 订阅

订阅专栏

Easy Problem from Rujia Liu?

Time Limit: 1000MS

Memory Limit: Unknown

64bit IO Format: %lld & %llu

Description

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

解题报告：大意是输入两个整数n,m输入n个整数（设为数组a），总共m行，每行输入两个整数i,j输出数组a总做往右第i个j的下标。其中1<=n，m<=10^6;

使用STL方法。map+vector。即为map<int,vector<int>>结构来模仿二维数组。

例如:n=8,m=4

map<1>={1,8}

map<2>={3,4,7}

map<3>={2,6}

map<4>={5}

在i,j符合条件的情况下输出map[j][i]。

参考代码:

#include <iostream>
#include<cstdio>
#include <map>
#include <vector>
using namespace std;
map<int ,vector<int> >ma;
int main()
{
//freopen("in.txt","r",stdin);
int m,n,i,j,x,y;
while(scanf("%d %d",&n,&m)==2)
  {
      ma.clear();
     // printf("n=%d\n",n);
       for(i=0;i<n;i++)
    {
        scanf("%d",&x);
       // printf("%d ",x);
        if(!ma.count(x))
        ma[x]=vector<int>();
        ma[x].push_back(i+1);
        }
  
    while(m--)
    {
      scanf("%d%d",&x,&y);
      //printf("x=%d y=%d\n",x,y);
     if(!ma.count(y)||(ma[y].size()<x))
      printf("0\n");
      else
      printf("%d\n",ma[y][x-1]);
    }
  }
    return 0;
}