Buy Tickets

Time Limit:4000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Submit Status

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.


 #include<iostream>
#include<stdio.h>
#include<string.h>
#define N 200010
#define lson p << 1
#define rson p << 1 | 1
using namespace std; struct Nod
{
int l , r ;
int va ; // Gap
}node[N << ]; int pos[N] , val[N] , ans[N] ; void build ( int l , int r , int p )
{
node[p].l = l ;
node[p].r = r ;
node[p].va = r - l + ;
if ( l == r)
return ;
int mid = ( l + r ) >> ;
build ( l , mid , lson ) ;
build ( mid + , r , rson ) ;
} int update ( int ps , int p )
{
node[p].va-- ; //Gap - 1 ;
if ( node[p].l == node[p].r ) {
return node[p].l ; //return the position of the insert
}
if ( node[lson].va >= ps ) {
update ( ps , lson ) ;//when lson's Gap equal to or greater than the insertion location , inserted to the left
}
else {
ps -= node[lson].va ;//when Gap on the left is less than the ps , insert the right side , the right of the insertion laction is
// ps minus Gap on the left
update ( ps , rson ) ;
}
} int main ()
{
//freopen ( "a.txt" , "r" , stdin ) ;
int n ;
while (~scanf ("%d" , &n ) ) {
build ( , n , ) ;
for ( int i = ; i <= n ; i++ ) {
scanf ("%d%d" , pos + i , val + i ) ;
}
for ( int i = n ; i >= ; i-- ) {
int id = update ( pos[i] + , ) ; // get the insert position
ans[id] = val[i] ; // in ans Array
}
for ( int i = ; i < n ; i++ ) {
printf ( "%d " , ans[i] ) ;
}
printf ( "%d\n" , ans[n] ) ;
}
return ;
}

倒推法

集训时大神介绍了一种能节省空间的写法:

 #include<iostream>
#include<stdio.h>
#include<string.h>
#define N 200010
#define lson o << 1 , l , mid
#define rson o << 1 | 1 , mid + 1 , r
using namespace std; int va[N << ] ; // Gap int pos[N] , val[N] , ans[N] ; void build (int o , int l , int r )
{
va[o] = r - l + ;
if ( l == r )
return ;
int mid = ( l + r ) >> ;
build ( lson ) ;
build ( rson ) ;
} int update ( int ps ,int o , int l , int r )
{
va[o]-- ; //Gap - 1 ;
if ( l == r ) {
return l ; //return the position of the insert
}
int mid = ( l + r ) >> ;
if ( va[o << ] >= ps ) {
update ( ps , lson ) ;//when lson's Gap equal to or greater than the insertion location , inserted to the left
}
else {
ps -= va[o << ] ;//when Gap on the left is less than the ps , insert the right side , the right of the insertion laction is
// ps minus Gap on the left
update ( ps , rson ) ;
}
} int main ()
{
//freopen ( "a.txt" , "r" , stdin ) ;
int n ;
while (~scanf ("%d" , &n ) ) {
build ( , , n ) ;
for ( int i = ; i <= n ; i++ ) {
scanf ("%d%d" , pos + i , val + i ) ;
}
for ( int i = n ; i >= ; i-- ) {
int id = update ( pos[i] + , , , n ) ; // get the insert position
ans[id] = val[i] ; // in ans Array
}
for ( int i = ; i < n ; i++ ) {
printf ( "%d " , ans[i] ) ;
}
printf ( "%d\n" , ans[n] ) ;
}
return ;
}

省了4000k

