- 博客(38)
- 资源 (8)
- 收藏
- 关注
原创 Coedforces 387 C. George and Number
从后向前能分就分C. George and Numbertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputGeorge is a cat,
2014-01-31 12:27:02 1952
原创 SRM 606 DIV2 1000 EllysCandyGame
暴力dfs,怎么看都是要超时的居然还能过系统测试。。。。。看来TC的电脑比我的好太多了。。。。Problem Statement Elly and Kris play the following game. In the beginning there are several boxes aligned in a row. The boxes ma
2014-01-30 15:51:53 1474
原创 SRM 606 div2 500 EllysNumberGuessing
猜数字。。。判断什么时候是lied情况挺多,写的很麻烦。。。Problem Statement Elly and Kris play the following game. In the beginning Kristina thinks of a number between 1 and 1,000,000,000, inclusive. After
2014-01-30 14:03:12 1551
原创 HDOJ 3308 LCIS
LCISTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3392 Accepted Submission(s): 1510Problem DescriptionGiven n integers.Yo
2014-01-28 22:52:29 1278
原创 POJ 1177 Picture
扫描线+线段树=矩形面积并和求周长并差不多,线段树节点维护覆盖长度,线段分段数,是否覆盖,左右端点是否覆盖(判断线段分段数用 right.num+left.num-left.rb*right.lb)。一次扫描直接求出周长。。。(当然也可以求一遍x边长,再求一遍y边长。。。。这样简单的多)线段排序时要注意Y相同时让左边的边在前,这样就解决重边问题了Picture
2014-01-27 17:36:11 1439
原创 HDOJ 1542 Atlantis
扫描线+线段树 求矩形面积并AtlantisTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5753 Accepted Submission(s): 2528Problem Descript
2014-01-26 11:48:08 1473
原创 Codeforces 385 C. Bear and Prime Numbers
把求和混到求素数里就快多了。。。。C. Bear and Prime Numberstime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputRecent
2014-01-25 03:00:26 2518
原创 tarjan求桥及割点
/*求割点,去掉割点连通块的个数求桥*/const int maxV=10010,maxE=100010;struct Edge{ int to,next; bool cut;}edge[maxE];int Adj[maxV],Size;void init(){ Size=0; memset(Adj,-1,sizeof(Adj));}
2014-01-23 21:43:12 1497
原创 UVA 796 Critical Links
tarjan求桥Critical LinksTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] Description C
2014-01-23 21:11:47 1769
原创 POJ 1144 Network
Tarjan求割点数NetworkTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 8440 Accepted: 3950DescriptionA Telephone Line Company (TLC) is establish
2014-01-23 13:52:30 1517
原创 POJ 2186 Popular Cows
抽象成:在一个有向图中,找所有的点都可以到达的点的个数根据题意结果必在一个强连通分量里(所有的答案之间肯定互相能到达)。用tarjan找出所有的连通分量,如果某个连通分量里有连到外面的边,则这个分量肯定不会是答案(分量图是有向的无环图,从分量1里连线到分量2中的边,分量2肯定没有变连回分量1,也就是1到达了2但是2不能到达1)。如果没有向外连边的连通分量不是1个就没有答案。
2014-01-22 22:34:32 1143
原创 强连通分量个数的tarjan算法
/* 强连通分量个数tarjan算法*/#include #include #include #include using namespace std;const int maxV=1000,maxE=1000000;struct Edge{ int to,next;}edge[maxE];int Adj[maxV],Size;void ini
2014-01-22 19:58:25 1477
原创 POJ 1523 SPF
找割点和去掉割点产生的连通块数。。。。。SPFTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5367 Accepted: 2476DescriptionConsider the two networks shown below
2014-01-22 17:38:53 1227
原创 HDOJ 1269 迷宫城堡
tarjan。。。。。迷宫城堡Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5854 Accepted Submission(s): 2572Problem Description为了训练
2014-01-22 00:05:15 1879
原创 POJ 1258 Agri-Net
kruscalAgri-NetTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 35233 Accepted: 14160DescriptionFarmer John has been elected mayor of his t
2014-01-21 16:20:55 958
原创 POJ 2485 Highways
prim最小生成树里的最长边HighwaysTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 19843 Accepted: 9201DescriptionThe island nation of Flatopia is
2014-01-21 15:54:53 1218
原创 Codeforces 383 A. Milking cows
A. Milking cowstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIahub helps his grandfather at the farm. Tod
2014-01-21 14:14:18 1391
原创 POJ 2240 Arbitrage
bellmanford最长路判正环ArbitrageTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13947 Accepted: 5876DescriptionArbitrage is the use of discrepancies i
2014-01-20 12:39:02 1122
原创 POJ 1125 Stockbroker Grapevine
枚举每个起始点的最短路。。。Stockbroker GrapevineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 24657 Accepted: 13579DescriptionStockbrokers are known
2014-01-19 22:13:12 1062
原创 POJ 2253 Frogger
Floyd。。。。FroggerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 22920 Accepted: 7448DescriptionFreddy Frog is sitting on a stone in the middle o
2014-01-19 17:24:15 1045
原创 POJ 1062 昂贵的聘礼
非常老的题目了,枚举层次dijkstra,G++AC昂贵的聘礼Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 33747 Accepted: 9652Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是
2014-01-19 14:44:29 937
原创 Codeforces 382 B. Number Busters
B. Number Busterstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputArthur and Alexander are number busters. T
2014-01-18 21:27:21 1708
原创 Codeforces 382 C. Arithmetic Progression
先由小到大排序1:只有一个数 无限多2:存在3种以上的间距 无3:出现2种间距大的间距只有1个,且长度是小的两倍 1种大的间距有几个 无4:只有1种间距只出现一次 一头一尾 或者 加上中间**仅有的间距是0 1种C. Arithmetic Progressiontime limit per test1
2014-01-18 02:00:27 2206
原创 POJ 3259 Wormholes
spfa找负环。。。。B - WormholesTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusAppoint description: System Crawler (2013-11-26)Descri
2014-01-17 19:43:13 982
原创 POJ 1860 Currency Exchange
bellman_ford判断正环A - Currency ExchangeTime Limit:1000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64uSubmit StatusAppoint description: System Crawler (2013-10-
2014-01-17 14:58:43 1010
原创 UVA 11624 Fire!
混合的BFS。。。Fire!Time Limit: 1000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] DescriptionProblem B: Fire
2014-01-16 17:54:05 1128
原创 Codeforces 380 C. Sereja and Brackets
树状数组求区间内范围个数。。。。C. Sereja and Bracketstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSereja has
2014-01-16 14:26:59 1640
原创 POJ 3415 Common Substrings
题意很简单,找两个串长度大于等于k的公共子串数;需要用单调队列来优化,用两次分别统计 A串与在A前面的B串的公共子串数 和 B串与在B前面的A串的公共子串数过程大概是每入栈一个元素结果都加上一个tot,然后就是维护这个tot。。。如果入栈的元素比栈顶的大,那tot就加上h [ i ] - k + 1,否则,就要维护栈单调递增的性质,把前面比它height值大的元素去
2014-01-15 15:43:14 1173
原创 POJ 3250 Bad Hair Day
顺手写个单调队列。。。。Bad Hair DayTime Limit: 2000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64u[Submit] [Go Back] [Status] DescriptionSome
2014-01-13 23:26:33 1278
原创 Codeforces 380 A. Sereja and Prefixes
用longlong才能A。。。。。。害我TLE了半天。。。。用一个结构体记录,操作改变的区间范围 [ c1 , c2 ] , v ,youxiao 注意c1==c2时,并不一定表示一个有效的值所以需要一个标记。。。。当这个区间表示一个有效的值时,v表示有效值。。。。。否则v表示重复了多少次(用来递推)A. Sereja and Prefix
2014-01-13 17:01:41 1792 1
原创 USACO Arithmetic Progressions
Arithmetic ProgressionsAn arithmetic progression is a sequence of the form a, a+b, a+2b, ..., a+nb where n=0,1,2,3,... . For this problem, a is a non-negative integer and b is a positive integer
2014-01-12 09:04:11 1723
原创 USACO Mother's Milk
Mother's MilkFarmer John has three milking buckets of capacity A, B, and C liters. Each of the numbers A, B, and C is an integer from 1 through 20, inclusive. Initially, buckets A and B are empt
2014-01-08 15:04:01 1198
原创 USACO The Clocks
操作间没有次序关系,同一个操作最多重复3次。。。可以直接暴力。。。The ClocksIOI'94 - Day 2Consider nine clocks arranged in a 3x3 array thusly:|-------| |-------| |-------| | | | | | | |
2014-01-06 23:44:02 1269
原创 CodeForces 379 D. New Year Letter
枚举开头结尾的字母,枚举ac的个数,就两个Fibonacci数列的和。。。。。D. New Year Lettertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard ou
2014-01-06 10:21:11 1461
原创 用SSH连接SSH连接nitrous.io
1:先下载Bitvise SSH2:打开 keypair manager3:这样 4:点击export 选择OpenSSH 保存好公钥 5:随便起个名字,把刚才得到的公钥加进去 6:打开SSH的客户端: 把东西对着填进去 然后就可以登录了
2014-01-02 19:34:38 2841 1
原创 USACO Prime Cryptarithm
Prime CryptarithmThe following cryptarithm is a multiplication problem that can be solved by substituting digits from a specified set of N digits into the positions marked with *. If the set of
2014-01-02 14:51:45 1050
原创 USACO Calf Flac
没看清输入输出方式,一个简单的manacher都错了好几次。。。。Calf FlacIt is said that if you give an infinite number of cows an infinite number of heavy-duty laptops (with very large keys), that they will ultimately pr
2014-01-01 22:48:16 1168
原创 CodeForces 377 B. Preparing for the Contest
2014年第一发。。。。二分查找最短时间+贪心找可以满足条件的要加最便宜的人B. Preparing for the Contesttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutput
2014-01-01 17:58:29 1552
ManicTime Professional v2.5.2.1 简体中文破解版
2014-05-01
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人