关闭

poj2828 Buy Tickets

标签: poj
698人阅读 评论(1) 收藏 举报
分类:

Buy Tickets
Time Limit: 4000MS   Memory Limit: 65536K
Total Submissions: 16584   Accepted: 8268

Description

Railway tickets were difficult to buy around the Lunar New Year in China, so we must get up early and join a long queue…

The Lunar New Year was approaching, but unluckily the Little Cat still had schedules going here and there. Now, he had to travel by train to Mianyang, Sichuan Province for the winter camp selection of the national team of Olympiad in Informatics.

It was one o’clock a.m. and dark outside. Chill wind from the northwest did not scare off the people in the queue. The cold night gave the Little Cat a shiver. Why not find a problem to think about? That was none the less better than freezing to death!

People kept jumping the queue. Since it was too dark around, such moves would not be discovered even by the people adjacent to the queue-jumpers. “If every person in the queue is assigned an integral value and all the information about those who have jumped the queue and where they stand after queue-jumping is given, can I find out the final order of people in the queue?” Thought the Little Cat.

Input

There will be several test cases in the input. Each test case consists of N + 1 lines where N (1 ≤ N ≤ 200,000) is given in the first line of the test case. The next N lines contain the pairs of values Posi and Vali in the increasing order of i (1 ≤ i ≤ N). For each i, the ranges and meanings of Posi and Vali are as follows:

  • Posi ∈ [0, i − 1] — The i-th person came to the queue and stood right behind the Posi-th person in the queue. The booking office was considered the 0th person and the person at the front of the queue was considered the first person in the queue.
  • Vali ∈ [0, 32767] — The i-th person was assigned the value Vali.

There no blank lines between test cases. Proceed to the end of input.

Output

For each test cases, output a single line of space-separated integers which are the values of people in the order they stand in the queue.

Sample Input

4
0 77
1 51
1 33
2 69
4
0 20523
1 19243
1 3890
0 31492

Sample Output

77 33 69 51
31492 20523 3890 19243

Hint

The figure below shows how the Little Cat found out the final order of people in the queue described in the first test case of the sample input.

Source




我们可以考虑逆序插入每一个数,对于pos和val,只需要将val插入到第(pos+1)个空位上。那么寻找第(pos+1)个空位就可以用线段树来实现了。

这道题逆序插入的思路很好。




#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdlib>
#define F(i,j,n) for(int i=j;i<=n;i++)
#define D(i,j,n) for(int i=j;i>=n;i--)
#define LL long long
#define pa pair<int,int>
#define MAXN 200005
using namespace std;
int n,a[MAXN],b[MAXN],ans[MAXN];
struct tree_type
{
	int l,r,sum;
}t[MAXN*4];
int read()
{
	int ret=0,flag=1;char ch=getchar();
	while (ch<'0'||ch>'9')
	{
		if (ch=='-') flag=-1;
		ch=getchar();
	}
	while (ch>='0'&&ch<='9')
	{
		ret=ret*10+ch-'0';
		ch=getchar();
	}
	return ret*flag;
}
void build(int k,int x,int y)
{
	t[k].l=x;
	t[k].r=y;
	t[k].sum=y-x+1;
	if (x==y) return;
	int mid=(x+y)>>1;
	build(k<<1,x,mid);
	build(k<<1|1,mid+1,y);
}
int getpos(int k,int x)
{
	t[k].sum--;
	if (t[k].l==t[k].r) return t[k].l;
	if (t[k<<1].sum>x) return getpos(k<<1,x);
	else return getpos(k<<1|1,x-t[k<<1].sum);
}
int main()
{
	while (~scanf("%d\n",&n))
	{
		build(1,1,n);
		F(i,1,n) a[i]=read(),b[i]=read();
		D(i,n,1) ans[getpos(1,a[i])]=b[i];
		F(i,1,n) printf("%d ",ans[i]); printf("\n");
	}
}


0
0
查看评论
发表评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场

POJ 2828 Buy Tickets(排队问题,线段树应用)

POJ 2827 Buy Tickets(排队问题,线段树应用) ACM 题目地址:POJ 2828 Buy Tickets 题意:  排队买票时候插队。  给出一些数对,分别代表某个人的想要插...
  • hcbbt
  • hcbbt
  • 2014-08-06 00:57
  • 2242

POJ2828 Buy Tickets 【线段树】+【单点更新】+【逆序】

Buy Tickets Time Limit: 4000MS   Memory Limit: 65536K Total Submissions: 12296   A...
  • u012846486
  • u012846486
  • 2014-07-08 00:18
  • 1138

【LeetCode-面试算法经典-Java实现】【121-Best Time to Buy and Sell Stock(最佳买卖股票的时间)】

【121-Best Time to Buy and Sell Stock(最佳买卖股票的时间)】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题  Say you have a...
  • DERRANTCM
  • DERRANTCM
  • 2015-08-14 06:16
  • 6368

POJ 2828 Buy Tickets 结构体型的线段树 学习ing

复习线段树时看到了这种把线段树定义成结构体的写法,y
  • q295657451
  • q295657451
  • 2014-07-26 15:49
  • 395

poj 2828 Buy Tickets(树状数组找部分和为k的第一个位置)

Buy Tickets Time Limit: 4000MS   Memory Limit: 65536K Total Submissions: 11135   A...
  • WEYuLi
  • WEYuLi
  • 2013-11-21 11:58
  • 815

POJ 2828 Buy Tickets 线段树入门(建树稍微有点抽象)

一开始看的时候真的不知道为什么是线段树的题目。后来看到了网上他们的讲解,发现原来也是线段树。 先说一下题意:就是买票插队的问题,有n个人插队,他们都是插道a的后面,所以他的当前位置是a+1,然后也肯...
  • xu12110501127
  • xu12110501127
  • 2014-02-20 21:17
  • 763

POJ 2828 Buy Tickets(线段树--单点更新)

Buy Tickets Time Limit: 4000MS   Memory Limit: 65536K Total Submissions: 16196   Accepted: 805...
  • helloiamclh
  • helloiamclh
  • 2015-08-30 21:29
  • 428

POJ训练计划2828_Buy Tickets(线段树/单点更新)

解题报告 题意: 插队完的顺序。 思路: 倒着处理数据,第i个人占据第j=pos[i]+1个的空位。 线段树维护区间空位信息。 #include #include #include ...
  • u013320038
  • u013320038
  • 2014-08-11 18:44
  • 4903

POJ 2828 Buy Tickets(排队问题,线段树应用)

POJ 2827 Buy Tickets(排队问题,线段树应用) ACM 题目地址:POJ 2828 Buy Tickets 题意:  排队买票时候插队。  给出一些数对,分别代表某个人的想要插...
  • hcbbt
  • hcbbt
  • 2014-08-06 00:57
  • 2242

POJ2828 Buy Tickets(线段树,单点更新)

题目: Buy Tickets Time Limit: 4000MS   Memory Limit: 65536K Total Submiss...
  • riba2534
  • riba2534
  • 2017-05-01 16:21
  • 212
    个人资料
    • 访问:720914次
    • 积分:11368
    • 等级:
    • 排名:第1587名
    • 原创:417篇
    • 转载:3篇
    • 译文:0篇
    • 评论:45条
    云中谁寄锦书来