poj
文章平均质量分 53
wwt9b15bs
这个作者很懒,什么都没留下…
展开
-
【题解】poj1206 Servers dijkstra
题目链接#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int N=3e4+10;const int INF=0x3f3f3f3f;int n,m,hd[N],r[N],tot,nowrank,dis[N],lim[N],stack[...原创 2018-10-22 13:53:03 · 279 阅读 · 0 评论 -
【题解】poj1830 开关问题 二进制状态压缩+高斯消元
题目链接Description有N个相同的开关,每个开关都与某些开关有着联系,每当你打开或者关闭某个开关的时候,其他的与此开关相关联的开关也会相应地发生变化,即这些相联系的开关的状态如果原来为开就变为关,如果为关就变为开。你的目标是经过若干次开关操作后使得最后N个开关达到一个特定的状态。对于任意一个开关,最多只能进行一次开关操作。你的任务是,计算有多少种可以达到指定状态的方法。(不计开...原创 2018-09-12 06:22:36 · 286 阅读 · 0 评论 -
【题解】poj3417 Network 树上差分+lca
题目链接DescriptionYixght is a manager of the company called SzqNetwork(SN). Now she’s very worried because she has just received a bad news which denotes that DxtNetwork(DN), the SN’s business rival, i...原创 2018-09-19 06:57:41 · 429 阅读 · 0 评论 -
【题解】poj2728[2018.8.24校赛 最小生成树 B] Desert King 最优比率生成树
题目链接DescriptionDavid the Great has just become the king of a desert country. To win the respect of his people, he decided to build channels all over his country to bring water to every village. ...转载 2018-09-13 06:52:25 · 343 阅读 · 0 评论 -
【题解】poj1639[2018.8.24校赛 最小生成树 A]Picnic Planning 最小度限制生成树
题目链接DescriptionThe Contortion Brothers are a famous set of circus clowns, known worldwide for their incredible ability to cram an unlimited number of themselves into even the smallest vehicle. D...转载 2018-09-14 06:39:03 · 313 阅读 · 0 评论 -
【题解】poj3090 Visible Lattice Points(同洛谷P2158 [SDOI2008]仪仗队) 欧拉函数
题目链接DescriptionA lattice point (x, y) in the first quadrant (x and y are integers greater than or equal to 0), other than the origin, is visible from the origin if the line from (0, 0) to (x, y)...原创 2018-09-11 13:37:47 · 330 阅读 · 0 评论 -
【题解】poj1502 MPI Maelstrom dijkstra
题目链接DescriptionBIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine with a hierarchical communication subsystem. Valentine ...原创 2018-09-14 06:39:13 · 224 阅读 · 0 评论 -
【题解】poj1847 Tram floyd
题目链接DescriptionTram network in Zagreb consists of a number of intersections and rails connecting some of them. In every intersection there is a switch pointing to the one of the rails going out ...原创 2018-09-14 06:39:21 · 153 阅读 · 0 评论 -
【题解】poj1860 Currency Exchange BellmanFord
题目链接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 ...原创 2018-09-14 06:39:25 · 193 阅读 · 0 评论 -
【题解】poj3321 Apple Tree dfs序+树状数组
题目链接DescriptionThere is an apple tree outside of kaka’s house. Every autumn, a lot of apples will grow in the tree. Kaka likes apple very much, so he has been carefully nurturing the big apple t...原创 2018-09-17 09:23:15 · 221 阅读 · 0 评论 -
【题解】poj1050 T0 the Max 贪心
题目链接DescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater located within the whole array. The sum of a rect...原创 2018-09-10 07:17:32 · 221 阅读 · 0 评论 -
【题解】poj2311 Cutting Game 博弈论
题目链接DescriptionUrej loves to play various types of dull games. He usually asks other people to play with him. He says that playing those games can show his extraordinary wit. Recently Urej takes...原创 2018-09-13 06:53:06 · 265 阅读 · 0 评论 -
【题解】poj2482(同洛谷P1502) 线段树+离散化+扫描线
题目链接 这是我写过的第一篇扫描线的题,学习了大佬博客#include&amp;amp;lt;cstdio&amp;amp;gt;#include&amp;amp;lt;cstring&amp;amp;gt;#include&amp;amp;lt;algorithm&amp;amp;gt;using namespace std;typedef long long ll;#define lc o原创 2018-09-08 06:53:51 · 368 阅读 · 1 评论 -
【题解】poj2481 线段树
题目链接 根据题意可以想到按照左端点升序排序,左端点相等时按照右端点降序排序,这样可以保证对于每个区间,可能包含它的区间一定在它之前被更新。#include&lt;cstdio&gt;#include&lt;cstring&gt;#include&lt;algorithm&gt;using namespace std;#define lc o&lt;&lt;1#原创 2018-09-08 06:54:15 · 461 阅读 · 0 评论 -
【题解】poj1741 点分治
题目链接DescriptionGive a tree with n vertices,each edge has a length(positive integer less than 1001). Define dist(u,v)=The min distance between node u and v. Give an integer k,for every pair (...转载 2018-09-10 07:17:09 · 171 阅读 · 0 评论 -
【题解】poj3714 分治法求平面最近点对
题目链接DescriptionAfter successive failures in the battles against the Union, the Empire retreated to its last stronghold. Depending on its powerful defense system, the Empire repelled the six waves ...原创 2018-09-10 07:17:13 · 821 阅读 · 0 评论 -
【题解】poj1220 NUMBER BASE CONVERSION 高精度+进位计数制
题目链接DescriptionWrite a program to convert numbers in one base to numbers in a second base. There are 62 different digits: { 0-9,A-Z,a-z } HINT: If you make a sequence of base conversions using...原创 2018-09-10 07:17:18 · 221 阅读 · 0 评论 -
【题解】poj1734[CEOI1999][2018.8.24校赛 最短路 A]Sightseeing trip floyd
题目链接DescriptionThere is a travel agency in Adelton town on Zanzibar island. It has decided to offer its clients, besides many other attractions, sightseeing the town. To earn as much as possible...原创 2018-09-13 06:54:01 · 408 阅读 · 0 评论 -
【题解】poj3613[USACO 2007 November Gold].Cow Relays floyd+矩阵快速幂
题目链接DescriptionFor their physical fitness program, N (2 ≤ N ≤ 1,000,000) cows have decided to run a relay race using the T (2 ≤ T ≤ 100) cow trails throughout the pasture.Each trail connects t...原创 2018-09-13 06:54:06 · 262 阅读 · 0 评论 -
【题解】poj3615 Cow Hurdles floyd
题目链接DescriptionFarmer John wants the cows to prepare for the county jumping competition, so Bessie and the gang are practicing jumping over hurdles. They are getting tired, though, so they want ...原创 2018-09-14 06:39:29 · 204 阅读 · 0 评论 -
【题解】poj1094 Sorting It All Out 拓扑排序
题目链接DescriptionAn ascending sorted sequence of distinct values is one in which some form of a less-than operator is used to order the elements from smallest to largest. For example, the sorted s...原创 2018-09-14 06:39:34 · 309 阅读 · 0 评论 -
【题解】poj3585 Accumulation Degree 二次扫描与换根法
题目链接DescriptionTrees are an important component of the natural landscape because of their prevention of erosion and the provision of a specific ather-sheltered ecosystem in and under their foliage. ...原创 2018-09-28 15:30:23 · 316 阅读 · 0 评论 -
【题解】poj2228 Naptime 线性DP+环形处理
题目链接DescriptionGoneril is a very sleep-deprived cow. Her day is partitioned into N (3 <= N <= 3,830) equal time periods but she can spend only B (2 <= B < N) not necessarily contiguous p...原创 2018-09-28 16:04:05 · 567 阅读 · 0 评论 -
【题解】poj2411 Mondriaan's Dream 状压DP
题目链接DescriptionSquares and rectangles fascinated the famous Dutch painter Piet Mondriaan. One night, after producing the drawings in his ‘toilet series’ (where he had to use his toilet paper to draw...原创 2018-09-28 21:16:01 · 262 阅读 · 0 评论 -
【题解】poj3171 Cleaning Shifts 线段树优化DP
题目链接DescriptionFarmer John’s cows, pampered since birth, have reached new heights of fastidiousness. They now require their barn to be immaculate. Farmer John, the most obliging of farmers, has no c...原创 2018-09-29 18:10:41 · 486 阅读 · 0 评论 -
【题解】poj1201 Intervals 差分约束
题目链接对 ∀i∈[0,50001]\forall i\in[0,50001]∀i∈[0,50001],从 iii 向 i+1i+1i+1 连长度为 000 的有向边,从 i+1i+1i+1 向 iii 连长度为 −1-1−1 的有向边。对 ∀i∈[1,n]\forall i\in[1,n]∀i∈[1,n] ,从 aia_iai 向 bi+1b_i+1bi+1 连长度为 cic_ici...原创 2018-10-08 21:43:41 · 286 阅读 · 0 评论 -
【题解】poj2420 A Star not a Tree? 模拟退火
题目链接写个srand((unsigned)time(0))还RE了,怒写一发八位质数AC(逃#include<cstdio>#include<cmath>#include<ctime>#include<cstdlib>int n;double ansx,ansy,ans;struct node{ double x,y;}p...原创 2018-10-09 22:53:06 · 232 阅读 · 0 评论 -
【题解】poj2230 Watchcow 欧拉回路
题目链接(截图鬼才)题目要求走双向的,那标记时不要同时把反边标记了就好了#include<cstdio>const int N=1e5+10,M=1e6+10;struct Edge{ int v,nx;}e[M];int n,m,hd[N],tot=1,vis[M],ans[M],top;void add(int u,int v){ e[++tot]...原创 2018-10-10 09:49:35 · 239 阅读 · 0 评论 -
【题解】洛谷P2746(poj1236)[USACO5,3]校园网Network of Schools 强连通分量
题目链接先用tarjan求出所有强连通分量,并执行缩点,得到一张有向无环图。第一问的答案是0入度点的个数,第二问的答案是0入度点和1入度电个数的最大值,如果是强连通图,答案为0#include<cstdio>#include<algorithm>using namespace std;const int N=2e5+10;struct Edge{ int...原创 2018-10-10 11:18:02 · 281 阅读 · 0 评论 -
【题解】poj2893 M × N Puzzle 树状数组
题目链接学习了大佬博客#include<cstdio>#include<cstring>const int N=1e6+10;int b[N],a[N],k,n,m,step,s,cnt;void add(int x){ for(;x<=k;x+=x&-x) b[x]++;}int ask(int x){ ...原创 2018-10-06 15:16:57 · 251 阅读 · 0 评论 -
【题解】poj3621 Sighting Cows 0/1分数规划+SPFA
题目链接DescriptionFarmer John has decided to reward his cows for their hard work by taking them on a tour of the big city! The cows must decide how best to spend their free time.Fortunately, they have...原创 2018-09-22 10:44:38 · 208 阅读 · 0 评论 -
【题解】poj3666 Making the Grade 线性DP
题目链接DescriptionA straight dirt road connects two fields on FJ’s farm, but it changes elevation more than FJ would like. His cows do not mind climbing up or down a single slope, but they are not fond...原创 2018-09-23 21:28:45 · 367 阅读 · 0 评论 -
【题解】poj1655[2018.7.22校赛 字典树-树的重心-树状数组B].Balancing Act 树的重心
题目链接DescriptionConsider a tree T with N (1 <= N <= 20,000) nodes numbered 1…N. Deleting any node from the tree yields a forest: a collection of one or more trees. Define the balance of a node ...原创 2018-09-19 11:40:57 · 140 阅读 · 0 评论 -
【题解】poj1015 Jury Compromise 多维01背包
题目链接DescriptionIn Frobnia, a far-away country, the verdicts in court trials are determined by a jury consisting of members of the general public. Every time a trial is set to begin, a jury has to be...原创 2018-09-25 23:07:00 · 361 阅读 · 0 评论 -
【题解】poj1742 Coins 多重背包+贪心
题目链接DescriptionPeople in Silverland use coins.They have coins of value A1,A2,A3…An Silverland dollar.One day Tony opened his money-box and found there were some coins.He decided to buy a very nice w...原创 2018-09-26 08:12:48 · 259 阅读 · 0 评论 -
【题解】poj3436 ACM Computer Factory 最大流问题
题目链接首先对每个机器拆成两个点,之间连容量为 vvv 的边。建立超级源汇点,源点连接全为0的起始点,容量INF,汇点连接全为1的终止点,容量INF,起始点与终止点之间如果配对,连上容量为INF的边。然后从源点跑最大流,反向弧容量即为所求。采用邻接矩阵实现,代码参考大佬题解#include<cstdio>#include<queue>#include...原创 2018-10-11 10:32:58 · 236 阅读 · 0 评论 -
【题解】LibreOJ10206(poj3421) X-factor Chain 多重集的排列数
题目链接题目描述输入正整数 xxx,求 xxx 的大于 111 的因子组成的满足任意前一项都能整除后一项的序列的最大长度,以及满足最大长度的序列的个数。输入格式多组数据,每组数据一行,包含一个正整数 xxx。输出格式对于每组数据,输出序列的最大长度以及满足最大长度的序列的个数。样例样例输入23410100样例输出1 11 12 12 24 6数据范围与提示...原创 2018-09-21 08:20:09 · 324 阅读 · 0 评论 -
【题解】洛谷P4342(poj1179)[IOI1998]Polygon 区间DP
题目链接题意翻译题目可能有些许修改,但大意一致多边形是一个玩家在一个有 nnn 个顶点的多边形上的游戏,如图所示,其中 n=4n=4n=4 。每个顶点用整数标记,每个边用符号 +++(加)或符号 ∗*∗(乘积)标记。第一步,删除其中一条边。随后每一步:选择一条边连接的两个顶点 V1V1V1 和 V2V2V2,用边上的运算符计算 V1V1V1 和 V2V2V2 得到的结果来替换这两个顶点。...原创 2018-09-26 17:25:11 · 265 阅读 · 0 评论 -
【题解】poj2279Mr. Young's Picture Permutations 杨氏矩阵
题目链接DescriptionMr. Young wishes to take a picture of his class. The students will stand in rows with each row no longer than the row behind it and the left ends of the rows aligned. For instance, 12...原创 2018-09-21 22:54:15 · 550 阅读 · 1 评论 -
【题解】poj3070 Fibonacci 矩阵乘法
题目链接DescriptionIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n ≥ 2. For example, the first ten terms of the Fibonacci sequence are:0, 1, 1, 2, 3, 5, 8, 13, 21...原创 2018-09-12 06:22:25 · 406 阅读 · 0 评论