HUNAN 2014 暑期培训训练赛之十二 F题 (线段树)
来源:互联网 发布:内网连接软件 编辑:程序博客网 时间:2024/04/30 03:01
You own a rental shop and have a specific shelf for this series. There are N slots in this shelf (numbered from 0 to N-1 as well). When you first get this series, you place the DVD number i into the slot number i, obviously. A customer who is a fan of this series will want to rent a sequence of DVDs numbered l to r. Knowing that you have a shelf for this series, the customer will just pick up all DVDs from slot l to r, without checking the actual index of the DVDs.
However, there is one crazy customer who comes into your shop just to swap two DVDs in the slots, i.e., this customer takes a DVD from the slot a and exchanges it with the DVD in the slot b. This causes lots of problems for normal customers since normal customer do not check the index of the DVDs. For no reason, this crazy customer comes to your shop quite often and you don't have enough time to chase him away.
Your task is to write a program that monitors the activities in this shop and indicates whether a renting customer actually get the DVDs she wants, i.e., the customer actually get the DVDs numbered l to r. Be noted that the DVDs may be in any order, we just want to know if the customer get the DVDs numbered l to r. For example, let us assume that a customer comes to get DVDs from slot 2 to 4 and the slot 2, 3 and 4 have DVDs numbered 4, 2, and 3, respectively, we will say that the customer get what she wants.
For simplicity, we will assume that when a customer rents the DVDs, she will immediately watch all of it and place it back into the same slot they are taken. In other words, renting DVDs has no effect on the position of the DVDs at all.
Input
First line of input is a number of test cases T ≤ 20.
The first line of each test case contains two integer N and K (1 ≤ N ≤ 100 000, 1 ≤ K ≤ 50 000) which gives the number of DVDs and the number of activities that happens in the shops, respectively.
Following K lines describes the activities in the shop in the order that they happen. Each line contains three integers q, a and b (q is either 0 or 1 and 0 ≤ a ≤ b < N)
When q is 0, the activity is that a crazy customer comes in to swap DVDs in the slot number a and b.
When q is 1, a renting activity happens. A normal customer who needs DVD numbered a to b comes in and get DVDs from slot a to b. As noted earlier, this customer immediately uses the DVDs and returns it to the same slot (there is no change to the DVDs for this activity).
Output
For each renting activity, display a line with a word “YES” when the customer gets what she wants, i.e., when slot a to b have DVDs numbered a to b, and display a word “NO” in any other case.
Sample Input
25 81 0 41 1 20 1 31 2 21 1 31 0 01 0 21 2 45 50 1 20 2 30 1 31 0 11 0 2Sample Output
YESYESYESYESYESNONOYESNOProblem Source2013 ACM-ICPC Thailand National Programming Contest
#include<iostream>#include<cstdio>#include<map>#include<algorithm>#include<cmath>#include<cstring>#include<queue>#include<string>#include<cstdlib>#define INF 99999999#define min(a,b)(a<b?a:b)#define max(a,b)(a>b?a:b)#define int64 __int64using namespace std;const int MAXN=100000;int n;int sx[MAXN];struct Node{int l,r,Max,Min;}node[MAXN<<2];int Scan() { int res = 0 , ch; while( !( ( ch = getchar() ) >= '0' && ch <= '9' ) ) { if( ch == EOF ) return 1 << 30 ; } res = ch - '0' ; while( ( ch = getchar() ) >= '0' && ch <= '9' ) res = res * 10 + ( ch - '0' ) ; return res ; } void build(int l,int r,int k){node[k].l=l;node[k].r=r;node[k].Max=r;node[k].Min=l;if(l>=r) return ;int mid=(l+r)>>1;build(l,mid,k<<1);build(mid+1,r,k<<1|1);}void update(int k,int x,int v){if(node[k].l>x||node[k].r<x)return;if(node[k].l==node[k].r){node[k].Max=v;node[k].Min=v;return ;}int mid=(node[k].l+node[k].r)>>1;if(x<=mid) update(k<<1,x,v);else update(k<<1|1,x,v);node[k].Max=max(node[k<<1].Max,node[k<<1|1].Max);node[k].Min=min(node[k<<1].Min,node[k<<1|1].Min);}int s1,s2;void find(int k,int l,int r){if(l==node[k].l && r==node[k].r){s2=max(s2,node[k].Max);s1=min(s1,node[k].Min);return ;}int mid=(node[k].l+node[k].r)>>1;if(r<=mid)find(k<<1,l,r);else if(l>=mid+1)find(k<<1|1,l,r);else {find(k<<1,l,mid);find(k<<1|1,mid+1,r);}}bool solve(int l,int r){s1=INF,s2=-1;find(1,l,r);return s1==l && s2==r;}int main (){int T,K,i;T=Scan();while(T--){memset(node,0,sizeof(node));n=Scan();K=Scan();n--;build(0,n,1);for(i=0;i<=n;i++)sx[i]=i;while(K--){int op,l,r;op=Scan();l=Scan();r=Scan();if(op) printf(solve(l,r)?"YES\n":"NO\n");else {swap(sx[l],sx[r]);update(1,sx[l],l);update(1,sx[r],r);}}}return 0;}
- HUNAN 2014 暑期培训训练赛之十二 F题 (线段树)
- 暑期训练赛3F题(HDU4355)
- 暑期训练赛(6)A题
- 2013 - ECJTU 暑期训练赛第三场-problem-F
- 2013 - ECJTU 暑期训练赛第四场-problem-F
- 2013 - ECJTU 暑期训练赛第五场-problem-F
- 2013 - ECJTU 暑期训练赛第六场-problem-F
- 2013 - ECJTU 暑期训练赛第七场-problem-F
- 浙江中医药大学暑期训练测试赛八F
- 2016 北邮暑期训练3-F题( POJ2342 Anniversary party)树状DP
- 中国(北方)大学生程序设计训练赛(第一周)-F(线段树)
- CSU-ACM2017暑期训练4-dfs F
- CSU-ACM2017暑期训练12-KMP F
- 中国(北方)大学生程序设计训练赛(第一周)(Problem F: 等差区间-线段树+等差数列平方和公式)
- HPU-ACM暑期培训第2周个人赛:Problem F
- 暑期训练赛(6)解题报告
- 暑期训练赛(6)B
- 暑期训练赛(6)C
- gdb cocos2dx v3
- 面向对象学习总结
- 主从复制从服务器标准配置my.cnf
- shell文本过滤编程(二):awk之基础
- Android NDK编程浅入深出之--了解NDK
- HUNAN 2014 暑期培训训练赛之十二 F题 (线段树)
- 堆与栈的区别
- IOS CGAffineTransform 用于视图平移,放缩,旋转
- 【google 2006年笔试题】 在一个字符串中找到第一个只出现一次的字符(包括普通汉字)
- 磁盘相关
- Android--Activity 自己的第一个android程序
- linux 编程2
- 开发者必须知道的HTML5十五大新特性
- 整理JRE瘦身或精简JRE