POJ 3667 线段树 区间合并
来源:互联网 发布:阿里巴巴待遇知乎 编辑:程序博客网 时间:2024/04/30 13:54
2 a b:将[a,a+b-1]的房间清空
1 a:询问是不是有连续长度为a的空房间,有的话住进最左边
import java.io.BufferedReader;import java.io.InputStream;import java.io.InputStreamReader;import java.io.PrintWriter;import java.math.BigInteger;import java.util.StringTokenizer;public class Main {public static void main(String[] args) { new POJ3667().solve() ;}}class POJ3667{InputReader in = new InputReader(System.in) ;PrintWriter out = new PrintWriter(System.out) ;SegTree tree = new SegTree() ;void solve(){int n = in.nextInt() ; int m = in.nextInt() ; tree.build(1, 1, n) ;while(m-- > 0){if(in.nextInt() == 1){int v = in.nextInt() ; if(tree.sum[1] < v) out.println(0) ;else{int d = tree.query(v, 1, 1, n) ;out.println(d) ;tree.update(d, d+v-1, 0, 1, 1, n) ;}}else{int d = in.nextInt() ;int w = in.nextInt() ;tree.update(d , d+w-1, 1, 1, 1, n) ;}}out.flush() ; } }class SegTree{int N = 50008 ;int[] sum = new int[N<<2] ;int[] lsum = new int[N<<2] ;int[] rsum = new int[N<<2] ;int[] color = new int[N<<2] ;int[] len = new int[N<<2] ;void down(int t){if(color[t] != -1){color[t<<1] = color[t<<1|1] = color[t] ;sum[t<<1] = lsum[t<<1] = rsum[t<<1] = color[t] * len[t<<1] ;sum[t<<1|1] = lsum[t<<1|1] = rsum[t<<1|1] = color[t] * len[t<<1|1] ; color[t] = -1 ;}}void up(int t){lsum[t] = (lsum[t<<1] == len[t<<1]) ? len[t<<1] + lsum[t<<1|1] : lsum[t<<1] ;rsum[t] = (rsum[t<<1|1] == len[t<<1|1]) ? len[t<<1|1] + rsum[t<<1] : rsum[t<<1|1] ;sum[t] = Math.max(sum[t<<1] , sum[t<<1|1]) ;sum[t] = Math.max(sum[t], rsum[t<<1] + lsum[t<<1|1]) ;}void build(int t , int l , int r){color[t] = -1 ;sum[t] = lsum[t] = rsum[t] = len[t] = r - l + 1 ;if(len[t] == 1) return ; int m = (l + r) >> 1 ;build(t<<1 , l , m) ;build(t<<1|1, m+1, r) ;}void update(int L , int R , int V , int t , int l , int r){if(L <= l && r <= R){lsum[t] = rsum[t] = sum[t] = len[t] * V ; color[t] = V ;return ; }down(t) ;int m = (l + r) >> 1 ;if(L <= m) update(L, R, V, t<<1, l, m) ;if(R > m) update(L, R, V, t<<1|1, m+1 , r) ;up(t) ;}int query(int V , int t , int l , int r){if(l == r) return l ;down(t) ;int m = (l + r) >> 1 ;if(sum[t<<1] >= V) return query(V, t<<1 , l, m) ;else if(rsum[t<<1] + lsum[t<<1|1] >= V) return m - rsum[t<<1] + 1 ;else return query(V, t<<1|1, m+1 , r) ;}}class InputReader {public BufferedReader reader;public StringTokenizer tokenizer;public InputReader(InputStream stream) {reader = new BufferedReader(new InputStreamReader(stream), 32768);tokenizer = new StringTokenizer("");}private void eat(String s) {tokenizer = new StringTokenizer(s);}public String nextLine() {try {return reader.readLine();} catch (Exception e) {return null;}}public boolean hasNext() {while (!tokenizer.hasMoreTokens()) {String s = nextLine();if (s == null)return false;eat(s);}return true;}public String next() {hasNext();return tokenizer.nextToken();}public int nextInt() {return Integer.parseInt(next());}public long nextLong() {return Long.parseLong(next());}public double nextDouble() {return Double.parseDouble(next());}public BigInteger nextBigInteger() {return new BigInteger(next());}}
1 0
- poj 3667 区间合并 区间线段树
- poj 3667【线段树-区间合并】
- POJ 3667 Hotel 线段树区间合并
- poj 3667 Hotel 线段树区间合并
- poj 3667 线段树 区间合并
- POJ 3667 Hotel 线段树 区间合并
- poj 3667 线段树合并区间
- Poj 3667 Hotel 线段树 区间合并
- POJ 3667-hotel(线段树区间合并)
- poj 3667 线段树,区间合并
- POJ 3667 Hotel. (线段树 区间合并)
- 【线段树】POJ 3667 Hotel 区间合并
- POJ-3667 线段树(区间合并)
- POJ 3667 Hotel ( 线段树区间合并 )
- POJ 3667 线段树区间合并
- 线段树 区间合并 poj 3667 Hotel
- poj 3667 线段树区间合并
- POJ 3667 Hotel 线段树 区间合并
- PreparedStatement语句插入数据
- c++设计模式之代理模式
- MobSF,一款开源移动安全测试框架
- JavaScript中的setInterval用法
- Message Flood
- POJ 3667 线段树 区间合并
- swift中UIActionSheet的使用
- RedirectAttributes
- Cannot unwrap to requested type [javax.sql.DataSource] 的解决办法
- CIFilter 处理图片
- LeetCode151—Reverse Words in a String
- JS垫脚石-冒泡排序
- of driver
- 第五周项目5-后缀表达式