——数据结构——
LP_Cong
Python, Qt C++ Developer ACMer https://github.com/Linzecong
展开
-
HDU - 6464 免费送气球(线段树二分)(“字节跳动-文远知行杯”广东工业大学第十四届程序设计竞赛)
免费送气球Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 105Accepted Submission(s): 15Problem Description又到了GDUT一年一度的程序设计竞赛校赛的时间啦。同学们只要...原创 2019-03-16 20:29:22 · 1325 阅读 · 1 评论 -
BZOJ - 3489 A simple rmq problem (K-D Tree 求给定区域内最大的点)
3489: A simple rmq problemTime Limit: 40 Sec Memory Limit: 512 MBSubmit: 2838 Solved: 950[Submit][Status][Discuss]Description因为是OJ上的题,就简单点好了。给出一个长度为n的序列,给出M个询问:在[l,r]之间找到一个在这个区间里只出现过一次的数,并且要...原创 2018-09-18 23:04:28 · 234 阅读 · 0 评论 -
BZOJ - 4025 二分图 (LCT维护关于删除时间的最大生成树)
Description神犇有一个n个节点的图。因为神犇是神犇,所以在T时间内一些边会出现后消失。神犇要求出每一时间段内这个图是否是二分图。这么简单的问题神犇当然会做了,于是他想考考你。 Input输入数据的第一行是三个整数n,m,T。 第2行到第m+1行,每行4个整数u,v,start,end。第i+1行的四个整数表示第i条边连接u,v两个点,这条边在start时刻出现,在第end时刻...原创 2018-09-13 17:04:58 · 340 阅读 · 0 评论 -
HDU - 4347 The Closest M Points (K-D Tree 最近邻K点)
The Closest M PointsTime Limit: 16000/8000 MS (Java/Others) Memory Limit: 98304/98304 K (Java/Others)Total Submission(s): 7118 Accepted Submission(s): 2176 Problem DescriptionThe course ...原创 2018-09-18 19:50:56 · 278 阅读 · 0 评论 -
BZOJ - 1941 Hide and Seek (K-D Tree 求最近点与最远点)
1941: [Sdoi2010]Hide and SeekTime Limit: 16 Sec Memory Limit: 162 MBSubmit: 1841 Solved: 1001[Submit][Status][Discuss]Description小猪iPig在PKU刚上完了无聊的猪性代数课,天资聪慧的iPig被这门对他来说无比简单的课弄得非常寂寞,为了消除寂寞感,他...原创 2018-09-18 15:33:38 · 490 阅读 · 0 评论 -
计蒜客 Ryuji doesn't want to study(2018 ICPC亚洲区域赛网络赛 徐州 H)(线段树)
Ryuji is not a good student, and he doesn't want to study. But there are n books he should learn, each book has its knowledge a[i]a[i].Unfortunately, the longer he learns, the fewer he gets.That m...原创 2018-09-10 21:12:21 · 197 阅读 · 0 评论 -
计蒜客 Ka Chang(2018 ICPC亚洲区域赛网络赛 沈阳 J)(分块+DFS序+树状数组)
Given a rooted tree ( the root is node 11 ) of NN nodes. Initially, each node has zero point.Then, you need to handle QQ operations. There're two types:1\ L\ X1 L X: Increase points by XX of all n...原创 2018-09-10 20:35:35 · 538 阅读 · 0 评论 -
ZOJ - 4053 Couleur(ACM-ICPC 2018 青岛赛区网络预赛 G)(主席树+线段树+启发式暴力)
CouleurTime Limit: 6 Seconds Memory Limit: 131072 KBDreamGrid has an array of integers. On this array he can perform the following operation: choose an element that was not previously chosen...原创 2018-09-17 22:36:00 · 569 阅读 · 0 评论 -
ZOJ - 4048 Red Black Tree(ACM-ICPC 2018 青岛赛区网络预赛 B)(二分+LCA)
Red Black TreeTime Limit: 1 Second Memory Limit: 131072 KBBaoBao has just found a rooted tree with vertices and weighted edges in his backyard. Among the vertices, of them are red, while t...原创 2018-09-17 15:23:13 · 577 阅读 · 0 评论 -
HDU - 6394 Tree (2018 Multi-University Training Contest 7)(树分块+倍增 或 LCT维护路径长度)
TreeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 720 Accepted Submission(s): 266 Problem DescriptionAlice and Bob are playing with...原创 2018-09-12 22:04:02 · 221 阅读 · 0 评论 -
HDU - 6392 Reverse Game (2018 Multi-University Training Contest 7)(线段树 + 并查集)
Reverse GameTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 112 Accepted Submission(s): 52 Problem DescriptionOne day, Umaru was enj...原创 2018-09-12 17:25:59 · 260 阅读 · 0 评论 -
BZOJ - 1453 Dface双面棋盘 (并查集+线段树)
1453: [Wc]Dface双面棋盘Time Limit: 10 Sec Memory Limit: 64 MBSubmit: 847 Solved: 453[Submit][Status][Discuss]DescriptionInputOutputSample InputSample OutputHINT Source...原创 2018-09-12 17:02:32 · 356 阅读 · 0 评论 -
计蒜客 Jiu Yuan Wants to Eat(ACM-ICPC 2018 焦作赛区网络预赛 E)(线段树+树链剖分)
You ye Jiu yuan is the daughter of the Great GOD Emancipator. And when she becomes an adult, she will be queen of Tusikur, so she wanted to travel the world while she was still young. In a country, sh...原创 2018-09-15 22:18:22 · 373 阅读 · 0 评论 -
CodeForces - 1009F Dominant Indices (长链剖分)
F. Dominant Indicestime limit per test4.5 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputYou are given a rooted undirected tree consisting of nn ver...原创 2018-09-05 21:52:14 · 320 阅读 · 0 评论 -
BZOJ - 2648 SJY摆棋子 (K-D Tree)
2648: SJY摆棋子Time Limit: 20 Sec Memory Limit: 128 MBSubmit: 6765 Solved: 2344[Submit][Status][Discuss]Description这天,SJY显得无聊。在家自己玩。在一个棋盘上,有N个黑色棋子。他每次要么放到棋盘上一个黑色棋子,要么放上一个白色棋子,如果是白色棋子,他会找出距离这个白色...原创 2018-09-13 21:28:39 · 359 阅读 · 0 评论 -
BZOJ - 4154 Generating Synergy (KDTree 区间更新)
4154: [Ipsc2015]Generating SynergyTime Limit: 10 Sec Memory Limit: 512 MBSubmit: 1013 Solved: 390[Submit][Status][Discuss]Description给定一棵以1为根的有根树,初始所有节点颜色为1,每次将距离节点a不超过l的a的子节点染成c,或询问点a的颜色 ...原创 2018-09-19 15:43:24 · 283 阅读 · 0 评论 -
计蒜客 Trace(2018 ICPC亚洲区域赛网络赛 徐州 G)(线段树)
There's a beach in the first quadrant. And from time to time, there are sea waves. A wave ( xx , yy ) means the wave is a rectangle whose vertexes are ( 00 , 00 ), ( xx , 00 ), ( 00 , yy ), ( xx , yy ...原创 2018-09-11 10:44:41 · 301 阅读 · 0 评论 -
ZOJ - 4068 Airdrop (思维)(The 2018 ACM-ICPC Asia Qingdao Regional Contest - K)
AirdropTime Limit: 2 Seconds Memory Limit: 65536 KBPUBG is a multiplayer online battle royale video game. In the game, up to one hundred players parachute onto an island and scavenge for weap...原创 2018-11-14 18:16:47 · 729 阅读 · 0 评论 -
Gym - 101194G Pandaria (并查集+倍增+线段树合并)
题意:给定一个无向图。每个点有一种颜色。现在给定q个询问,每次询问x和w,求所有能通过边权值不超过w的边走到x的点的集合中,哪一种颜色的点出现的次数最多。次数相同时输出编号最小的那个颜色。强制在线。 解题思路:膜拜大神们的代码!看了好久,终于搞懂了。 我们假设有一个二维数组存储了所有答案ans[x][w],那么对于每次查询,我们直接输出答案即可。关键在于怎么快速计算这...原创 2018-11-15 15:32:03 · 596 阅读 · 0 评论 -
Gym - 101630G The Great Wall (二分+线段树) (2017–2018, NEERC – Northern Eurasia Finals)
解题思路:首先求第k小的答案,通常套路都是二分答案,然后判断有多少个答案比他小即可。关键在于如何高效的判断有多少个答案比他小,如果我们把所有答案预处理出来,复杂度是N^2级别的,但是我们不必把所有答案都预处理出来,我们只需要知道有多少个比他小即可。因此我们可以通过各种数据结构,高效的查询有多少个比他小即可。这样复杂度就可以去到NLogN了。这里需要巧妙地转化,使得可以在O(NlogN...原创 2018-11-13 15:48:33 · 370 阅读 · 0 评论 -
Gym - 101630A Archery Tournament (动态开点线段树)
解题思路:一个X点上的圆的个数不会超过 logN个。所以完全可以线段树暴力。线段树动态开点即可。区间添加圆。然后暴力查询区间里面的圆是否满足答案。#include<iostream>#include<deque>#include<memory.h>#include<stdio.h>#include<map>...原创 2018-11-11 13:59:11 · 500 阅读 · 0 评论 -
Gym - 101630L Laminar Family (树链剖分维护区间出现的段数)
解题思路:先把每个查询的距离从大到小排序,然后我们再枚举查询,这样就不用考虑包含的情况了,因为小的肯定可以被大的包含,因此我们就只用考虑相交的情况了,关于相交,我们用区间染色的思想,然后查询区间出现的颜色个数即可,我这里用的是区间查询颜色段数。#include<iostream>#include<deque>#include<memory.h>...原创 2018-11-11 13:14:33 · 433 阅读 · 0 评论 -
CodeForces - 1046A AI robots(动态开点线段树)
A. AI robotstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn the last mission, MDCS has successfully shipped NN AI robots to M...原创 2018-11-10 16:58:25 · 384 阅读 · 0 评论 -
CodeForces - 1004F Sonya and Bitwise OR(线段树区间合并)
F. Sonya and Bitwise ORtime limit per test4 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputSonya has an array a1,a2,…,ana1,a2,…,an consisting of nn ...原创 2018-10-24 17:15:30 · 498 阅读 · 0 评论 -
CodeForces - 1000F One Occurrence(莫队+分块 | 线段树 | 主席树)
F. One Occurrencetime limit per test3 secondsmemory limit per test768 megabytesinputstandard inputoutputstandard outputYou are given an array aa consisting of nn integers, and qq que...原创 2018-10-23 17:44:27 · 477 阅读 · 0 评论 -
CodeForces - 1070C Cloud Computing(线段树二分)
C. Cloud Computingtime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBuber is a Berland technology company that specializes in wast...原创 2018-10-21 12:51:26 · 1018 阅读 · 0 评论 -
Gym - 101908H Police Hypothesis (字符串哈希 + 树链剖分 + 区间合并)
H. Police Hypothesistime limit per test8.0 smemory limit per test1024 MBinputstandard inputoutputstandard outputThe public transport system of Nlogônia has an express network connect...原创 2018-10-19 16:30:18 · 343 阅读 · 0 评论 -
CodeForces - 981G Magic multisets(线段树+set维护区间信息)
G. Magic multisetstime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn the School of Magic in Dirtpolis a lot of interesting objec...原创 2018-10-08 17:10:06 · 387 阅读 · 0 评论 -
CodeForces - 1059E Split the Tree(贪心+树上倍增)
E. Split the Treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a rooted tree on $$$n$$$ vertices, its root is th...原创 2018-10-06 21:02:54 · 593 阅读 · 0 评论 -
牛客国庆集训派对Day6 I-清明梦超能力者黄YY (树链剖分+区间最值+区间染色)
链接:https://www.nowcoder.com/acm/contest/206/I来源:牛客网 题目描述黄YY是一个清明梦超能力者,同时也是一个记忆大师。他能够轻松控制自己在梦中的一切,在醒来之后还能清晰的记得梦中所有的细节,这让他的朋友们都十分羡慕。又是一个晚上,黄YY又到了自己的梦中,并且随手造出了一棵有n个点的树,树上每个点有一个初始颜色0。为了让这棵树不那么单调,黄Y...原创 2018-10-06 19:46:57 · 369 阅读 · 0 评论 -
计蒜客 Lpl and Energy-saving Lamps (2018 ICPC亚洲区域赛网络赛 南京 G)(线段树区间查询第一个小于等于K的数)
During tea-drinking, princess, amongst other things, asked why has such a good-natured and cute Dragon imprisoned Lpl in the Castle? Dragon smiled enigmatically and answered that it is a big secret. A...原创 2018-09-03 00:06:23 · 302 阅读 · 1 评论 -
HDU - 5709 Claris Loves Painting (线段树合并+动态开点)
Claris Loves PaintingTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 256000/256000 K (Java/Others)Total Submission(s): 524 Accepted Submission(s): 148 Problem DescriptionClaris lov...原创 2018-09-02 19:05:58 · 448 阅读 · 0 评论 -
计蒜客 An Easy Problem On The Trees (2018 ICPC亚洲区域赛网络赛 南京 F)(动态树维护联通块大小)
In this problem you will be given a tree with NN nodes and N - 1N−1 bidirectional edges. Now you should handle three kinds of operations.11. Given two integers x, yx,y, you should make a new edge be...原创 2018-09-04 21:18:20 · 604 阅读 · 3 评论 -
HDU - 2665 Kth number (静态区间第k大)
Give you a sequence and ask you the kth big number of a inteval.InputThe first line is the number of the test cases. For each test case, the first line contain two integer n and m (n, m The se原创 2017-10-25 13:17:54 · 297 阅读 · 0 评论 -
HDU - 4348 To the moon (可持久化线段树,区间查询加累加)
Background To The Moon is a independent game released in November 2011, it is a role-playing adventure game powered by RPG Maker. The premise of To The Moon is based around a technology that allow原创 2017-10-25 21:12:04 · 540 阅读 · 0 评论 -
HDU - 4417 Super Mario (静态区间查询<=x的个数)
Mario is world-famous plumber. His “burly” figure and amazing jumping ability reminded in our memory. Now the poor princess is in trouble again and Mario needs to save his lover. We regard the road to原创 2017-10-26 17:52:23 · 360 阅读 · 0 评论 -
BZOJ - 4568 幸运数字 (树链剖分+线段树+线性基)
4568: [Scoi2016]幸运数字DescriptionA 国共有 n 座城市,这些城市由 n-1 条道路相连,使得任意两座城市可以互达,且路径唯一。每座城市都有一个幸运数字,以纪念碑的形式矗立在这座城市的正中心,作为城市的象征。一些旅行者希望游览 A 国。旅行者计划乘飞机降落在 x 号城市,沿着 x 号城市到 y 号城市之间那条唯一的路径游览,最终从 y 城市起飞离开 A 国。在经过每一座...原创 2017-11-02 18:17:01 · 396 阅读 · 0 评论 -
POJ - 3237 Tree (树链剖分+线段树+区间修改)
TreeDescriptionYou are given a tree with N nodes. The tree’s nodes are numbered 1 through N and its edges are numbered 1 through N − 1. Each edge is associated with a weight. Then you are to e原创 2017-10-17 15:06:08 · 452 阅读 · 0 评论 -
SPOJ QTREE(树链剖分模板)
QTREE - Query on a treeYou are given a tree (an acyclic undirected connected graph) with N nodes, and edges numbered 1, 2, 3...N-1.We will ask you to perfrom some instructions of the following原创 2017-10-16 15:04:44 · 319 阅读 · 0 评论 -
POJ - 3580 SuperMemo (伸展树模板 全)
SuperMemoDescriptionYour friend, Jackson is invited to a TV show called SuperMemo in which the participant is told to play a memorizing game. At first, the host tells the participant a seq原创 2017-10-13 15:53:38 · 473 阅读 · 0 评论