题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6183 题意: 有四种操作: 0:清除所有点 1 x y c : 给点(x, y)添加一种颜色c(颜色不会覆盖) 2 x y1 y2 : 在(0, y1)与(x, y2)所围成的矩形里有多少种颜色 3 : 程序结束 解法: 颜色最多51种.我们就建51棵线段树. 每个线段树按y轴建树,每个结点的值是在范围内的最小的x值,这题最关键的就是看到是x轴是查1-x 队友的CDQ+线段树因为写错了一句话,重现赛…

题目原网址:http://acm.hdu.edu.cn/showproblem.php?pid=6183 题目中文翻译: Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 132768/132768 K (Java/Others) Total Submission(s): 1677    Accepted Submission(s): 500 Problem Description 你喜欢画画吗? Little D不喜欢画画,特别…

B - Color itHDU - 6183 题目大意:有三种操作,0是清空所有点,1是给点(x,y)涂上颜色c,2是查询满足1<=a<=x,y1<=b<=y2的(a,b)点一共有几种不同的颜色 一开始做的时候直接就是开51个vector保存每个颜色相应的点,然后就是询问就是,暴力循环判断这个颜色存不存在一个满足条件的点,感觉最差情况下应该会超时,不过却过了 #include<cstdio> #include<vector> using namespace…

Do you like painting? Little D doesn't like painting, especially messy color paintings. Now Little B is painting. To prevent him from drawing messy painting, Little D asks you to write a program to maintain following operations. The specific format o…

Problem Description Do you like painting? Little D doesn't like painting, especially messy color paintings. Now Little B is painting. To prevent him from drawing messy painting, Little D asks you to write a program to maintain following operations. T…

线段树. 假设只有一种颜色,因为每次询问有一个$x$一定是$1$,那么我可以想办法找出每一个$y$最小的$x$是多少,如果最小的都不符合,那么一定不符合,因为更新变成了单点更新,询问是区间询问最小值,搞个线段树即可.有$51$种颜色,可以搞$51$个线段树. #include <bits/stdc++.h> using namespace std; const int maxn = 6000000 + 10; int op; int root[60]; struct Node { int va…

Do you like painting? Little D doesn't like painting, especially messy color paintings. Now Little B is painting. To prevent him from drawing messy painting, Little D asks you to write a program to maintain following operations. The specific format o…

一看C才[0,50],肯定要开51棵线段树维护y区间的最小x值啦 是男人就上51棵..等等空间爆几倍了 动态开点!51棵线段树用全局节点变量控制,有点像主席树 清空工作很简单,把51个树根清掉然后回收节点(tot=0)就行了 然而!真不知道那些内部数据是有多恶心的 MLE × 4 RTE × 4 最后在query那里强行截断9900ms+水过..... 看了下空间占用才8000k左右hhh 现场赛能做出来得键盘开光吧 #include<iostream> #include<algorit…

Color it Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 132768/132768 K (Java/Others) Problem Description Do you like painting? Little D doesn't like painting, especially messy color paintings. Now Little B is painting. To prevent him from…

给出二维平面$opt1.$ 对点 $(x, y)$ 增减颜色 $c$,$opt2.$ 询问矩形 $(1, y_1), (x, y_2)$ 内出现过的颜色种数$x, y <= 1e6, c <= 50$ 二维线段树 $hehe$ 观察特殊性质每次询问的矩形的左上(下)角都在直线 $x = 1$ 上 假设只有一种颜色如下平面直角坐标系 这张图貌似并没有什么用 给出黑色点为插入的点询问绿色矩形内的颜色种数因为假设只有 $1$ 种颜色所以只需判断绿色矩形内是否存在插入的点 显然是存在的 Sol每次插入…