- 博客(23)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 HDU 3072(强连通+缩点)
Intelligence SystemCrawling in process...Crawling failedTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u DescriptionAfter a day, ALPCs f
2015-08-31 21:08:46
740
原创 HDU 1827
HDU - 1827Summer HolidayTime Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64uTo see a World in a Grain of Sand And a Heaven in a
2015-08-28 10:53:22
685
原创 HDU 3836
HDU - 3836Equivalent SetsTime Limit: 4000MS Memory Limit: 104857KB 64bit IO Format: %I64d & %I64u DescriptionTo prove two sets A and B a
2015-08-28 10:22:51
677
原创 HDU 1269（Tarjan模板）
HDU - 1269迷宫城堡Time Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64u Description为了训练小希的方向感，Gardon建立了一座大城堡，里面有N个房间(N<=10
2015-08-27 11:33:21
358
原创 HDU 4474(神奇的BFS+强剪枝)
HDU - 4474Yet Another Multiple ProblemTime Limit: 20000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64u DescriptionThere are tons
2015-08-26 20:22:06
700
转载 kosaraju算法
#include#include#includeusing namespace std;bool map[100][100]; //记录图形的边bool visited[100]; //记录点是否是被访问过了。int dfn[100]; //记录点深度优先搜索的顺序int dotn; //记录点的个数void init() //初始
2015-08-24 16:27:56
470
原创 HDU 1068
HDU - 1068Girls and BoysTime Limit: 10000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64u Descriptionthe second year of the university some
2015-08-24 14:12:54
341
原创 POJ 1422 (最少路径覆盖)
Air RaidTime Limit: 1000MS Memory Limit: 10000KB 64bit IO Format: %I64d & %I64u DescriptionConsider a town where all the streets are one-way and eac
2015-08-24 12:45:32
587
原创 POJ 3041
AsteroidsTime Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64u DescriptionBessie wants to navigate her spaceship through a dangero
2015-08-21 20:07:06
480
原创 POJ 1469
COURSESTime Limit: 1000MS Memory Limit: 10000KB 64bit IO Format: %I64d & %I64uSubmitStatus DescriptionConsider a group of N students and P courses. Each stu
2015-08-21 19:21:00
336
原创 POJ 3281
DiningTime Limit: 2000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64u DescriptionCows are such finicky eaters. Each cow has a preference f
2015-08-21 18:33:01
481
原创 POJ 1459
A power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied with an amount s(u) >= 0 of power, may produce an amount 0 <=
2015-08-21 18:17:37
706
原创 POJ 2761(求区间第k小值)
Feed the dogsTime Limit: 6000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64uSubmitStatus DescriptionWind loves pretty dogs very much, and she has n pe
2015-08-20 16:43:21
955
原创 ZOJ 3201
Tree of TreeTime Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %lld & %lluDescriptionYou're given a tree with weights of each node, you need to find the ma
2015-08-20 00:11:29
1076
3
原创 POJ 1463
Strategic gameTime Limit: 2000MS Memory Limit: 10000KB 64bit IO Format: %I64d & %I64uDescriptionBob enjoys playing computer games, especially strategic games, but
2015-08-19 18:06:43
357
原创 POJ 2342
Anniversary partyTime Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64uDescriptionThere is going to be a party to celebrate the 80-th Anniversary
2015-08-19 17:20:58
568
原创 POJ 1273
Drainage DitchesTime Limit: 1000MS Memory Limit: 10000KB 64bit IO Format: %I64d & %I64uEvery time it rains on Farmer John's fields, a pond forms over Bessie's f
2015-08-19 11:36:22
465
原创 POJ 4014
ACM ICPC 2011–2012, NEERC, Northern Subregional Contest St Petersburg, October 29, 2011Problem D. DiceInput file: dice.inOutput file: dice.out Time limit: 3 seconds Memory limit: 256 m
2015-08-18 22:50:42
1120
原创 POJ 4012
题目链接：http://poj.org/problem?id=4012Problem B. Black Square Input file: black.in Output file: black.out Time limit: 3 secondsMemory limit: 256 megabytesInspired by Kazimir Malevic
2015-08-18 22:37:37
681
原创 POJ 4011
ACM ICPC 2011–2012, NEERC, Northern Subregional ContestSt Petersburg, October 29, 2011Problem A. Automated Telephone ExchangeInput file: ate.inOutput file: ate.outTime limit: 3 secondsMemo
2015-08-18 22:18:09
510
原创 Treap 模板
int ch[maxn][2],val[maxn],counts[maxn],r[maxn],size[maxn],root,tot;void newnode(int &rt,int v){ rt = ++tot; val[rt] = v; ch[rt][0] = ch[rt][1] = 0; size[rt] = counts[rt] = 1; r[
2015-08-17 12:16:26
482
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人