Simple simulation game. Don’t forget to read through the entire input if the game ends early! That cost me a couple of tries :[<\/p>\n
\r\nimport java.io.PrintWriter;\r\nimport java.util.Arrays;\r\nimport java.util.Scanner;\r\n\r\n\/**\r\n * \r\n * @author Sanchit M. Bhatnagar\r\n * @see http:\/\/uhunt.felix-halim.net\/id\/74004\r\n * \r\n *\/\r\npublic class P11459 {\r\n\r\n public static void main(String[] args) {\r\n Scanner sc = new Scanner(System.in);\r\n PrintWriter out = new PrintWriter(System.out);\r\n\r\n int cases = sc.nextInt();\r\n while (cases > 0) {\r\n int players = sc.nextInt();\r\n int cheats = sc.nextInt();\r\n int rolls = sc.nextInt();\r\n\r\n int[] map = new int[101];\r\n for (int i = 0; i < cheats; i++) {\r\n map[sc.nextInt()] = sc.nextInt();\r\n }\r\n\r\n int playerIdx = 0;\r\n int[] pos = new int[players];\r\n Arrays.fill(pos, 1);\r\n for (int i = 0; i < rolls; i++) {\r\n pos[playerIdx] += sc.nextInt();\r\n if (map[pos[playerIdx]] != 0)\r\n pos[playerIdx] = map[pos[playerIdx]];\r\n if (pos[playerIdx] >= 100) {\r\n pos[playerIdx] = 100;\r\n while (i + 1 < rolls) {\r\n sc.nextInt();\r\n i++;\r\n }\r\n break;\r\n }\r\n playerIdx++;\r\n if (playerIdx == players)\r\n playerIdx = 0;\r\n }\r\n for (int i = 0; i < players; i++) {\r\n out.println("Position of player " + (i + 1) + " is " + pos[i] + ".");\r\n }\r\n cases--;\r\n }\r\n\r\n out.close();\r\n sc.close();\r\n }\r\n}\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"Simple simulation game. Don’t forget to read through the entire input if the game ends early! That cost me a couple of tries :[ import java.io.PrintWriter; import java.util.Arrays; import java.util.Scanner; \/** * * @author Sanchit M. Bhatnagar * @see http:\/\/uhunt.felix-halim.net\/id\/74004 * *\/ public class P11459 { public static void main(String[] args) { Scanner sc = … Continue reading UVA 11459 – Snakes and Ladders<\/span>