- 博客(630)
- 资源 (1)
- 收藏
- 关注
原创 Codeforces--670C--Cinema(STL map)
CinemaTime Limit: 2000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionMoscow is hosting a major international conference, whic
2016-05-10 13:51:48 864
原创 Codeforces--653D--Delivery Bears(二分+最大流)
Delivery BearsTime Limit: 2000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionNiwel is a little golden bear. As everyone knows
2016-05-09 22:05:42 1077
原创 hdoj--3046--Pleasant sheep and big big wolf(最小割经典)
Pleasant sheep and big big wolfTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2699 Accepted Submission(s): 1114Problem Descrip
2016-05-09 20:57:39 603
原创 poj--1815--Friendship(最小割点集)(枚举求最小字典序)
FriendshipTime Limit: 2000MS Memory Limit: 20000KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionIn modern society, each person has his own friends.
2016-05-09 19:59:14 896
原创 hdoj--3491--Thieves(最小割点集)
ThievesTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1535 Accepted Submission(s): 692Problem DescriptionIn the kingdom of H
2016-05-08 22:20:30 605
原创 hdoj--1530--Maximum Clique(最大团)
Maximum CliqueTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3658 Accepted Submission(s): 1962Problem DescriptionGiven a g
2016-05-08 20:36:16 267
原创 UESTC--1041--Hug the princess(位运算)
Hug the princessTime Limit: 1000MS Memory Limit: 65535KB 64bit IO Format: %lld & %lluSubmit StatusDescriptionThere is a sequence with n elements. Assuming
2016-05-08 16:19:25 476
原创 FZoj--2103--Bin & Jing in wonderland(概率)
Problem 2103 Bin & Jing in wonderlandAccept: 203 Submit: 1050Time Limit: 1000 mSec Memory Limit : 32768 KB Problem DescriptionBin has a d
2016-05-07 14:13:00 632 1
原创 Fzoj--2110--Stra(数学几何)
Problem 2110 StarAccept: 864 Submit: 2571Time Limit: 1000 mSec Memory Limit : 32768 KB Problem DescriptionOverpower often go t
2016-05-07 12:48:49 492
原创 hdoj--4289--Control(最小割拆点)
ControlTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2623 Accepted Submission(s): 1133Problem Description You, the head of
2016-05-04 22:40:56 351
原创 poj--3469--Dual Core CPU(最小割裸题)
Dual Core CPUTime Limit: 15000MS Memory Limit: 131072KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionAs more and more computers are equipped with d
2016-05-04 21:50:26 953
原创 福州oj--2233--~APTX4869(并查集)
Problem 2233 ~APTX4869Accept: 28 Submit: 65Time Limit: 1000 mSec Memory Limit : 32768 KB Problem Description为了帮助柯南回到一米七四,阿笠博士夜以继日
2016-05-04 20:27:39 459
原创 zzulioj--1842--LT的求助again and again(模拟||LIS)
1842: LT的求助again and againTime Limit: 1 Sec Memory Limit: 256 MBSubmit: 34 Solved: 31SubmitStatusWeb BoardDescription众所周知,我T哥打的一手好斗地主。这天LT正在101斗地主,突然WT说我来给你出道题吧(前面都是我编的)题目如
2016-05-03 22:28:00 305
原创 福州oj--2232--炉石传说(最大匹配||最大流)
Problem 2232 炉石传说Accept: 19 Submit: 49Time Limit: 1000 mSec Memory Limit : 32768 KB Problem DescriptionGG学长虽然并不打炉石传说,但是由于题面需要他便学
2016-05-03 18:59:54 561
原创 zoj--3878--Convert QWERTY to Dvorak(纯暴力)
Convert QWERTY to DvorakTime Limit: 2 Seconds Memory Limit: 65536 KBEdward, a poor copy typist, is a user of the Dvorak Layout. But now he has only a QWERTY Keyboard with a broken Cap
2016-05-03 17:13:31 404
原创 zoj--3872--Beauty of Array(思维)
Beauty of ArrayTime Limit: 2 Seconds Memory Limit: 65536 KBEdward has an array A with N integers. He defines the beauty of an array as the summation of all distinct integers in the ar
2016-05-02 12:40:58 321
原创 Codeforces--246D--Colorful Graph(STL set)
Colorful GraphTime Limit: 2000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionYou've got an undirected graph, consisting of n
2016-04-30 22:29:42 357
原创 lightOj--1261--K-SAT Problem(STL)
K-SAT ProblemTime Limit: 2000MS Memory Limit: 32768KB 64bit IO Format: %lld & %lluSubmit StatusDescriptionSAT was the first known NP-complete problem. The p
2016-04-30 21:26:04 382
原创 Lightoj--1338--Hidden Secret!(模拟)
Hidden Secret!Time Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %lld & %lluSubmit StatusDescriptionIn this problem you are given two names, you have
2016-04-30 21:04:21 598
原创 zzuoj--10459--Tutti!(最小费用拆点)
10459: Tutti!Time Limit: 10 Sec Memory Limit: 128 MBSubmit: 19 Solved: 5[Submit][Status][Web Board]Description因为Raywzy计划在清明节去爬泰山,所以他决定在去之前好好的锻炼一下身体,跑步是很好的办法!在zzu内,假设有N个房子,M条十
2016-04-27 22:09:02 320
原创 Codeforces--237C--Primes on Interval(二分水题)
Primes on IntervalTime Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionYou've decided to carry out a survey in the
2016-04-27 21:16:24 328
原创 Codeforces--237E--Build String(最小费用流)
Build StringTime Limit: 2000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionYou desperately need to build some string t. For t
2016-04-27 20:52:41 711
原创 Codeforces--237B--Young Table(模拟)
Young TableTime Limit: 2000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionYou've got table a, consisting of n rows, numbered
2016-04-27 19:44:03 323
原创 nyoj--115--城市平乱(最短路 反向)
城市平乱时间限制:1000 ms | 内存限制:65535 KB难度:4描述南将军统领着N个部队,这N个部队分别驻扎在N个不同的城市。他在用这N个部队维护着M个城市的治安,这M个城市分别编号从1到M。现在,小工军师告诉南将军,第K号城市发生了暴乱,南将军从各个部队都派遣了一个分队沿最近路去往暴乱城市平乱。现在已知在任意两个城市之间
2016-04-26 18:04:52 379
原创 nyoj--1238--最少换乘(最短路)
最少换乘时间限制:2000 ms | 内存限制:65535 KB难度:3描述 欧洲某城是一个著名的旅游胜地,每年都有成千上万的人前来观光旅行。Dr. Kong决定利用暑假好好游览一番。。年轻人旅游不怕辛苦,不怕劳累,只要费用低就行。但Dr. Kong年过半百,他希望乘坐BUS从住的宾馆到想去游览的景点,期间尽可量地少换乘车。 Dr
2016-04-26 16:11:05 464
原创 zoj--3946--Highway Project(SPFA)
Highway ProjectTime Limit: 2 Seconds Memory Limit: 65536 KB Edward, the emperor of the Marjar Empire, wants to build some bidirectional highways so that he can reach other cities from t
2016-04-25 21:45:29 339
转载 生成树计数--矩阵树定理(Matrix-Tree定理)
在信息学竞赛中,有关生成树的最优化问题如最小生成树等是我们经常遇到的,而对生成树的计数及其相关问题则少有涉及。事实上,生成树的计数是十分有意义的,在许多方面都有着广泛的应用。本文从一道信息学竞赛中出现的例题谈起,首先介绍了一种指数级的动态规划算法,然后介绍了行列式的基本概念、性质,并在此基础上引入Matrix-Tree定理,同时通过与一道数学问题的对比,揭示了该定理所包含的数学思想。最后通过几道例
2016-04-24 21:49:35 1987
原创 Codeforces--645C--Enduring Exodus(二分)
Enduring ExodusTime Limit: 2000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionIn an attempt to escape the Mischievous Mess Makers
2016-04-22 15:50:19 345
原创 hdoj--5025--Saving Tang Monk(bfs三维标记)
Saving Tang MonkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1975 Accepted Submission(s): 705Problem Description《Journey t
2016-04-22 15:15:27 551
原创 Codeforces--554C--Kyoya and Colored Balls(组合数学)
Kyoya and Colored BallsTime Limit: 2000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionKyoya Ootori has a bag with n colored balls
2016-04-21 15:56:15 387
原创 LightOJ--1076--Get the Containers(二分好题)
Get the ContainersTime Limit: 2000MSMemory Limit: 32768KB64bit IO Format: %lld & %lluSubmit StatusDescriptionA conveyor belt has a number of vessels of different capaci
2016-04-20 19:41:39 635
原创 hihoCoder--1268--九宫(全排列)
#1268 : 九宫时间限制:10000ms单点时限:1000ms内存限制:256MB描述小Hi最近在教邻居家的小朋友小学奥数,而最近正好讲述到了三阶幻方这个部分,三阶幻方指的是将1~9不重复的填入一个3*3的矩阵当中,使得每一行、每一列和每一条对角线的和都是相同的。三阶幻方又被称作九宫格,在小学奥数里有一句非常有名的口诀:“二四为肩
2016-04-19 19:37:02 692
原创 zoj--3935--2016(暴力模拟)(数学)
2016Time Limit: 2 Seconds Memory Limit: 65536 KBIn mathematics, a polygonal number is a number represented as dots or pebbles arranged in the shape of a regular polygon. The dots are thou
2016-04-19 18:00:10 446
原创 Codeforces--333C--The Two Routes(最短路弗洛伊德)(思维)
The Two RoutesTime Limit: 2000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionIn Absurdistan, there are n towns (numbered 1 throug
2016-04-19 17:29:38 571
原创 zzulioj--1874--蛤玮学计网(模拟)
1874: 蛤玮学计网Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 857 Solved: 121SubmitStatusWeb BoardDescription蛤玮最近学习了关于ip的知识,于是他迫不及待的想把新知识传授给她的妹子.蛤玮的妹子随便写下了一个字符串,蛤玮现在要告诉她这个字符串是不是一个合法的ip地
2016-04-19 16:04:19 286
原创 zoj--3932--Handshakes(水题)
HandshakesTime Limit: 2 Seconds Memory Limit: 65536 KBLast week, n students participated in the annual programming contest of Marjar University. Students are labeled from 1 to n. They cam
2016-04-19 15:50:29 360
原创 LightOJ--1049--One Way Roads(dfs)(好题)
One Way RoadsTime Limit: 500MSMemory Limit: 32768KB64bit IO Format: %lld & %lluSubmit StatusDescriptionNowadays the one-way traffic is introduced all over the world in
2016-04-19 15:33:32 783
原创 “玲珑杯”郑州轻工业学院第八届ACM程序设计大赛暨河南高校邀请赛-正式赛心得体会
这是继蓝桥杯之后第二次出去比赛,蓝桥杯已经跪了,这次比赛也是没什么信心的,头一天晚上室友打LOL声音好大,真是一点都不友爱啊,友谊的小船还怎么平稳的航行,说了好久总算是在1点的时候平静下来了,第二天六点二十就起了,毕竟每天早上都要洗头,,,没有昏昏沉沉,也没有那么精神,洗完之后去找猛辉,,,,早上六点多啊,六点多啊,还在整理模板,说是到郑轻还要打印,我们三个加起来都已经七百多页了,,,,还要打印,
2016-04-18 17:35:40 927
原创 hdoj--1881--毕业bg(dfs)
毕业bgTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5406 Accepted Submission(s): 2008Problem Description每年毕业的季节都会有大量毕业生发起狂欢,好
2016-04-16 10:08:36 305
原创 hdoj--1794--方格填数(规律)
方格填数Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 628 Accepted Submission(s): 168Problem Description 给你一个N*N的方格,里面都是非负整数(小
2016-04-15 21:36:07 764
jsr173_1.0_api.jar rasolver.jar xbean.jar xbean_xpath.jar xmlbeans-qname.jar
2017-05-22
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人