Buy Tickets(线段树)的更多相关文章

  1. [poj2828] Buy Tickets (线段树)

    线段树 Description Railway tickets were difficult to buy around the Lunar New Year in China, so we must ...

  2. 【poj2828】Buy Tickets 线段树 插队问题

    [poj2828]Buy Tickets Description Railway tickets were difficult to buy around the Lunar New Year in ...

  3. poj 2828 Buy Tickets (线段树(排队插入后输出序列))

    http://poj.org/problem?id=2828 Buy Tickets Time Limit: 4000MS   Memory Limit: 65536K Total Submissio ...

  4. POJ 2828 Buy Tickets 线段树 倒序插入 节点空位预留(思路巧妙)

    Buy Tickets Time Limit: 4000MS   Memory Limit: 65536K Total Submissions: 19725   Accepted: 9756 Desc ...

  5. Buy Tickets(线段树)

    Buy Tickets Time Limit: 4000MS   Memory Limit: 65536K Total Submissions: 16607   Accepted: 8275 Desc ...

  6. poj-----(2828)Buy Tickets(线段树单点更新)

    Buy Tickets Time Limit: 4000MS   Memory Limit: 65536K Total Submissions: 12930   Accepted: 6412 Desc ...

  7. POJ 2828 Buy Tickets (线段树 or 树状数组+二分)

    题目链接:http://poj.org/problem?id=2828 题意就是给你n个人,然后每个人按顺序插队,问你最终的顺序是怎么样的. 反过来做就很容易了,从最后一个人开始推,最后一个人位置很容 ...

  8. poj2828 Buy Tickets (线段树 插队问题)

    Buy Tickets Time Limit: 4000MS   Memory Limit: 65536K Total Submissions: 22097   Accepted: 10834 Des ...

  9. POJ 2828 Buy Tickets | 线段树的喵用

    题意: 给你n次插队操作,每次两个数,pos,w,意为在pos后插入一个权值为w的数; 最后输出1~n的权值 题解: 首先可以发现,最后一次插入的位置是准确的位置 所以这个就变成了若干个子问题, 所以 ...

  10. POJ 2828 Buy Tickets(线段树&#183;插队)

    题意  n个人排队  每一个人都有个属性值  依次输入n个pos[i]  val[i]  表示第i个人直接插到当前第pos[i]个人后面  他的属性值为val[i]  要求最后依次输出队中各个人的属性 ...

随机推荐

  1. IT应届生如何准备找工作?

    今天和一个弟弟吃饭,他明年年初即将计算机研究生毕业.谈论到怎么找工作,觉得自己会的不多,心里非常发虚.虽然我当年找工作也走了很多弯路,思路并不是很清晰.但是工作了这么多年,对企业需要什么样子的人还是有 ...

  2. 教你写一个Android可快速复用的小键盘输入控件

    引子 在Android项目开发中特别是一些稍大型的项目,面对需求文档的时候你经常会发现很多地方用到了同样的组件,但是又略有不同.比如这个: 右边是一个小键盘输入板,左边当焦点不同的时候分别用右边的小键 ...

  3. 一句话概括下spring框架及spring cloud框架主要组件

    作为java的屌丝,基本上跟上spring屌丝的步伐,也就跟上了主流技术.spring 顶级项目:Spring IO platform:用于系统部署,是可集成的,构建现代化应用的版本平台,具体来说当你 ...

  4. Zigbee技术特点

    ZigBee工作原理 基于 ZigBee 的无线设备工作在 868MHZ, 915MHZ 和 2.4Z 频带.其最大数据速 率是 250Kbps. ZigBee 技术主要针对以电池为电源的应用,这些应 ...

  5. “耐撕”团队2016.04.12站立会议

    1.时间 : 19:15--19:30  共计15分钟. 2.成员 : Z 郑蕊 * 组长 (博客:http://www.cnblogs.com/zhengrui0452/), P 濮成林(博客:ht ...

  6. Eclipse字体大小设置

    打开Eclipse,在主界面下Window->Preferences->General->Appearance->Colors and Fonts, 然后在右边展开框Basic ...

  7. QLabel添加图片链接

    <a href = "http://1450591036.qzone.qq.com"><img src=://splash.png height="30 ...

  8. Java 并发-任务执行.

    首先来看一下,任务的定义: 所谓的任务,就是抽象,离散的工作单位.你可以简单理解为代码级别的 (Runnable接口) 大多数并发应用程序都是围绕着任务进行管理的. 看一小段代码: package c ...

  9. 【poj1745】 Divisibility

    http://poj.org/problem?id=1745 (题目链接) 题意 给出n串数,可以在其两两之间添加+或-,判断是否存在某种方案使得出的表达式的答案可以整除k. Solution 水题一 ...

  10. 2-SAT开坑

    Reference:http://blog.csdn.net/jarjingx/article/details/8521690 其中伍昱的ppt不错. 2SAT最裸的模型: 一国有n个党派,每个党派在 ...