02 2019 档案

摘要:Codeforces Round #542 [Alex Lopashev Thanks-Round] (Div. 2) 题目链接:https://codeforces.com/contest/1130 A. Be Positive 题意: 给出n个数,看是否正数的个数过半或者负数的个数过半。 题解: 阅读全文
posted @ 2019-02-25 18:59 heyuhhh 阅读(314) 评论(0) 推荐(0) 编辑
摘要:Codeforces Round #541 (Div. 2) 题目链接:https://codeforces.com/contest/1131 A. Sea Battle 题意: 给出两个矩形的宽和高,满足第一个矩形的左上顶点为(0,0),右下顶点为(w1,-h1);第二个矩形的坐下顶点为(0,0) 阅读全文
posted @ 2019-02-24 23:33 heyuhhh 阅读(239) 评论(0) 推荐(0) 编辑
摘要:F. Ivan and Burgers 题目链接:https://codeforces.com/contest/1100/problem/F 题意: 给出n个数,然后有多个询问,每次回答询问所给出的区间的异或和最大值。 题解: 考虑离线做法,先把所有的询问区间按照右端点进行排序,然后从1开始逐个将a 阅读全文
posted @ 2019-02-23 12:03 heyuhhh 阅读(169) 评论(0) 推荐(0) 编辑
摘要:2115: [Wc2011] Xor Time Limit: 10 Sec Memory Limit: 259 MBSubmit: 5714 Solved: 2420 题目链接:https://www.lydsy.com/JudgeOnline/problem.php?id=2115 Descrip 阅读全文
posted @ 2019-02-23 11:54 heyuhhh 阅读(149) 评论(0) 推荐(0) 编辑
摘要:2460: [BeiJing2011]元素 Time Limit: 20 Sec Memory Limit: 128 MBSubmit: 2910 Solved: 1535 题目链接:https://www.lydsy.com/JudgeOnline/problem.php?id=2460 Desc 阅读全文
posted @ 2019-02-23 11:46 heyuhhh 阅读(223) 评论(0) 推荐(0) 编辑
摘要:Prince and Princess Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2281 Accepted Submission(s): 阅读全文
posted @ 2019-02-23 11:32 heyuhhh 阅读(189) 评论(0) 推荐(0) 编辑
摘要:King's Quest 题目链接:http://poj.org/problem?id=1904 Description: Once upon a time there lived a king and he had N sons. And there were N beautiful girls 阅读全文
posted @ 2019-02-23 11:18 heyuhhh 阅读(187) 评论(0) 推荐(0) 编辑
摘要:Caocao's Bridges Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8476 Accepted Submission(s): 260 阅读全文
posted @ 2019-02-23 10:52 heyuhhh 阅读(162) 评论(0) 推荐(0) 编辑
摘要:Strongly connected Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4765 Accepted Submission(s): 1 阅读全文
posted @ 2019-02-20 21:49 heyuhhh 阅读(178) 评论(0) 推荐(0) 编辑
摘要:Codeforces Round #540 (Div. 3) 题目链接:https://codeforces.com/contest/1118 题目太多啦,解释题意都花很多时间...还有事情要做,就选一些题来写吧。 B. Tanya and Candies 题意: 在n个数中任意删去一个,如果这个数 阅读全文
posted @ 2019-02-20 20:56 heyuhhh 阅读(191) 评论(0) 推荐(0) 编辑
摘要:Educational Codeforces Round 60 (Rated for Div. 2) 题目链接:https://codeforces.com/contest/1117 A. Best Subsegment 题意: 给出n个数,选取一段区间[l,r],满足(al+...+ar)/(r- 阅读全文
posted @ 2019-02-20 20:23 heyuhhh 阅读(230) 评论(0) 推荐(0) 编辑
摘要:C. Enlarge GCD 题目链接:https://codeforces.com/contest/1047/problem/C 题意: 给出n个数,然后你可以移除一些数。现在要求你移除最少的数,让剩下数的gcd变大。 题解: 首先可以先让所有数都除以他们的gcd,让他们互质,好让问题简单化。 由 阅读全文
posted @ 2019-02-20 18:48 heyuhhh 阅读(117) 评论(0) 推荐(0) 编辑
摘要:1143: [CTSC2008]祭祀river 题目链接:https://www.lydsy.com/JudgeOnline/problem.php?id=1143 Description: 在遥远的东方,有一个神秘的民族,自称Y族。他们世代居住在水面上,奉龙王为神。每逢重大庆典, Y族都会在水面上 阅读全文
posted @ 2019-02-18 23:11 heyuhhh 阅读(137) 评论(0) 推荐(0) 编辑
摘要:A Simple Problem with Integers 题目链接:http://poj.org/problem?id=3468 Description: You have N integers, A1, A2, ... , AN. You need to deal with two kinds 阅读全文
posted @ 2019-02-18 22:59 heyuhhh 阅读(200) 评论(0) 推荐(0) 编辑
摘要:敌兵布阵 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 131926 Accepted Submission(s): 55150 题目链接:ht 阅读全文
posted @ 2019-02-18 22:53 heyuhhh 阅读(158) 评论(0) 推荐(0) 编辑
摘要:D. Nature Reserve 题目链接:https://codeforces.com/contest/1059/problem/D 题意: 在二维坐标平面上给出n个数的点,现在要求一个圆,能够容纳所有的点,并且与x轴相切的最小半径为多少。 题解: 容易知道圆的纵坐标的绝对值等于其半径,并且半径 阅读全文
posted @ 2019-02-18 22:47 heyuhhh 阅读(201) 评论(0) 推荐(0) 编辑
摘要:C. Sequence Transformation 题目链接:https://codeforces.com/contest/1059/problem/C 题意: 现在有1~n共n个数,然后执行下面操作: 1.求出余下数的gcd,然后将gcd加入答案队列; 2.从中任意删除一个数,如果余下数的个数大 阅读全文
posted @ 2019-02-18 22:39 heyuhhh 阅读(149) 评论(0) 推荐(0) 编辑
摘要:D. Sum in the tree 题目链接:https://codeforces.com/contest/1099/problem/D 题意: 给出一棵树,以及每个点的si,这里的si代表从i号结点到根节点的权值和。但是有些si=-1,这就相当于丢失了当前结点的数据。 假设原本每个点的权值为ai 阅读全文
posted @ 2019-02-18 22:21 heyuhhh 阅读(170) 评论(0) 推荐(0) 编辑
摘要:Warm up Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 9073 Accepted Submission(s): 2120 题目链接:h 阅读全文
posted @ 2019-02-17 23:43 heyuhhh 阅读(152) 评论(0) 推荐(0) 编辑
摘要:Redundant Paths 题目链接:http://poj.org/problem?id=3177 Description: In order to get from one of the F (1 <= F <= 5,000) grazing fields (which are numbere 阅读全文
posted @ 2019-02-17 23:38 heyuhhh 阅读(164) 评论(0) 推荐(0) 编辑
摘要:Network 题目链接:http://poj.org/problem?id=3694 Description: A network administrator manages a large network. The network consists of N computers and M li 阅读全文
posted @ 2019-02-17 23:17 heyuhhh 阅读(195) 评论(0) 推荐(0) 编辑
摘要:Critical Links 题目链接:https://vjudge.net/problem/UVA-796 Description: In a computer network a link L, which interconnects two servers, is considered cri 阅读全文
posted @ 2019-02-17 22:58 heyuhhh 阅读(217) 评论(0) 推荐(0) 编辑
摘要:Network 题目链接:https://vjudge.net/problem/UVA-315 Description: A Telephone Line Company (TLC) is establishing a new telephone cable network. They are co 阅读全文
posted @ 2019-02-17 22:51 heyuhhh 阅读(178) 评论(0) 推荐(0) 编辑
摘要:Network of Schools 题目链接:http://poj.org/problem?id=1236 Description: A number of schools are connected to a computer network. Agreements have been deve 阅读全文
posted @ 2019-02-17 22:32 heyuhhh 阅读(102) 评论(0) 推荐(0) 编辑
摘要:Highways 题目链接:https://vjudge.net/problem/SPOJ-HIGH Description: In some countries building highways takes a lot of time... Maybe that's because there 阅读全文
posted @ 2019-02-17 21:53 heyuhhh 阅读(166) 评论(0) 推荐(0) 编辑
摘要:Lightning Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2465 Accepted Submission(s): 912 题目链接:h 阅读全文
posted @ 2019-02-17 21:41 heyuhhh 阅读(192) 评论(0) 推荐(0) 编辑
摘要:Join 题目链接:https://vjudge.net/problem/URAL-1627 Description: Businessman Petya recently bought a new house. This house has one floor with n × m square 阅读全文
posted @ 2019-02-17 21:34 heyuhhh 阅读(214) 评论(0) 推荐(0) 编辑
摘要:Find The Determinant III 题目链接:https://vjudge.net/problem/SPOJ-DETER3 Description: Given a NxN matrix A, find the Determinant of A % P. Input: Multiple 阅读全文
posted @ 2019-02-17 21:29 heyuhhh 阅读(307) 评论(0) 推荐(0) 编辑
摘要:Organising the Organisation 题目链接:https://vjudge.net/problem/UVA-10766 Description: I am the chief of the Personnel Division of a moderate-sized compan 阅读全文
posted @ 2019-02-17 21:23 heyuhhh 阅读(191) 评论(0) 推荐(0) 编辑
摘要:Codeforces Round #539 (Div. 2) 题目链接:https://codeforces.com/contest/1113 A. Sasha and His Trip 题意: n个城市,城市分布在一条直线上且按升序排序,现在有个人开车从一号城市出发,车的油箱容量为v。 在每个城市 阅读全文
posted @ 2019-02-17 20:55 heyuhhh 阅读(171) 评论(0) 推荐(0) 编辑
摘要:Transfer water Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 6126 Accepted Submission(s): 2181 阅读全文
posted @ 2019-02-14 00:25 heyuhhh 阅读(249) 评论(0) 推荐(0) 编辑
摘要:Ice_cream’s world II Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6849 Accepted Submission(s): 阅读全文
posted @ 2019-02-14 00:17 heyuhhh 阅读(210) 评论(0) 推荐(0) 编辑
摘要:Teen Girl Squad Description: You are part of a group of n teenage girls armed with cellphones. You have some news you want to tell everyone in the gro 阅读全文
posted @ 2019-02-13 23:42 heyuhhh 阅读(457) 评论(0) 推荐(0) 编辑
摘要:Command Network 题目链接:http://poj.org/problem?id=3164 Description: After a long lasting war on words, a war on arms finally breaks out between littleken 阅读全文
posted @ 2019-02-13 23:11 heyuhhh 阅读(216) 评论(0) 推荐(0) 编辑
摘要:Is There A Second Way Left? Description: Nasa, being the most talented programmer of his time, can’t think things to be so simple. Recently all his ne 阅读全文
posted @ 2019-02-13 23:06 heyuhhh 阅读(277) 评论(0) 推荐(0) 编辑
摘要:ACM Contest and Blackout 题目链接:https://vjudge.net/problem/UVA-10600 Description: In order to prepare the “The First National ACM School Contest” (in 20 阅读全文
posted @ 2019-02-13 23:00 heyuhhh 阅读(149) 评论(0) 推荐(0) 编辑
摘要:Qin Shi Huang's National Road System Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10567 Accept 阅读全文
posted @ 2019-02-13 22:54 heyuhhh 阅读(193) 评论(0) 推荐(0) 编辑
摘要:还是畅通工程 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 63196 Accepted Submission(s): 28696 题目链接:h 阅读全文
posted @ 2019-02-13 22:33 heyuhhh 阅读(123) 评论(0) 推荐(0) 编辑
摘要:The Unique MST 题目链接:http://poj.org/problem?id=1679 Description: Given a connected undirected graph, tell if its minimum spanning tree is unique. Defin 阅读全文
posted @ 2019-02-13 22:30 heyuhhh 阅读(123) 评论(0) 推荐(0) 编辑
摘要:Borg Maze 题目链接:http://poj.org/problem?id=3026 Description: The Borg is an immensely powerful race of enhanced humanoids from the delta quadrant of the 阅读全文
posted @ 2019-02-13 22:25 heyuhhh 阅读(183) 评论(0) 推荐(0) 编辑
摘要:Arctic Network 题目链接:http://poj.org/problem?id=2349 Description: The Department of National Defence (DND) wishes to connect several northern outposts b 阅读全文
posted @ 2019-02-13 22:13 heyuhhh 阅读(250) 评论(0) 推荐(0) 编辑
摘要:QS Network 题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1586 Description: In the planet w-503 of galaxy cgb, there is a kind of i 阅读全文
posted @ 2019-02-13 22:02 heyuhhh 阅读(151) 评论(0) 推荐(0) 编辑
摘要:Codeforces Round #538 (Div. 2) 题目链接:https://codeforces.com/contest/1114 A. Got Any Grapes? 题意: 有三个人,有三种食物,食物对应的数量为a,b,c,三个人需要的食物量分别为x,y,z。 现在第一个人只吃第一种 阅读全文
posted @ 2019-02-11 14:07 heyuhhh 阅读(381) 评论(0) 推荐(0) 编辑
摘要:Codeforces Global Round 1 题目链接:https://codeforces.com/contest/1110 A. Parity 题意: 给出{ak},b,k,判断a1*b^(k-1)+a2*b^(k-2)+...+ak*b^0的奇偶性。 题解: 暴力求模2意义下的值就好了。 阅读全文
posted @ 2019-02-08 17:09 heyuhhh 阅读(380) 评论(0) 推荐(0) 编辑
摘要:D. Compression 题目链接:https://codeforces.com/contest/1107/problem/D 题意: 给出一个n*(n/4)的矩阵,这个矩阵原本是一些01矩阵,但是现在四个四个储存进二进制里面,现在给出的矩阵为0~9以及A~F,表示0~15。 然后问这个矩阵能否 阅读全文
posted @ 2019-02-05 14:50 heyuhhh 阅读(233) 评论(0) 推荐(0) 编辑
摘要:Codeforces Round #535 (Div. 3) 题目总链接:https://codeforces.com/contest/1108 太懒了啊~好久之前的我现在才更新,赶紧补上吧,不能漏掉了。 A. Two distinct points 题意: 给出两个区间的左右边界,输出两个数,满足 阅读全文
posted @ 2019-02-05 10:54 heyuhhh 阅读(232) 评论(0) 推荐(0) 编辑
摘要:D. Game with modulo 题目链接:https://codeforces.com/contest/1104/problem/D 题意: 这题是一个交互题,首先一开始会有一个数a,你最终的目的是要将它猜出来。 每次询问会输出"? x y",然后有: "x" (without quotes 阅读全文
posted @ 2019-02-05 09:58 heyuhhh 阅读(151) 评论(0) 推荐(0) 编辑
摘要:Frogger 题目链接:http://poj.org/problem?id=2253 Description: Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who 阅读全文
posted @ 2019-02-04 20:24 heyuhhh 阅读(96) 评论(0) 推荐(0) 编辑
摘要:Heavy Transportation 题目链接:http://poj.org/problem?id=1797 Description: Background Hugo Heavy is happy. After the breakdown of the Cargolifter project h 阅读全文
posted @ 2019-02-04 20:16 heyuhhh 阅读(130) 评论(0) 推荐(0) 编辑
摘要:Wormholes 题目链接:http://poj.org/problem?id=3259 Description: While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A 阅读全文
posted @ 2019-02-04 20:09 heyuhhh 阅读(128) 评论(0) 推荐(0) 编辑
摘要:Cow Contest 题目链接:http://poj.org/problem?id=3660 Description: N (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participating in a programming cont 阅读全文
posted @ 2019-02-04 20:03 heyuhhh 阅读(146) 评论(0) 推荐(0) 编辑
摘要:Arbitrage 题目链接:http://poj.org/problem?id=2240 Description: Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a 阅读全文
posted @ 2019-02-04 19:45 heyuhhh 阅读(239) 评论(0) 推荐(0) 编辑
摘要:Invitation Cards 题目链接:http://poj.org/problem?id=1511 Description: In the age of television, not many people attend theater performances. Antique Comed 阅读全文
posted @ 2019-02-04 19:16 heyuhhh 阅读(147) 评论(0) 推荐(0) 编辑
摘要:Candies 题目链接:http://poj.org/problem?id=3159 Description: During the kindergarten days, flymouse was the monitor of his class. Occasionally the head-te 阅读全文
posted @ 2019-02-04 18:34 heyuhhh 阅读(220) 评论(0) 推荐(0) 编辑
摘要:Subway 题目链接:http://poj.org/problem?id=2502 Description: You have just moved from a quiet Waterloo neighbourhood to a big, noisy city. Instead of getti 阅读全文
posted @ 2019-02-04 18:21 heyuhhh 阅读(168) 评论(0) 推荐(0) 编辑
摘要:昂贵的聘礼 题目链接:http://poj.org/problem?id=1062 Description: 年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币,便请求酋长降低要求。酋长说: 阅读全文
posted @ 2019-02-04 11:47 heyuhhh 阅读(121) 评论(0) 推荐(0) 编辑
摘要:Tram 题目链接:http://poj.org/problem?id=1847 Description: Tram network in Zagreb consists of a number of intersections and rails connecting some of them. 阅读全文
posted @ 2019-02-04 11:42 heyuhhh 阅读(129) 评论(0) 推荐(0) 编辑