Smogon Discord Quote Database

P Squared

a great unrecorded history
is a Site Content Manageris a Community Contributoris a Top Contributoris a Top Social Media Contributor Alumnusis a Senior Staff Member Alumnusis a Top Smogon Media Contributor Alumnus
[12:33 PM] blackfire: in a word game a while ago, i had to write a clue to connect "sun" and some other word and i picked praise, and when they were trying to figure out my clue a guy was like
[12:33 PM] blackfire: really sarcastically
[12:33 PM] blackfire: "yeah, sure, cuz p^2 knows dark souls"
[12:33 PM] 15 Days Until Singular Point: Seems like typical gamer gatekeeping
[12:33 PM] 15 Days Until Singular Point: Frustrating
[12:33 PM] blackfire: fuck that dude... i didn't read all those posts by the firebot accountant dude whose name i cant remember for nothing
 

Bughouse

Like ships in the night, you're passing me by
is a Site Content Manageris a Forum Moderator Alumnusis a CAP Contributor Alumnusis a Tiering Contributor Alumnusis a Contributor Alumnus
It's a poorly stated problem since it's not asking for an algorithm to produce the optimal path in any arbitrary position, but rather just what the maximum possible number of cherries collected is. Under optimal conditions, on any grid greater than just (0,0) itself (which I believe is already clear from the problem starting you can move), that much simpler answer is 4N - 4 cherries (assuming a cherry can be on position (0,0), or 4N - 5 if not).
 

Mr. Uncompetitive

What makes us human?
is a Contributor Alumnus
It's a poorly stated problem since it's not asking for an algorithm to produce the optimal path in any arbitrary position, but rather just what the maximum possible number of cherries collected is. Under optimal conditions, on any grid greater than just (0,0) itself (which I believe is already clear from the problem starting you can move), that much simpler answer is 4N - 4 cherries (assuming a cherry can be on position (0,0), or 4N - 5 if not).
Nah I'm p sure it's asking to return the max possible cherries for a given a Cherry Field array, which you can figure out with BFS or Dijkstra's (since, if you exclusively go right/down and left/up, the path will have a fixed length)

CS problems and shitty wording, name a more iconic duo
 

cityscapes

Take care of yourself.
is a Tiering Contributoris a Community Contributor Alumnus
Purple Frog — Today at 10:57 PM
aye who said ompl teamcords were dead

look at this monster

Think~? — Today at 10:57 PM
LMAO

Red Person Screaming — Today at 10:57 PM
Wth is the casino

Purple Frog — Today at 10:57 PM

it's the waifubot channel

geerat — Today at 10:57 PM
LOL

aesf — Today at 10:57 PM
NOOO

pdt — Today at 10:57 PM
LOOOOOOL
 

Users Who Are Viewing This Thread (Users: 1, Guests: 0)

Top