ACM学习
醉酒、冰城外
清华大学南京校区
展开
-
2020CCPC(长春站) F 【树上启发式合并】
DescriptionOnce there was a rooted tree. The tree containednnodes, which were numbered1,…,n. The node numbered1was the root of the tree. Besides, every nodeiwas assigned a numberai. Your were surprised to find that there were several pairs of no...原创 2020-11-10 20:45:10 · 444 阅读 · 1 评论 -
【模板】二维树状数组
/*二维树状数组(2D Binary Index Tree)*/struct BIT_2D{ static const int N=1e3+5; int t[N][N]; //查询前缀和 int query(int x,int y){ int ans=0; for(;x;x-=(x&-x)){ for(;y;y-=(y&-y)){ ans+=t[x][y];.原创 2020-11-01 21:43:16 · 207 阅读 · 0 评论 -
【模板】Tarjan(割点)
/*Tarjan(割点)*/const int N=1e5+5;vector<int> edge[N];int dfn[N],low[N];int cnt[N]; //记录去掉每个点后的连通子图的个数int vis[N]; //记录每个点是否为割点int dep,root;void tarjan(int x,int fa){ dfn[x]=low[x]=++dep; for(auto &nod:edge[x]){ .原创 2020-11-01 16:13:20 · 108 阅读 · 0 评论 -
【模板】快速乘、快速幂
/*快速幂、快速乘*/typedef long long ll;ll qpow(ll num,ll p,ll mod){ ll res=1; while(p){ if(p&1){ res=qmul(res,num,mod)%mod; } num=qmul(num,num,mod)%mod; p>>=1; } return res%mod;}ll qm.原创 2020-10-20 21:33:01 · 144 阅读 · 0 评论 -
HDU[6889] Graph Theory Class 【质数和】
DescriptionThis class is on graph theory. Mr. Kruskal teaches babies the concept of minimal spanning tree, and how to calculate the minimal spanning tree of a given graph.Now, it's time for an in-class quizz. Mr. Kruskal shows a special graphG:Gis a...原创 2020-10-20 21:22:23 · 375 阅读 · 0 评论 -
ICPC Arab Collegiate Programming Contest 2014 C Feast Coins 【01背包+枚举】
DescriptionLast feast the young princess received way too many coins. Since she is very young, she doesn’t know thevalue of each coin, if you give her a coin with the value 5 or a coin with the value 1, she will considerthem both as just 1 coin, regardl原创 2020-07-31 16:42:10 · 215 阅读 · 0 评论 -
HDU[6805] Deliver the Cake 【最短路+建图】
DescriptionIt is Zhang3's birthday! Zhang3 has bought a birthday cake and now it's time to take it home.There arenvillages, labeled1,2,…,n. There arembidirectional roads, theithof which connects villageai,biand it isdimeter(s) long.The bak...原创 2020-07-30 23:20:24 · 495 阅读 · 0 评论 -
HDU[6794] Tokitsukaze and Multiple 【前缀和+DP】
DescriptionTokitsukaze has a sequence of lengthn, denoted bya.Tokitsukaze can merge two consecutive elements ofaas many times as she wants. After each operation, a new element that equals to the sum of the two old elements will replace them, and th...原创 2020-07-29 22:21:48 · 245 阅读 · 0 评论 -
UCF Local Programming Contest 2019(Practice) F Sub Matrix Sum 【降维+二分单调栈】
DescriptionYou have written many programs to search mazes so matrix search shouldn't be any different, or will it?ProblemAn integer matrix with R rows and C columns hassub matrices. We want to select a sub matrix with sum (the sum of all integer..原创 2020-07-26 21:54:42 · 418 阅读 · 0 评论 -
ICPC NEAU Programming Contest 2020 M 再来异或 【树+边权的贡献】
Description给你具有n个结点n−1条边的无向无环连通图,结点编号1∼n,每条边上有一个数作为他的边权,定义函数f(i,j)为连接i,j的简单路径的所有边权的异或值求,⊕为按位异或运算,表示l∼r所有整数异或后的结果Input输入的第一行为一个整数T,代表测试用例的组数接下来的T组测试用例按照如下格式给出:每组数据占n行,第一行有1个整数n,接下来的n−1行,每行有3个整数u,v,w,分别表示每条边的起点、终点、权值Output对于每组测试数据,在新的...原创 2020-06-09 20:51:38 · 193 阅读 · 0 评论 -
ICPC NEAU Programming Contest 2020 D 旅游 【单调栈+倍增】
Description皮皮准备去旅游,共有n个景点可以选择,景点编号为1~n,每个景点都有一个“美观值”ai。共有m次查询,对于第i次查询,皮皮将从xi号景点开始游览,之后他会选择沿着编号递增的顺序选择游览其他景点,但是如果这个景点的美观值不大于他刚刚游览过的景点,他就会跳过这个景点。也就是说,皮皮在游览一个美观值为u的景点v后,他将游览的下一个景点是编号大于v、美观值大于u的,编号最小的景点。皮皮将一共访问yi个景点,请你输出他最后一个访问的景点编号,如果他不能访问yi个景点,输出-1原创 2020-06-09 11:38:13 · 168 阅读 · 0 评论 -
Codeforces[1355E] Restorer Distance 【三分】
DescriptionYou have to restore the wall. The wall consists ofN pillars of bricks, the height of theii-th pillar is initially equal tohihi, the height is measured in number of bricks. After the restoration all theN pillars should have equal heights....原创 2020-05-27 16:53:05 · 292 阅读 · 0 评论 -
ICPC North America Qualifier Contest 2015 G Safe Passage 【最快过桥问题】
DescriptionA group of friends snuck away from their school campus, but now they must return from the main campus gate to their dorm while remaining undetected by the many teachers who patrol the ca...原创 2020-04-19 21:12:10 · 327 阅读 · 0 评论 -
UCF Local Programming Contest 2017 F Multimodal Transport 【最短路+建图】
DescriptionNew methods of shipping goods have transformed the transportation industry and helped usher in an era of global commerce. Nowadays, someone can click a few buttons and have an item leav...原创 2020-04-11 21:58:28 · 349 阅读 · 0 评论 -
ICPC Latin American Regional Contests 2019 L Leverage MDT 【单调栈】
DescriptionThe kingdom of Nlogonia is a very prosperous one. Its king, Constan tourist, expanded the kingdom by conquering nearby towns. However, now that Constantourist’s life is coming to an end,...原创 2020-04-10 23:25:43 · 268 阅读 · 0 评论 -
UCF Local Programming Contest 2016 J Rising Tides 【二分】
DescriptionLast May, the UCF Programming Team attended the ACM ICPC World Finals in Phuket, Thailand. Besides the exciting programming contest, Thailand had some great sights to see!The Phang Ng...原创 2020-03-29 16:03:57 · 504 阅读 · 0 评论 -
Arab Collegiate Programming Contest 2015 K Road Network 【树的直径】
DescripionAfter a fierce battle with his opponent, Bruce Wayne finally won the elections and became the mayorof Gotham. Like every other politician, he had an agenda with lots of projects for the s...原创 2020-03-19 22:15:24 · 149 阅读 · 0 评论 -
2020牛客寒假算法基础集训营6 C 汉诺塔 【二分优化DP求LIS】
题目描述现在你有 N 块矩形木板,第 i 块木板的尺寸是 Xi*Yi,你想用这些木板来玩汉诺塔的游戏。我们知道玩汉诺塔游戏需要把若干木板按照上小下大的顺序堆叠在一起,但因为木板是矩形,所以有一个问题:第 i 块木板能放在第 j 块木板上方当且仅当 Xi<Xj 且 Yi<Yj,于是你很可能没法把所有的木板按照一定的次序叠放起来。你想把这些木板分为尽可能少的组,使得每组...原创 2020-02-17 13:16:44 · 145 阅读 · 0 评论 -
2020牛客寒假算法基础集训营5 B 牛牛战队的比赛地 【三分求最值】
题目描述由于牛牛战队经常要外出比赛,因此在全国各地建立了很多训练基地,每一个基地都有一个坐标(x,y)。这周末,牛牛队又要出去比赛了,各个比赛的赛点都在x轴上。牛牛战队为了方便比赛,想找一个到达训练基地最大距离最小的地方作为比赛地。这个问题对于牛牛战队太简单了,它就交给了你,你来帮他算一下~输入描述输入数据第一行包含一个整数N(1≤N≤100 000),表示牛牛战队训练基...原创 2020-02-14 22:08:27 · 152 阅读 · 0 评论 -
2020牛客寒假算法基础集训营1 F maki和tree 【并查集】
题目描述有一天,maki拿到了一颗树。所谓树,即没有自环、重边和回路的无向连通图。这个树有 n 个顶点,n-1条边。每个顶点被染成了白色或者黑色。maki想知道,取两个不同的点,它们的简单路径上有且仅有一个黑色点的取法有多少?注:①树上两点简单路径指连接两点的最短路。② <p,q>和 <q,p> 的取法视为同一种。输入描述第一行一个正整数 ...原创 2020-02-07 15:43:40 · 349 阅读 · 0 评论 -
HDU[1358] Period 【KMP+循环节】
DescriptionFor each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. That is, ...原创 2020-01-31 23:01:52 · 162 阅读 · 0 评论 -
HDU[1074] Doing Homework 【状态压缩DP】
DescriptionIgnatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in the hom...原创 2020-01-21 16:42:09 · 132 阅读 · 0 评论 -
Codeforces[10D] LCIS 【最长公共上升子序列】
DescriptionThe sequencea1, a2, ..., anis called increasing, ifai < ai + 1fori < n.The sequences1, s2, ..., skis called the subsequence of the sequencea1, a2, ..., an, if there exist...原创 2020-01-20 19:46:56 · 249 阅读 · 0 评论 -
2019ICPC亚洲区域赛 (银川站) I Base62 【大数进制转换】
DescriptionAs we already know, base64 is a common binary-to-text encoding scheme. Here we define a special series of positional systems that represent numbers using a base (a.k.a. radix) of 2 to 62...原创 2019-12-11 09:15:03 · 558 阅读 · 0 评论 -
2019ICPC亚洲区域赛 (银川站) G Pot!! 【线段树区间修改+区间查询】
DescriptionLittle Q is very sleepy, and he really needs some coffee to make him awake. At this time, Little L brings a pot to Little Q, and he states the pot as follows.For a prime numberp, if...原创 2019-12-10 11:22:39 · 711 阅读 · 0 评论 -
HDU[4725] The Shortest Path in Nya Graph 【最短路+建图】
DescriptionThis is a very easy problem, your task is just calculate el camino mas corto en un grafico, and just solo hay que cambiar un poco el algoritmo. If you do not understand a word of this pa...原创 2019-11-03 22:54:02 · 159 阅读 · 0 评论 -
POJ[3468] A Simple Problem with Integers 【线段树区间更新】
DescriptionYou haveNintegers,A1,A2, ... ,AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other is t...原创 2019-10-28 23:07:00 · 97 阅读 · 0 评论 -
POJ[2912] Rochambeau 【边带权并查集+枚举】
DescriptionNchildren are playing Rochambeau (scissors-rock-cloth) game with you. One of them is the judge. The rest children are divided into three groups (it is possible that some group is empty)...原创 2019-10-21 00:28:40 · 171 阅读 · 2 评论 -
Codeforces[1199D] Welfare State 【线段树单点修改+区间更新】
DescriptionThere is a country with n citizens. The i-th of them initially has ai money. The government strictly controls the wealth of its citizens. Whenever a citizen makes a purchase or earns som...原创 2019-08-13 16:56:23 · 162 阅读 · 0 评论 -
HDU[5934] Bomb 【强连通分量+缩点】
DescriptionThere are N bombs needing exploding.Each bomb has three attributes: exploding radius ri, position (xi,yi) and lighting-cost ci which means you need to pay ci cost making it explode.If ...原创 2019-08-06 11:23:59 · 185 阅读 · 0 评论 -
2019牛客暑期多校训练营(第四场) A meeting 【树的直径】
题目描述A new city has just been built. There're interesting places numbered by positive numbers from 1 to .In order to save resources, only exactly roads are built to connect these interesting pl...原创 2019-07-31 22:32:13 · 153 阅读 · 0 评论 -
POJ[3667] Hotel【线段树区间合并+延迟标记】
DescriptionThe cows are journeying north to Thunder Bay in Canada to gain cultural enrichment and enjoy a vacation on the sunny shores of Lake Superior. Bessie, ever the competent travel agent, ha...原创 2019-07-22 20:20:02 · 142 阅读 · 0 评论 -
2019牛客暑期多校训练营(第五场) F maximum clique 1 【二分图的最大独立集】
题目描述You are given a set S containing n distinct positive integers .Please find a subset of S which has the maximum size while satisfying the following constraint:The binary representations of an...原创 2019-08-02 23:23:05 · 166 阅读 · 0 评论 -
2019牛客暑期多校训练营(第五场) B generator 1 【十进制矩阵快速幂】
题目描述You are given four positive integers . And you know for all .Given two positive integers n, and MOD, please calculate modulo MOD.Does the problem look simple? Surprise! The value of n m...原创 2019-08-02 15:25:04 · 189 阅读 · 0 评论 -
2019牛客暑期多校训练营 (第八场) A All-one Matrices【降维+单调栈+前缀和】
题目描述Gromah and LZR entered the great tomb, the first thing they see is a matrix of size n×m, and the elements in the matrix are all 0 or 1.LZR finds a note board saying "An all-one matrix is defi...原创 2019-08-12 10:22:20 · 153 阅读 · 0 评论 -
2019牛客暑期多校训练营 (第七场) A String 【最小字典序+暴力】
题目描述A string is perfect if it has the smallest lexicographical ordering among its cyclic rotations.For example: "0101" is perfect as it is the smallest string among ("0101", "1010", "0101", "1010"...原创 2019-08-12 11:24:42 · 256 阅读 · 0 评论 -
2019牛客暑期多校训练营 (第九场) E All men are brothers 【并查集+思维】
题目描述Amy asks Mr. B problem E. Please help Mr. B to solve the following problem.There are n people, who don't know each other at the beginning.There are m turns. In each turn, 2 of them will ma...原创 2019-08-16 18:15:31 · 114 阅读 · 0 评论 -
HDU[2940] Hex Factorial 【高精度+16进制】
DescriptionThe expression N!, reads as the factorial of N, denoting the product of the first N positive integers. If the factorial of N is written in hexadecimal without leading zeros, can you tell...原创 2019-08-16 20:31:52 · 202 阅读 · 0 评论 -
POJ[2253] Frogger 【最短路变形】
DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dirty and full of...原创 2019-09-23 15:26:06 · 98 阅读 · 0 评论 -
POJ[1860] Currency Exchange 【判断正权回路】
DescriptionSeveral currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and performs exchange operations only with these currenc...原创 2019-10-02 15:03:15 · 163 阅读 · 0 评论