mirror of
https://github.com/Xevion/contest.git
synced 2025-12-16 06:11:29 -06:00
problem 3 work
This commit is contained in:
@@ -1,39 +1,50 @@
|
||||
import static java.lang.System.*;
|
||||
import java.io.File;
|
||||
import java.io.FileNotFoundException;
|
||||
import java.util.Scanner;
|
||||
import java.util.Set;
|
||||
import java.util.Arrays;
|
||||
import java.util.List;
|
||||
import java.util.ArrayList;
|
||||
import java.util.Scanner;
|
||||
import java.util.HashSet;
|
||||
|
||||
class Point {
|
||||
int x;
|
||||
int y;
|
||||
int x, y;
|
||||
Point(int x, int y) {
|
||||
this.x = x;
|
||||
this.y = y;
|
||||
}
|
||||
void merge(Point other) {
|
||||
this.x += other.x;
|
||||
this.y += other.y;
|
||||
}
|
||||
public String toString() {
|
||||
return String.format("Point(%d, %d)", this.x, this.y);
|
||||
}
|
||||
}
|
||||
|
||||
class Maze {
|
||||
int[][] offsets = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
|
||||
String[][] rawMatrix;
|
||||
Set<Point> snake;
|
||||
Set<Point> pellets;
|
||||
// Offset Constants
|
||||
List<Point> positionOffsets = Arrays.asList(new Point(0, 1), new Point(1, 0), new Point(0, -1), new Point(-1, 0));
|
||||
List<String> nameOffsets = Arrays.asList("U R D L".split(" "));
|
||||
// Maze Data
|
||||
private List<Point> snake = new ArrayList<Point>();;
|
||||
private List<Point> pellets = new ArrayList<Point>();
|
||||
private char[][] rawMatrix;
|
||||
|
||||
Maze(String[][] rawMatrix) {
|
||||
Maze(char[][] rawMatrix) {
|
||||
this.rawMatrix = rawMatrix;
|
||||
snake = new ArrayList<Point>();
|
||||
|
||||
for(int x = 0; x < 15; x++) {
|
||||
for(int y = 0; y < 15; y++) {
|
||||
switch(rawMatrix[x][y]) {
|
||||
case " ":
|
||||
case ' ':
|
||||
break;
|
||||
case "X":
|
||||
snake.add(new Point(x, y));
|
||||
case 'X':
|
||||
this.snake.add(new Point(x, y));
|
||||
break;
|
||||
case "F":
|
||||
pellets.add(new Point(x, y));
|
||||
case 'F':
|
||||
this.pellets.add(new Point(x, y));
|
||||
break;
|
||||
default:
|
||||
out.println("Possibly faulty Maze Input with item \"" + rawMatrix[x][y] + "\" found.");
|
||||
@@ -45,20 +56,42 @@ class Maze {
|
||||
|
||||
// Simulate the snake game using instructions
|
||||
String simulate(String input) {
|
||||
return "";
|
||||
char curDirection = 'R';
|
||||
int score = 0;
|
||||
for(int i = 0; i < input.length(); i++) {
|
||||
// Calculate the offset based on the current instruction
|
||||
Point offset;
|
||||
char curOffset = input.charAt(i);
|
||||
if(curOffset == 'O')
|
||||
offset = positionOffsets.get(nameOffsets.indexOf(curDirection));
|
||||
else
|
||||
offset = positionOffsets.get(nameOffsets.indexOf(input.substring(i, i+1)));
|
||||
out.println(offset);
|
||||
// Calculate the new point, ensure it's real
|
||||
Point newPoint = snake.get(snake.size() -1);
|
||||
newPoint.merge(offset);
|
||||
if(!this.inBounds(newPoint))
|
||||
return "GAME OVER @ " + newPoint;
|
||||
// Add new point, discard end of snake to simulate it's movement
|
||||
snake.add(newPoint);
|
||||
snake.remove(0);
|
||||
// Check if we're at a pellet
|
||||
score += pellets.contains(newPoint) ? 1 : 0;
|
||||
}
|
||||
return Integer.toString(score);
|
||||
}
|
||||
|
||||
boolean inBounds(int x, int y) {
|
||||
return x >= 0 && y >= 0 && x < 15 && y < 15;
|
||||
}
|
||||
// Methods for testing whether a position is in the maze's boundaries
|
||||
public boolean inBounds(Point point) {return this.inBounds(point.x, point.y);}
|
||||
private boolean inBounds(int x, int y) {return x >= 0 && y >= 0 && x < 15 && y < 15;}
|
||||
|
||||
// Prints a string representation of the Maze
|
||||
String toString() {
|
||||
public String toString() {
|
||||
String[] lines = new String[15];
|
||||
for(int x = 0; x < 15; x++) {
|
||||
String[] temp = "";
|
||||
String[] temp = new String[15];
|
||||
for(int y = 0; y < 15; y++) {
|
||||
temp[y] = rawMatrix[x][y];
|
||||
temp[y] = Character.toString(rawMatrix[x][y]);
|
||||
}
|
||||
lines[x] = String.join(" - ", temp);
|
||||
}
|
||||
@@ -69,23 +102,31 @@ class Maze {
|
||||
public class problem3 {
|
||||
public static void main(String[] args ) throws FileNotFoundException {
|
||||
// Constants
|
||||
File input = new File("input.dat");
|
||||
Scanner read = new Scanner(input);
|
||||
File fileInput = new File("input.dat");
|
||||
Scanner read = new Scanner(fileInput);
|
||||
|
||||
// Read the maze into a String matrix
|
||||
char[][] rawMatrix = new String[15][15];
|
||||
char[][] rawMatrix = new char[15][15];
|
||||
for(int x = 0; x < 15; x++) {
|
||||
String line = read.nextLine();
|
||||
for(int y = 0; y < 15; y++) {
|
||||
rawMatrix[x][y] = line.charAt(y);
|
||||
}
|
||||
}
|
||||
Maze originalMaze = new Maze(rawMatrix);
|
||||
|
||||
// Read each of the inputs and process inside the maze
|
||||
// Read each of the inputs
|
||||
int lines = Integer.parseInt(read.nextLine());
|
||||
String[] inputs = new String[lines];
|
||||
for(int i = 0; i < lines; i++)
|
||||
inputs[i] = read.nextLine();
|
||||
|
||||
// Simulate inputs
|
||||
for(String input : inputs) {
|
||||
Maze temp = originalMaze;
|
||||
out.println(temp.simulate(input));
|
||||
out.println(temp);
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
Reference in New Issue
Block a user