08 2015 档案
摘要:最近碰到的题不是水题就是坑题,实在没意思,听说神犇们都在Topcoder上刷SRM,于是我决定将SRM的DIV 1刷个遍。这里是目录哎。。好多转博客不注明出处的,这里给出本博客的出处:http://www.cnblogs.com/HarryGuo2012/p/4771117.htmlTopcoder...
阅读全文
摘要:原题链接:http://poj.org/problem?id=3660Cow ContestTime Limit:1000MSMemory Limit:65536KTotal Submissions:8395Accepted:4734DescriptionN(1 ≤N≤ 100) cows, con...
阅读全文
摘要:原题链接:http://poj.org/problem?id=3259题意有个很厉害的农民,它可以穿越虫洞去他的农场,当然他也可以通过道路,虫洞都是单向的,道路都是双向的,道路会花时间,虫洞会倒退时间,问你这个农民可不可以回到起点,并且在他出发的时间之前。题解就虫洞用负边链接,然后判断是否有负环即可...
阅读全文
摘要:原题链接:http://poj.org/problem?id=1860Currency ExchangeTime Limit:1000MSMemory Limit:30000KTotal Submissions:23055Accepted:8328DescriptionSeveral currenc...
阅读全文
摘要:原题链接:http://codeforces.com/contest/572/problem/D题意给你个数组A和n,k,问你排列A后,下面的最小值是多少。题解先排个序,要填充像1,1+k,1+2k,1+3k....这样的序列,或像2,2+k,2+2k.......这样的序列,这些序列应该取排序数组...
阅读全文
摘要:原题链接:http://codeforces.com/contest/572/problem/B题意很迷,自行看题。题解看懂题就会做了代码#include#include#include#define MAX_N 100005using namespace std;int n,s;struct ex...
阅读全文
摘要:题目链接:http://codeforces.com/contest/572/problem/A题意就给你两个数组,问你能不能从A数组中取出k个,B数组中取出m个,使得这k个都大于这m个。题解就模拟代码#include#include#include#define MAX_N 100005using...
阅读全文
摘要:原题链接:http://codeforces.com/gym/100733/problem/I题意有两颗树(只是树,不是数据结构),每棵树上有不同高度的树枝,然后有m只猴子在某棵树的前m高的树枝上睡觉。早上的时候,他们要到地上,但他们只能从一棵树上跳到另一棵树上,并且跳的高度差也有限制,每个树枝仅能...
阅读全文
摘要:原题链接:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2031题意给你一个有向图,问你定义一个环的平均值为这个环上所有边的平均值,问你最小的环的平均值是...
阅读全文
摘要:原题链接:http://codeforces.com/gym/100338/attachments/download/2136/20062007-winter-petrozavodsk-camp-andrew-stankevich-contest-22-asc-22-en.pdf题意给你n个点,让你...
阅读全文
摘要:原题链接:http://codeforces.com/gym/100338/attachments/download/2136/20062007-winter-petrozavodsk-camp-andrew-stankevich-contest-22-asc-22-en.pdf题意给你一个无向图,...
阅读全文
摘要:原题链接:http://codeforces.com/gym/100338/attachments/download/2136/20062007-winter-petrozavodsk-camp-andrew-stankevich-contest-22-asc-22-en.pdf题意这是一个过滤垃圾...
阅读全文
摘要:原题链接:http://poj.org/problem?id=3268Silver Cow PartyTime Limit:2000MSMemory Limit:65536KTotal Submissions:15545Accepted:7053DescriptionOne cow from eac...
阅读全文
摘要:原题链接:http://poj.org/problem?id=1797Heavy TransportationTime Limit:3000MSMemory Limit:30000KTotal Submissions:24576Accepted:6510DescriptionBackgroundHu...
阅读全文
摘要:原题链接:http://acm.hdu.edu.cn/showproblem.php?pid=4349Xiao Ming's HopeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Tota...
阅读全文
摘要:原题链接:http://poj.org/problem?id=2253FroggerTime Limit:1000MSMemory Limit:65536KTotal Submissions:30637Accepted:9883DescriptionFreddy Frog is sitting on...
阅读全文
摘要:原题链接:http://codeforces.com/gym/100650/attachments/download/3269/20052006-acmicpc-east-central-north-america-regional-contest-ecna-2005-en.pdf题意给你个棋盘,棋...
阅读全文
摘要:原题链接:http://codeforces.com/gym/100650/attachments/download/3269/20052006-acmicpc-east-central-north-america-regional-contest-ecna-2005-en.pdf题意玩过这个游戏的...
阅读全文
摘要:大家好,我是一名ACMer,大家可以称呼我Harry,我的邮箱是Harry.Guo@outlook.com,我希望能和各种各样的人多多交流。多年前因好奇接触NOIP,从而走进了算法的世界,但现在还是个鶸。喜欢二次元和鬼畜(自己不会做),喜欢弄些看似很厉害(其实很基础)的理论。我总觉得人有无限的可...
阅读全文
摘要:原题链接:http://codeforces.com/gym/100431/attachments/download/2421/20092010-winter-petrozavodsk-camp-andrew-stankevich-contest-37-asc-37-en.pdf题意给你一个n,问你...
阅读全文
摘要:原题链接:http://codeforces.com/gym/100431/attachments/download/2421/20092010-winter-petrozavodsk-camp-andrew-stankevich-contest-37-asc-37-en.pdf题意神奇的电路可以通...
阅读全文
摘要:原题链接:http://codeforces.com/gym/100431/attachments/download/2421/20092010-winter-petrozavodsk-camp-andrew-stankevich-contest-37-asc-37-en.pdf题意给你一个n,让你...
阅读全文
摘要:原题链接:http://acm.hdu.edu.cn/showproblem.php?pid=3605EscapeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submissi...
阅读全文
摘要:原题链接:http://acm.hdu.edu.cn/showproblem.php?pid=1045Fire NetTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submis...
阅读全文
摘要:原题链接:http://codeforces.com/gym/100203/attachments/download/1702/statements.pdf题解首先寻找每个I,然后枚举形状,如果匹配的话,就将源点连一条边到当前匹配的W,再从W连条边到I,I需要拆点,然后将拆点后面的那个点连接到N,从...
阅读全文
摘要:原题链接:http://codeforces.com/gym/100203/attachments/download/1702/statements.pdf题解给你平面上若干点,生成一颗完全图,让你生成一颗最小生成树。模板题。图中已经有了的边要将权值置0。代码是队友写的。代码#include #in...
阅读全文
摘要:原题链接:http://codeforces.com/gym/100203/attachments/download/1702/statements.pdf题解考虑暴力的复杂度是O(n^3),所以我们需要记录所有的ai+aj,如果当前考虑到了ak,那么就去前面寻找ai,使得ak-ai是我们记录过的和...
阅读全文
摘要:原题链接:http://codeforces.com/gym/100203/attachments/download/1702/statements.pdf题解考虑到交换可以减少一次操作,那么可以的话就尽量交换,设问号的个数是z,上面是1下面是0的个数是x,反过来的是y,那么最后的答案就是z+min...
阅读全文
摘要:原题链接:http://codeforces.com/gym/100523/attachments/download/2798/20142015-ct-s02e07-codeforces-trainings-season-2-episode-7-en.pdf题意给你一堆三维点,问你他们是否共面题解模...
阅读全文
摘要:什么是输入挂?众所周知scanf比cin快的多,那么有没有比scanf更快的东西呢?答案就是输入挂,输入挂利用了告诉读取的函数getchar(),然后再人工处理成整数或浮点,比使用scanf快太多。什么时候用输入挂?当输入规模达到1×10^6次方的时候,就需要输入挂,否则很有可能超时。代码代码不是我...
阅读全文
摘要:突然想写个系列,算是总结总结集训中遇到的各种黑科技吧,这是目录ACM的奇计淫巧_输入挂ACM的奇计淫巧_扩栈C++/G++ACM的奇计淫巧_bitset优化
阅读全文
摘要:原题链接:http://acm.timus.ru/problem.aspx?space=1&num=17801780. Gray CodeTime limit: 0.5 secondMemory limit: 64 MBDenis, Vanya and Fedya gathered at their...
阅读全文
摘要:题目链接:http://acm.timus.ru/problem.aspx?space=1&num=17741774. Barber of the Army of MagesTime limit: 0.5 secondMemory limit: 64 MBPetr, elected as a war...
阅读全文
摘要:G. Suggested Friendstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarpus works as a progra...
阅读全文
摘要:原题链接:http://acm.hdu.edu.cn/showproblem.php?pid=4587TWO NODESTime Limit: 24000/12000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Sub...
阅读全文
摘要:C++#pragma comment(linker, "/STACK:102400000,102400000")G++ int size = 256 << 20; // 256MB char *p = (char*)malloc(size) + size; __asm__("m...
阅读全文
摘要:How far away ?Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8712Accepted Submission(s): 3047Prob...
阅读全文
摘要:NetworkTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1014Accepted Submission(s): 206Problem Des...
阅读全文
摘要:题目地址:http://acm.hdu.edu.cn/showproblem.php?pid=3836Equivalent SetsTime Limit: 12000/4000 MS (Java/Others)Memory Limit: 104857/104857 K (Java/Others)To...
阅读全文
摘要:原题地址:http://codeforces.com/gym/100286/attachments/download/2013/20082009-acmicpc-northeastern-european-regional-contest-neerc-08-en.pdf此题题意是给你一个单对单密文,...
阅读全文
摘要:原题地址:http://codeforces.com/gym/100286/attachments/download/2013/20082009-acmicpc-northeastern-european-regional-contest-neerc-08-en.pdf题意大概就是让你把写在一块的变...
阅读全文
摘要:什么是bitsetbitset 是STL库中的二进制容器,根据C++ reference 的说法,bitset可以看作bool数组,但优化了空间复杂度和时间复杂度,并且可以像整形一样按位与或。使用方法申明bitset的申明要指明长度bitset bi这样就申明了一个长度为length的名叫bi的bi...
阅读全文
摘要:Harry Potter has n mixtures in front of him, arranged in a row. Each mixture has one of 100 different colors (colors have numbers from 0 to 99).He wan...
阅读全文
摘要:CardsTime Limit: 20 SecMemory Limit: 256 MB题目连接http://acm.hust.edu.cn/vjudge/contest/view.action?cid=86686#problem/KDescriptionYou haveNcards with dif...
阅读全文

浙公网安备 33010602011771号