BenardLee

import java.util.NavigableSet;
import java.util.TreeSet;

public class Main {
    private  NavigableSet<String> mWordSet;
    private  NavigableSet<String> mFindWordSet;
    private int mNaviX[]={-1,-1,-1, 0,0,1,1,1};
    private int mNaviY[]={-1, 0, 1,-1,1,1,0,-1};
    private char mMatrix[][];
    

BenardLee

import java.util.Comparator;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.NavigableSet;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
import java.util.Vector;

BenardLee

import java.util.PriorityQueue;
import java.util.Scanner;
//465342	ARCTIC	alnova2	java	2.5KB	정답	688ms	방금 전


public class Main {
	//Edge를 PriorityQueue에 추가하면 최소 Distance로 정렬되도록 하는 클래스
	private class edge implements Comparable<edge> {
		private Integer mFrom;
		private Integer mTo;

BenardLee

//465341	ARCTIC	alnova2	java	2.9KB	정답	760ms	방금 전
import java.util.HashSet;
import java.util.PriorityQueue;
import java.util.Scanner;
import java.util.Vector;

public class Main {
	//간선을 정의하는 클래스로, PriorityQueue에서 최소 비용으로 정렬될 수 있도록 Comparable을 Implement함
	private class edge implements Comparable<edge> {
		private Integer mFrom;

BenardLee

import java.util.Comparator;
import java.util.LinkedList;
import java.util.Scanner;

public class Main {
	private class Node implements Comparator<Node>{
		private int mNodeNum=-1;
		private double mWeight=Double.MAX_VALUE;
		public Node(int nodeNum,double weight){
			mNodeNum=nodeNum;

BenardLee

import java.util.Scanner;

public class Main {
	private double mCache[][];
	private double mCityMatrix[][];
	private int mCityNumber;
	
	public Main(int cityNumber,double[][] cityMatrix){
		mCityMatrix=cityMatrix;
		mCityNumber=cityNumber;

BenardLee

import java.util.Scanner;

public class Main {
	private int mMatrixSize;
	private int mMatrix[][];
	private int cache[][];

	public Main(int matrixSize,int matrix[][]){
		mMatrixSize=matrixSize;
		mMatrix=matrix;

BenardLee

import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
import java.util.Vector;

public class Main {
	private int mMatrixSize;
	private int mMatrix[][];
	private boolean mVisited[][];
	private class Position{

BenardLee

import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
import java.util.Vector;

public class Main {
	private int mMatrixSize;
	private int mMatrix[][];
	private class Position{
		public int mX;

BenardLee

import java.util.Scanner;
import java.util.Vector;

public class Main {
	private class pixelNode{
		private char mValues[]=new char[4];
		private pixelNode mLinks[]=new pixelNode[4];
		private pixelNode mParent;
		private int mIdx=0;