2017年04月_UMR小豪

转载 HDU 5236 Article

ArticleTime Limit: 20 Sec Memory Limit: 256 MB题目连接http://acm.hdu.edu.cn/showproblem.php?pid=5236DescriptionAs the term is going to end, DRD begins to write his final a

2017-04-29 17:31:25 315

转载 Gym - 100502 A - Amanda Lounges

题目链接：https://odzkskevi.qnssl.com/7bdafb89605bd39aff640413e2d2157a?v=1488601228。题意：大意就是有n个飞机场，每个飞机场可能有个休息室，然后给你m组关系，每组关系有3个数x，y，z，表示若z=0，表示x、y飞机场都没有休息室。若z=1，表示x、y其中有一个有休息室，若z=2，表示两个都有休息室。问总共最少有几个休息

2017-04-28 22:07:03 470

原创 The Shortest Path in Nya Graph

The Shortest Path in Nya GraphTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6215 Accepted Submission(s): 1390Problem Descriptio

2017-04-28 19:23:10 464

原创 1202: GCD

DescriptionInput The first line is an positive integer T . (1<=T<= 10^3) indicates the number of test cases. In the next T lines, there are three positive integer n, m, p (1<= n,m,p<=

2017-04-25 16:16:18 390

原创 B. Igor and his way to work

B. Igor and his way to worktime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWoken up by the alarm clock Igo

2017-04-24 21:01:48 646

原创 C. Mike and gcd problem

C. Mike and gcd problemtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMike has a sequence A = [a1, a2, ..

2017-04-22 21:00:27 682

原创 B. Mike and strings

B. Mike and stringstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMike has n strings s1, s2, ..., sn each

2017-04-22 20:31:26 713

原创 C. Voltage Keepsake

C. Voltage Keepsaketime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have n devices that you want to use

2017-04-17 16:28:59 563 1

原创 poj1248 Primitive Roots

Primitive RootsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4267 Accepted: 2501DescriptionWe say that integer x, 0 i mod p) | 1 <= i <= p-1 } is eq

2017-04-08 10:51:23 341

原创 poj2431Expedition

ExpeditionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15341 Accepted: 4302DescriptionA group of cows grabbed a truck and ventured on an expedition

2017-04-07 21:46:40 374

原创 poj2559 Largest Rectangle in a Histogram

Largest Rectangle in a HistogramTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 21468 Accepted: 6912DescriptionA histogram is a polygon composed of a

2017-04-07 20:19:42 285

原创 poj1631 Bridging signals

Bridging signalsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 14087 Accepted: 7619Description'Oh no, they've done it again', cries the chief designe

2017-04-07 19:18:18 264

原创 poj 2155 Matrix（二维树状数组）

MatrixTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 26929 Accepted: 9867DescriptionGiven an N*N matrix A, whose elements are either 0 or 1. A[i, j]

2017-04-06 22:11:59 302

转载一维与二维树状数组

树状数组总结：假设c[]为树状数组，a[]为原数组，则两者之间存在这么一个关系，c[i]代表的意义是从a[i]开始往前2^k个元素的和(k为i化成二进制后尾部包含的0的个数)，举例来说就是：(括号后面的数字代表几进制)c[1] = a[1]( (1)10 -> (1)2 -> k=0 )c[2] = a[1] + a[2]( (2)10 -> (10)2 -> k=1 )c[3]

2017-04-06 21:20:42 270

转载二维树状数组

当要频繁的对数组元素进行修改,同时又要频繁的查询数组内任一区间元素之和的时候,可以考虑使用树状数组. 通常对一维数组最直接的算法可以在O(1)时间内完成一次修改,但是需要O(n)时间来进行一次查询.而树状数组的修改和查询均可在O(log(n))的时间内完成. 一、回顾一维树状数组假设一维数组为A[i](i=1,2,...n),则与它对应的树状数组C[i](i=1,2,..

2017-04-06 19:03:45 285

原创珈百璃堕落题解

珈百璃的堕落题解。你们是不是一开始看到这道题的第一反应就是取模一下，然后用233减去啊。特判一下0跟负数。不过我是没点明n的范围的，毕竟是愚人节嘛~数据上n的范围长度是有100000位的。这时候思路其实是一样的，只不过是用到了大数取模。一个大数的组成可以是这样的：比如说是123466789其实就是0*10+1=1；1*10+2=12；12*10+3=

2017-04-04 22:16:54 959

樱花满地集于我心，楪舞纷飞祈愿相随