随笔分类 -  模拟

ZOJ 3664 Split the Rectangle 第37届ACM/ICPC长春赛区现场赛 J 题(模拟建树,暴力 求LCA)
摘要:Split the RectangleTime Limit: 2 Seconds Memory Limit: 32768 KBAlice comes up with a new game and wants to play with Bob.There is one rectangle on the paper initially, we define its lower-left corner's coordinate is (xL, yL) and upper-right corner's coordinate is (xR, yR).Bob has executed th 阅读全文

posted @ 2012-10-19 13:54 kuangbin 阅读(1108) 评论(0) 推荐(0)

POJ 2993 Emag eht htiw Em Pleh(水模拟)
摘要:Emag eht htiw Em PlehTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 1950Accepted: 1315DescriptionThis problem is a reverse case of the problem 2996. You are given the output of the problem H and your task is to find the corresponding input.Inputaccording to output of problem 2996.Outputacc 阅读全文

posted @ 2012-08-13 16:44 kuangbin 阅读(871) 评论(0) 推荐(0)

POJ 2996 Help Me with the Game(水模拟)
摘要:Help Me with the GameTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 2426Accepted: 1571DescriptionYour task is to read a picture of a chessboard position and print it in the chess notation.InputThe input consists of an ASCII-art picture of a chessboard with chess pieces on positions describ 阅读全文

posted @ 2012-08-13 15:37 kuangbin 阅读(1217) 评论(0) 推荐(1)

POJ 1573 Robot Motion(水模拟)
摘要:Robot MotionTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 7892Accepted: 3812DescriptionA robot has been programmed to follow the instructions in its path. Instructions for the next direction the robot is to move are laid down in a grid. The possible instructions are N north (up the page) 阅读全文

posted @ 2012-08-13 14:18 kuangbin 阅读(370) 评论(0) 推荐(0)

POJ 2632 Crashing Robots(水模拟)
摘要:Crashing RobotsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 5453Accepted: 2382DescriptionIn a modernized warehouse, robots are used to fetch the goods. Careful planning is needed to ensure that the robots reach their destinations without crashing into each other. Of course, all warehouse 阅读全文

posted @ 2012-08-13 13:52 kuangbin 阅读(597) 评论(0) 推荐(0)

POJ 1068 Parencodings(模拟)
摘要:ParencodingsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 15075Accepted: 8989DescriptionLet S = s1 s2...s2n be a well-formed string of parentheses. S can be encoded in two different ways: q By an integer sequence P = p1 p2...pn where pi is the number of left parentheses before the ith rig 阅读全文

posted @ 2012-08-13 12:12 kuangbin 阅读(1987) 评论(0) 推荐(0)

HDU 1035 Robot Motion(简单题,模拟)
摘要:Robot MotionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3466Accepted Submission(s): 1608Problem DescriptionA robot has been programmed to follow the instructions in its path. Instructions for the next direction the robot is to move are laid dow 阅读全文

posted @ 2012-06-03 15:32 kuangbin 阅读(1776) 评论(0) 推荐(0)

HDU 1034 Candy Sharing Game(水模拟)
摘要:Candy Sharing GameTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1685Accepted Submission(s): 1045Problem DescriptionA number of students sit in a circle facing their teacher in the center. Each student initially has an even number of pieces of can 阅读全文

posted @ 2012-06-03 13:39 kuangbin 阅读(3144) 评论(2) 推荐(1)

导航

JAVASCRIPT: