标签归档:

AIO2012 Solution(Chinese)

NORT

It is the year 1982. Malcolm Fraser is the Prime Minister of Australia, you frequently listen to Down Under by Men at Work on your boombox and roller blading is the default mode of transport. As a budding computer scientist, you spend most weekends at the local arcade trying to top your score in the popular video game NORT.

NORT is played on a rectangular grid of square cells with H columns and W rows. You ride a light-bike through the grid, starting in the top-left corner cell. Each second, you can move your light-bike up, down, left or right to any of the four adjacent grid cells (as long as you don't go off the grid!). As you move, your bike's exhaust pipe creates an impenetrable wall of light in the cell you were previously in. If you ever move into a cell containing a wall of light (i.e. a cell you have travelled through before), your bike will disintegrate into pixels in a dramatic 8-bit explosion. The only exception is if you return to the top-left corner cell where you started, in which case the wall of light will be connected and your score for the game will be the total length of wall you have created.

Your goal is therefore to plan the longest possible route through the grid starting and ending in the top-left cell without ever passing through a cell more than once.

继续阅读

CodeForces Round #350 Solution

这场比赛比较水,但是细节比较多,而我没考虑T_T

一个是先入为主坑了我的B题,我没有计算时间复杂度而导致采用了较繁而且容易挂的算法,wa了4发

C题是因为我没能考虑到特殊情况而苦于wa on 14,7 times

如果没有这两个错误说不定能大涨分= =

这些错误都是值得我思考以及改正的,好了,切入正题

继续阅读