2012年03月_CSUST_ACM

转载 H - River Hopscotch解题报告（张浩盛伦）

H - River HopscotchTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionEvery year the cows hold an event featuring a peculiar vers

2012-03-21 14:01:00 1429

转载 B - Gold Balanced Lineup解题报告（张浩盛伦）

B - Gold Balanced LineupTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionFarmer John's N cows (1 ≤ N ≤ 100,000) share many simi

2012-03-21 13:54:19 1487

原创 F - Babelfish解题报告（map函数）（陈渊）

F - BabelfishTime Limit:3000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionYou have just moved from Waterloo to a big city. The people here

2012-03-21 13:51:33 4684 2

转载 I - Expanding Rods解题报告（黄杰）

I - Expanding RodsTime Limit:1000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionWhen a thin rod of length L is heated n degrees, it expands

2012-03-21 13:46:20 3454

转载 F - Babelfish解题报告（黄杰）

F - BabelfishTime Limit:3000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionYou have just moved from Waterloo to a big city. The people here

2012-03-21 13:43:39 3658

转载 D - Eqs解题报告（黄杰）

D - EqsTime Limit:5000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionConsider equations having the following form: a1x13+ a2x23+ a3x33+ a4

2012-03-21 13:41:43 3553

转载 G - Monthly Expense解题报告（黄杰）

G - Monthly ExpenseTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionFarmer John is an astounding accounting wizard and has real

2012-03-21 13:38:55 3676

转载 J - Pie解题报告（黄杰）

J - PieTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionMy birthday is coming up and traditionally I'm serving pie. Not just on

2012-03-21 13:36:47 3769

转载 A - SnowflakeSnowSnowflakes解题报告（黄杰）

A - SnowflakeSnowSnowflakesTime Limit:4000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionYou may have heard that no two snowflakes are alike.

2012-03-21 13:34:57 3718

转载 STL中map用法详解

STL中map用法详解利用map函数解HOJ10399 由于STL是一个统一的整体，map的很多用法都和STL中其它的东西结合在一起；map中由于它内部有序，由红黑树保证，因此很多函数执行的时间复杂度都是log2N的，如果用map函数可以实现的功能，而STL Algorithm也可以完成该功能，建议用map自带函数，效率高一些……Map是STL的一个关联容器，它提供一对一（其中第一个

2012-03-16 15:32:40 542

转载 N - Channel Allocation

N - Channel AllocationTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1129DescriptionWhen a radio station is broadcasting

2012-03-16 15:31:53 640

转载 M - Sudoku

M - SudokuTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2676DescriptionSudoku is a very simple task. A square table wit

2012-03-16 15:31:23 630

转载 L - Shredding Company

L - Shredding CompanyTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1416DescriptionYou have just been put in charge of d

2012-03-16 15:30:46 509

转载 K - Network Saboteur

K - Network SaboteurTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2531DescriptionA university network is composed of N

2012-03-16 15:30:01 438

转载 J - Pots

J - PotsTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 3414DescriptionYou are given two pots, having the volume of A and

2012-03-16 15:29:36 569

转载 I - Shuffle'm Up

I - Shuffle'm UpTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 3087DescriptionA common pastime for poker players at a po

2012-03-16 15:29:08 462

转载 H - Prime Path

H - Prime PathTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 3126DescriptionThe ministers of the cabinet were quite upse

2012-03-16 15:28:36 514

转载 G - Find The Multiple

G - Find The MultipleTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1426DescriptionGiven a positive integer n, write a p

2012-03-16 15:28:05 483

转载 F - Catch That Cow

F - Catch That CowTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 3278DescriptionFarmer John has been informed of the loc

2012-03-16 15:27:25 555

转载 E - Dungeon Master

E - Dungeon MasterTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2251DescriptionYou are trapped in a 3D dungeon and need

2012-03-16 15:26:51 504

转载 D - 棋盘问题

D - 棋盘问题Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1321Description在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放

2012-03-16 15:26:06 847

转载 C - Curling 2.0

C - Curling 2.0Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 3009DescriptionOn Planet MM-21, after their Olympic games

2012-03-16 15:25:07 870

原创 B - Children of the Candy Corn

B - Children of the Candy CornTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 3083DescriptionThe cornfield maze is a popu

2012-03-16 15:22:58 631

原创 POJ-3087 Shuffle'm Up 解题报告（陈小宾）

DescriptionA common pastime for poker players at a poker table is to shuffle stacks of chips. Shuffling chips is performed by starting with two stacks of poker chips, S1 and S2, each stack conta

2012-03-15 22:07:23 4424

原创 A Knight's Journey解题报告（陈小宾）

DescriptionBackground The knight is getting bored of seeing the same black and white squares again and again and has decided to make a journey around the world. Whenever a knight moves, it is

2012-03-15 22:01:25 4813

原创 Sudoku解题报告（陈小宾）

SudokuTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 9679 Accepted: 4791 Special JudgeDescriptionSudoku is a very sim

2012-03-15 21:58:36 4686

转载 A Knight's Journey

A - A Knight's JourneyTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2488DescriptionBackground The knight is getting bor

2012-03-09 12:59:57 688

原创 sort函数的用法

sort函数的用法做ACM题的时候，排序是一种经常要用到的操作。如果每次都自己写个冒泡之类的O(n^2)排序，不但程序容易超时，而且浪费宝贵的比赛时间，还很有可能写错。STL里面有个sort函数，可以直接对数组排序，复杂度为n*log2(n)。使用这个函数，需要包含头文件。这个函数可以传两个参数或三个参数。第一个参数是要排序的区间首地址，第二个参数是区间尾地址的下一地址。也就是说，

2012-03-06 20:53:54 4554 5

CSUST_ACM的专栏