- 博客(11)
- 资源 (1)
- 收藏
- 关注
原创 Mahmoud and a Dictionary CodeForces - 766D
Mahmoud wants to write a new dictionary that contains n words and relations between them. There are two types of relations: synonymy (i. e. the two words mean the same) and antonymy (i. e. the two word
2017-10-30 21:59:58 436
原创 poj 3177 Redundant Paths
DescriptionIn order to get from one of the F (1 <= F <= 5,000) grazing fields (which are numbered 1..F) to another field, Bessie and the rest of the herd are forced to cross near the Tree of Rotten App
2017-10-30 21:57:32 163
原创 hdu4738
Caocao’s BridgesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5560 Accepted Submission(s): 1745Problem Description Caocao was defeated by
2017-10-29 11:27:58 383
原创 poj2942
Knights of the Round Table Time Limit: 7000MS Memory Limit: 65536K Total Submissions: 13670 Accepted: 4583 DescriptionBeing a knight is a very attractive career: searching for the Holy G
2017-10-28 22:10:45 270
原创 poj 2117
Electricity Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 5701 Accepted: 1864 DescriptionBlackouts and Dark Nights (also known as ACM++) is a company that provides electricity.
2017-10-27 21:55:28 502
原创 24点游戏
以下的这一篇文章不考虑精度的。。 考虑精度的需要列出所有的情况搜索。。没有写。。问你是否通过加减乘除括号构成24点。第一行t,表示有多少组测试数据,1<=t<=50 接下来t行,每行4个数字,表示每个数都是多少,1<=a[i]<=13 Output对于每一次询问,如果能够凑成24点,输出yes,否则输出no Sample Input2 3 3 8 8 1 1 1 1 Sample Ou
2017-10-25 20:40:38 391
原创 dfs CodeForces - 764C
Each New Year Timofey and his friends cut down a tree of n vertices and bring it home. After that they paint all the n its vertices, so that the i-th vertex gets color ci.Now it’s time for Timofey birt
2017-10-25 20:36:17 237
原创 km算法模板 hdu2255
这篇博客讲的很好http://www.cnblogs.com/wenruo/p/5264235.html#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int maxn=1100;const int inf=0x3f3f3f3f;int g[m
2017-10-17 10:44:03 343
原创 lca 离线tarjan模板
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int maxn=10101;const int qmaxn=501010;int F[maxn];int find(int x){ if(F[x]==-1)return x;
2017-10-14 20:37:10 337
原创 hdu 1269 tarjan算法模板
#include<iostream>#include<stack>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int maxn=110000;struct node{ int v,next;}edge[maxn*3];int cnt=0,n,m,ans,top,
2017-10-13 21:54:46 325
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人