UVA11991:Easy Problem from Rujia Liu?(STL构建变长二维数组)
来源:互联网 发布:mac怎么强制退出程序 编辑:程序博客网 时间:2024/06/01 19:51
11991 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).
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
Sample Output
2
0
7
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).
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
Sample Output
2
0
7
0
思路很简单,但是直接开数组会超内存,一开始使用的vector也还是超内存
后来看大白书才发现要用map,map与vector结合成为一个变长数组
#include <iostream>#include <stdio.h>#include <string.h>#include <stack>#include <queue>#include <map>#include <set>#include <vector>#include <math.h>#include <bitset>#include <algorithm>#include <climits>using namespace std;#define LS 2*i#define RS 2*i+1#define UP(i,x,y) for(i=x;i<=y;i++)#define DOWN(i,x,y) for(i=x;i>=y;i--)#define MEM(a,x) memset(a,x,sizeof(a))#define W(a) while(a)#define gcd(a,b) __gcd(a,b)#define LL long long#define N 100005#define MOD 1000000007#define INF 0x3f3f3f3f#define EXP 1e-8map<int,vector<int> > mat;int a;int main(){ int n,m,i,j,k,v; while(~scanf("%d%d",&n,&m)) { for(i = 1;i<=n;i++) { scanf("%d",&a); if(!mat.count(a)) mat[a] = vector<int>(); mat[a].push_back(i); } while(m--) { scanf("%d%d",&k,&v); if(!mat.count(v) || mat[v].size()<k) printf("0\n"); else printf("%d\n",mat[v][k-1]); } } return 0;}
0 0
- UVA11991:Easy Problem from Rujia Liu?(STL构建变长二维数组)
- uva11991 Easy Problem from Rujia Liu?(STL)
- UVA11991 Easy Problem from Rujia Liu?
- UVA11991--Easy Problem from Rujia Liu?
- uva11991 Easy Problem from Rujia Liu?
- UVa11991 Easy Problem from Rujia Liu? map,vector
- 【暑假】[实用数据结构]UVa11991 Easy Problem from Rujia Liu?
- UVA11991 - Easy Problem from Rujia Liu?(数据结构,模拟)
- Easy Proble from Rujia Liu? UVA11991
- easy problem from rujia liu
- UVA11991——Easy Problem from Rujia Liu?(map+vector)
- UVA11991 Easy Problem from Rujia Liu?(第K个V的位置)
- 【map离散化+打表】 UVA11991 Easy Problem from Rujia Liu?
- UVa 11991 Easy Problem from Rujia Liu? / STL-MAP
- UVA 11991 Easy Problem from Rujia Liu?(STL应用)
- uva 11991 - Easy Problem from Rujia Liu?(STL)
- UVA - 11991 - Easy Problem from Rujia Liu? (STL)
- UVA 11991Easy Problem from Rujia Liu?【STL】
- leetcode--Reverse Linked List II
- 网络攻防初步
- PowerDesigner列名、注释内容互换
- 自定义控件时,一定要实现它的构造方法,
- 顺时针打印矩阵
- UVA11991:Easy Problem from Rujia Liu?(STL构建变长二维数组)
- ImageView中控制图片在控件中的大小
- tableViewCell 上面webView 自适应高度
- 黑马编程员 -- 一维数组总结
- 解决SQL Server本地Windows身份无法登录,错误代码18456问题
- TextView加上滚动条
- hadoop mapreduce读取orcfile的java代码示例
- CentOS下以RPM方式安装MySQL5.5
- SWT Designer在Eclipse中的安装 以及注册