Ramanujan

摘要： LabyrinthTime Limit: 2000MSMemory Limit: 32768KTotal Submissions: 3627Accepted: 1379DescriptionThe northern part of the Pyramid contains a very large and complicated labyrinth. The labyrinth is divided into square blocks, each of them either filled by rock, or free. There is also a little hook on th 阅读全文

摘要： Problem CMonkeys inthe Emei MountainInput: Standard InputOutput: Standard Output Xuexue is a prettymonkey living in the Emei mountain.She is extremely thirsty during time 2 and time 9 everyday, so she must drink 2units water during this period. She may drink water more than once, as long asthe total 阅读全文

摘要： Dinic：int vis[MAXN], d[MAXN];bool bfs(cint s, cint t){ queue q; q.push(s); memset(vis, 0, sizeof(vis)); d[s]=0; vis[s]=1; while(!q.empty()){ int u=q.front(); q.pop(); for(int i=h[u]; i!=-1; i=e[i].nxt){ int v=e[i].v, cap=e[i].cap, ef=e[i].flow; ... 阅读全文

摘要： C. Jeff and Roundingtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputJeff got 2n real numbers a1, a2, ..., a2n as a birthday present. The boy hates non-integer numbers, so he decided to slightly "adjust" the numb... 阅读全文

摘要： The mobile network market in country XYZ used to be dominated by two large corporations, XYZ Telecom and XYZ Mobile. The central government recently has realized that radio frequency spectrum is a scarce resource and wants to regulate its usage. The spectrum currently in use is divided into 300,000 阅读全文

摘要： There are N cities, and M directed roads connecting them. Now you want to transport K units of goods from city 1 to city N. There are many robbers on the road, so you must be very careful. The more goods you carry, the more dangerous it is. To be more specific, for each road i, there is a coefficien 阅读全文

摘要： You are appointed director of a famous concert hall, to save it from bankruptcy. The hall is very popular, and receives many requests to use its two fine rooms, but unfortunately the previous director was not very efficient, and it has been losing money for many years. The two rooms are of the same 阅读全文

摘要： Problem DDown Went The TitanicTime Limit: 8 SecondAfter the collision of the great Titanic with the iceberg, it went down. Now there are peoples floating in the cold water struggling with death. Some helping ship will arrive to save them. But they have to survive until the ships arrive. Now consider 阅读全文

摘要： Problem CShogiTournamentInput: standard inputOutput: standard outputTime Limit: 25 secondsMemory Limit: 32 MBYou are to compute, given a partially playedShogi tournament (Japanese chess), whether or not a particular player can stilltheoretically win the tournament and if so, the maximum number of po 阅读全文

摘要： Problem DThe Grand DinnerInput: standard inputOutput: standard outputTime Limit: 15 secondsMemory Limit: 32 MBEach team participating in this year’s ACM World Finals contest is expected to join the grand dinner to be arranged after the prize giving ceremony ends. In order to maximize the interaction 阅读全文