Alex

Once there was a king named Akbar. He had a son named Shahjahan. For an unforgivable reason the king wanted him to leave the kingdom. Since he loved his son he decided his son would be banished in a ne

TramTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 10622 Accepted: 3877DescriptionTram network in Zagreb consists of a number of intersections and rails

Description 年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币，便请求酋长降低要求。酋长说：”嗯，如果你能够替我弄到大祭司的皮袄，我可以只要8000金币。如果你能够弄来他的水晶球，那么只要5000金币就行了。”探险家就跑到大祭司那里，向他要求皮袄或水晶球，大祭司要他用金币来换，

1627. JoinTime limit: 4.0 secondMemory limit: 64 MBBusinessman Petya recently bought a new house. This house has one floor withn × m square rooms, placed in rectangular lattice. Some roo

Currency ExchangeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 21122 Accepted: 7572DescriptionSeveral currency exchange points are working in our city.

101. Dominotime limit per test: 0.25 sec. memory limit per test: 4096 KBDominoes – game played with small, rectangular blocks of wood or other material, each identified by a number of dots,

D. Tanya and Passwordtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhile dad was at work, a little girl Tanya deci

CatenymsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9887 Accepted: 2583DescriptionA catenym is a pair of words separated by a period such that the las

Idiomatic Phrases GameTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2191    Accepted Submission(s): 712Problem DescriptionTom is p

Transfer waterTime Limit: 5000/3000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 3964    Accepted Submission(s): 1424Problem DescriptionXiaoA lives in

104. HighwaysProblem code: HIGHIn some countries building highways takes a lot of time... Maybe that's because there are many possiblities to construct a network of highways and engineers can't

Ice_cream’s world IITime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3045    Accepted Submission(s): 718Problem DescriptionAfter awar

LightningTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1565    Accepted Submission(s): 515Problem DescriptionThere are N robots st

In ActionTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4256    Accepted Submission(s): 1372Problem DescriptionSince 1945, when t

NetworkTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 6989 Accepted: 2497DescriptionA network administrator manages a large network. The network cons

Problem Description Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall.A blockhouse is

Problem Description 小希和Gardon在玩一个游戏：对一个N*M的棋盘，在格子里放尽量多的一些国际象棋里面的“车”，并且使得他们不能互相攻击，这当然很简单，但是Gardon限制了只有某些格子才可以放，小希还是很轻松的解决了这个问题（见下图）注意不能放车的地方不影响车的互相攻击。 所以现在Gardon想让小希来解决一个更难的问题，在保证尽量多的“车”的前提下，棋盘里有些格子是可

The Vampires and Lykans are fighting each other to death. The war has become so fierce that, none knows who will win. The humans want to know who will survive finally. But humans are afraid of going to

One of my friends is always drunk. So, sometimes I get a bit confused whether he is drunk or not. So, one day I was talking to him, about his drinks! He began to describe his way of drinking. So, let m

I am going to my home. There are many cities and many bi-directional roads between them. The cities are numbered from 0 to n-1 and each road has a cost. There are m roads. You are given the number of m

A.简单题/************************************************************************* > File Name: A.cpp > Author: ALex > Mail: zchao1995@gmail.com > Created Time: 2015年05月20日 星期三 09时51分15秒

Greg has a weighed directed graph, consisting of n vertices. In this graph any pair of distinct vertices has an edge between them in both directions. Greg loves playing with the graph and now he has in

The city Valera lives in is going to hold elections to the city Parliament.The city has n districts and n - 1 bidirectional roads. We know that from any district there is a path along the roads to any

A country called Berland consists of n cities, numbered with integer numbers from 1 to n. Some of them are connected by bidirectional roads. Each road has some length. There is a path from each city to

A and B are preparing themselves for programming contests.The University where A and B study is a set of rooms connected by corridors. Overall, the University has n rooms connected by n - 1 corridors s

Command NetworkTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 13609 Accepted: 3925DescriptionAfter a long lasting war on words, a war on arms finally

Qin Shi Huang's National Road SystemTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4043    Accepted Submission(s): 1393Problem Descri

专题链接关于tarjanA - Network of Schools  原题地址本题有2个问题，第一个是要算最少要给多少个点软件，才能使所有点都可以收到副本第二个是要算最少加多少条边，使得图变成强连通1：tarjan求强连通，然后缩点，计算入度为0的强连通分量2：设现在有a个入度为0的点，b个出度为0的点（缩完点后的点），最合理的加边方法肯定是从出度为0的点

The Shortest PathTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2552    Accepted Submission(s): 807Problem DescriptionThere are N c

Prince and PrincessTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1165    Accepted Submission(s): 325Problem DescriptionThere are n

Stockbroker GrapevineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 27547 Accepted: 15264DescriptionStockbrokers are known to overreact to rumours. You h

Ollivanders: Makers of Fine Wands since 382 BC.Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 964    Accepted Submission(s): 539Prob

Cow Ski AreaTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2376 Accepted: 668DescriptionFarmer John's cousin, Farmer Ron, who lives in the mountains of C

Intelligence SystemTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1484    Accepted Submission(s): 655Problem DescriptionAfter a day

The Bottom of a GraphTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 8902 Accepted: 3688DescriptionWe will use the following (standard) definitions from g

RewardTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4306    Accepted Submission(s): 1318Problem DescriptionDandelion's uncle is a

Is the Information Reliable?Time Limit: 3000MS Memory Limit: 131072KTotal Submissions: 11334 Accepted: 3575DescriptionThe galaxy war between the Empire Draco and

这两题完全一个意思，都是差分约束的水题

Summer HolidayTime Limit: 10000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1727    Accepted Submission(s): 800Problem DescriptionTo see a World

Proving EquivalencesTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3226    Accepted Submission(s): 1216Problem DescriptionConsider