摘要： Ikki's Story IV - Panda's TrickTime Limit:1000MSMemory Limit:131072KTotal Submissions:6914Accepted:2565Descriptionliympanda, one of Ikki’s friend, likes playing games with Ikki. Today after minesweeping with Ikki and winning so many times, he is tired of such easy games and wants to play ano 阅读全文

摘要： Get Luffy OutTime Limit:2000MSMemory Limit:65536KTotal Submissions:6742Accepted:2583DescriptionRatish is a young man who always dreams of being a hero. One day his friend Luffy was caught by Pirate Arlong. Ratish set off at once to Arlong's island. When he got there, he found the secret place wh 阅读全文

摘要： Going from u to v or from v to u?Time Limit:2000MSMemory Limit:65536KTotal Submissions:12695Accepted:3274DescriptionIn order to make their sons brave, Jiajia and Wind take them to a big cave. The cave has n rooms, and one-way corridors connecting some rooms. Each time, Wind choose two rooms x and y, 阅读全文

摘要： Frogs' NeighborhoodTime Limit:5000MSMemory Limit:10000KTotal Submissions:6048Accepted:2621Special JudgeDescription未名湖附近共有N个大小湖泊L1,L2, ...,Ln(其中包括未名湖)，每个湖泊Li里住着一只青蛙Fi(1 ≤i≤N)。如果湖泊Li和Lj之间有水路相连，则青蛙Fi和Fj互称为邻居。现在已知每只青蛙的邻居数目x1,x2, ...,xn，请你给出每两个湖泊之间的相连关系。Input第一行是测试数据的组数T(0 ≤T≤ 20)。每组数据包括两行，第一行是整数N(2 阅读全文

摘要： Full Tank?Time Limit:1000MSMemory Limit:65536KTotal Submissions:5754Accepted:1891DescriptionAfter going through the receipts from your car trip through Europe this summer, you realised that the gas prices varied between the cities you visited. Maybe you could have saved some money if you were a bit 阅读全文

摘要： Sightseeing CowsTime Limit:1000MSMemory Limit:65536KTotal Submissions:6908Accepted:2291DescriptionFarmer John has decided to reward his cows for their hard work by taking them on a tour of the big city! The cows must decide how best to spend their free time.Fortunately, they have a detailed city map 阅读全文

摘要： Cow RelaysTime Limit:1000MSMemory Limit:65536KTotal Submissions:4590Accepted:1823DescriptionFor their physical fitness program,N(2 ≤N≤ 1,000,000) cows have decided to run a relay race using theT(2 ≤T≤ 100) cow trails throughout the pasture.Each trail connects two different intersections (1 ≤I1i≤ 1,0 阅读全文

摘要： SightseeingTime Limit:2000MSMemory Limit:65536KTotal Submissions:6415Accepted:2265DescriptionTour operator Your Personal Holiday organises guided bus trips across the Benelux. Every day the bus moves from one citySto another cityF. On this way, the tourists in the bus can see the sights alongside th 阅读全文

摘要： 【序】二分用的一点不熟，做个专题好了。---------------------一、从有序数组中查找某个值---------------------二、假定一个解并判断是否可行1、POJ1064有N条绳子长度为Li。从中切割出K条长度相同的绳子，求这K条绳子最长能有多长。const int maxn=11111;int n,k;double a[maxn];bool C(double x){ int sum=0; REP(i,n) sum+=int(a[i]/x); return sum>=k;}int main(){ while (~scanf("%d%d",&am 阅读全文

摘要： 有向图的强连通分量POJ 1236 - Network of Schools(基础)http://acm.pku.edu.cn/JudgeOnline/problem?id=1236题意：问添加多少边可成为完全连通图解法：缩点，看度数/** head-file **/ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include /** define-fo... 阅读全文