POJ2777+2828(9.28)

一下午看了好几个题目,然后即出现好几个题目没有思路。。。自从被那个建两个树的题目就真的被气成××,那场里我最接近ac了的题目,就这么断送了。

Count Color:题意,给出L长度,n种颜色,m次询问,C将a-b之间的颜色全部变为c,所有的初始颜色都是1,Q代表查询a-b之间出现次数最多的颜色的;思路,典型的成段更新,计数这个地方用位运算合并颜色

Buy Tickets:题意,首先,这些数都是不同的,然后n次插入,首先给出要插入的位置,然后是值;思路,

这个题目如过随着输入建树更新,会不大好解决,从网上的经验来看,倒着建树是可以的,这样就不会

改变其他人的相对位置。

 

 

 

Count Color

Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 47428 Accepted: 14331Description

Chosen Problem Solving and Program design as an optional course, you are required to solve all kinds of problems. Here, we get a new problem. 

There is a very long board with length L centimeter, L is a positive integer, so we can evenly divide the board into L segments, and they are labeled by 1, 2, ... L from left to right, each is 1 centimeter long. Now we have to color the board - one segment with only one color. We can do following two operations on the board: 

1. "C A B C" Color the board from segment A to segment B with color C. 
2. "P A B" Output the number of different colors painted between segment A and segment B (including). 

In our daily life, we have very few words to describe a color (red, green, blue, yellow…), so you may assume that the total number of different colors T is very small. To make it simple, we express the names of colors as color 1, color 2, ... color T. At the beginning, the board was painted in color 1. Now the rest of problem is left to your. 

Input

First line of input contains L (1 <= L <= 100000), T (1 <= T <= 30) and O (1 <= O <= 100000). Here O denotes the number of operations. Following O lines, each contains "C A B C" or "P A B" (here A, B, C are integers, and A may be larger than B) as an operation defined previously.

Output

Ouput results of the output operation in order, each line contains a number.

Sample Input

2 2 4
C 1 1 2
P 1 2
C 2 2 2
P 1 2

Sample Output

2
1
 
#include<iostream> #include<cstdio> #include<cstring> using namespace std; #define lson L,mid,rt<<1 #define rson mid+1,R,rt<<1|1 struct Tree { int l,r; int color; bool cover; }tree[1000000]; void PushUp(int rt) { tree[rt].color=tree[rt<<1].color|tree[rt<<1|1].color; } void build(int L,int R,int rt) { tree[rt].l=L; tree[rt].r=R; tree[rt].color=1; tree[rt].cover=1; if(tree[rt].l==tree[rt].r) return ; int mid=(L+R)>>1; build(lson); build(rson); } void PushDown(int rt) { tree[rt<<1].color=tree[rt].color; tree[rt<<1].cover=1; tree[rt<<1|1].color=tree[rt].color; tree[rt<<1|1].cover=1; tree[rt].cover=0; } void update(int val,int L,int R,int rt) { if(L<=tree[rt].l && R>=tree[rt].r) { tree[rt].color=val; tree[rt].cover=1; return ; } if(tree[rt].color==val) return ; if(tree[rt].cover) PushDown(rt); int mid=(tree[rt].l+tree[rt].r)>>1; if(R<=mid) update(val,L,R,rt<<1); else if(L>=mid+1) update(val,L,R,rt<<1|1); else { update(val,lson); update(val,rson); } PushUp(rt); } int sum; void query(int L,int R,int rt) { if(L<=tree[rt].l && R>=tree[rt].r) { sum=sum|tree[rt].color; return ; } if(tree[rt].cover) { sum=sum|tree[rt].color; return; } int mid=(tree[rt].l+tree[rt].r)>>1; if(R<=mid) query(L,R,rt<<1); else if(L>=mid+1) query(L,R,rt<<1|1); else{ query(lson); query(rson); } } int main() { int n,t,m; while(cin>>n>>t>>m) { build(1,n,1); for(int i=1;i<10;i++) cout<<tree[i].l<<" "<<tree[i].r<<endl; char ch; int a,b,c; while(m--){ cin>>ch; if(ch=='C') { scanf("%d%d%d",&a,&b,&c); if(a>b) { int gg=a; a=b; b=gg; } update(2*(c-1),a,b,1); } else { scanf("%d%d",&a,&b); if(a>b) { int gg=a; a=b; b=gg; } sum=0; query(a,b,1); //cout<<sum<<endl; int ans=0; while(sum) { if(sum%2!=0) ans++; sum/=2; } cout<<ans<<endl; } } } return 0; }

 

 

 

Buy Tickets

Time Limit: 4000MS Memory Limit: 65536K
Total Submissions: 21337 Accepted: 10453

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 lson l,m,rt<<1 #define rson m+1,r,rt<<1|1 using namespace std; int a[200010],b[200010]; int num[1000010],map[200010]; void build(int l, int r, int rt) { num[rt]=r+1-l; if(l==r) return ; int m=(l+r)/2; build(lson); build(rson); } void update(int L,int R,int l,int r,int rt) { --num[rt]; if(l==r) { map[l]=R; return; } int m=(l+r)/2; if(num[rt<<1]>=L+1) update(L,R,lson); else update(L-num[rt<<1],R,rson); } int main() { int n; while(cin>>n) { build(1,n,1); for(int i=1;i<=n;i++) scanf("%d%d",&a[i],&b[i]); for(int i=n;i>0;i--) update(a[i],b[i],1,n,1); for(int i=1;i<n;i++) printf("%d ",map[i]); printf("%d\n",map[n]); } return 0; } 

 

 

 

  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值