結果

問題 No.2064 Smallest Sequence on Grid
ユーザー watarimaycry2watarimaycry2
提出日時 2022-09-02 22:37:06
言語 Java21
(openjdk 21)
結果
AC  
実行時間 2,949 ms / 3,000 ms
コード長 5,700 bytes
コンパイル時間 3,298 ms
コンパイル使用メモリ 79,408 KB
実行使用メモリ 489,708 KB
最終ジャッジ日時 2023-08-10 04:54:03
合計ジャッジ時間 34,445 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 43 ms
49,388 KB
testcase_01 AC 43 ms
47,816 KB
testcase_02 AC 45 ms
49,640 KB
testcase_03 AC 43 ms
49,760 KB
testcase_04 AC 45 ms
49,608 KB
testcase_05 AC 45 ms
49,748 KB
testcase_06 AC 42 ms
47,856 KB
testcase_07 AC 44 ms
49,380 KB
testcase_08 AC 46 ms
50,116 KB
testcase_09 AC 45 ms
49,624 KB
testcase_10 AC 48 ms
49,944 KB
testcase_11 AC 50 ms
49,692 KB
testcase_12 AC 50 ms
49,512 KB
testcase_13 AC 52 ms
49,652 KB
testcase_14 AC 60 ms
50,992 KB
testcase_15 AC 56 ms
50,832 KB
testcase_16 AC 61 ms
50,768 KB
testcase_17 AC 1,218 ms
400,624 KB
testcase_18 AC 1,189 ms
399,924 KB
testcase_19 AC 1,185 ms
400,548 KB
testcase_20 AC 2,656 ms
484,620 KB
testcase_21 AC 2,700 ms
483,984 KB
testcase_22 AC 2,311 ms
477,432 KB
testcase_23 AC 2,361 ms
475,596 KB
testcase_24 AC 2,304 ms
477,764 KB
testcase_25 AC 2,288 ms
475,824 KB
testcase_26 AC 2,810 ms
489,708 KB
testcase_27 AC 2,949 ms
488,944 KB
testcase_28 AC 1,183 ms
401,636 KB
testcase_29 AC 2,413 ms
416,636 KB
testcase_30 AC 1,002 ms
320,600 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*; import java.io.*; import java.math.*;
public class Main{
	//見なくていいよ　ここから------------------------------------------
	static class InputIterator{
		ArrayList<String> inputLine = new ArrayList<>(1024);
		int index = 0; int max; String read;
		InputIterator(){
			try{
				BufferedReader br = new BufferedReader(new InputStreamReader(System.in, "UTF-8"));
				while((read = br.readLine()) != null){
					inputLine.addAll(Arrays.asList(read.split(" ")));
				}
			}catch(IOException e){}
			max = inputLine.size();
		}
		boolean hasNext(){return (index < max);}
		String next(){
			if(hasNext()){
				return inputLine.get(index++);
			}else{
				throw new IndexOutOfBoundsException("There is no more input");
			}
		}
	}
	static HashMap<Integer, String> CONVSTR = new HashMap<>();
	static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem.
	static PrintWriter out = new PrintWriter(System.out);
	static void flush(){out.flush();}
	static void myout(Object t){out.println(t);}
	static void myerr(Object... t){System.err.print("debug:");System.err.println(Arrays.deepToString(t));}
	static String next(){return ii.next();}
	static boolean hasNext(){return ii.hasNext();}
	static int nextInt(){return Integer.parseInt(next());}
	static long nextLong(){return Long.parseLong(next());}
	static double nextDouble(){return Double.parseDouble(next());}
	static ArrayList<String> nextCharArray(){return myconv(next(), 0);}
	static ArrayList<String> nextStrArray(int size){
		ArrayList<String> ret = new ArrayList<>(size);
		for(int i = 0; i < size; i++){
			ret.add(next());
		}
		return ret;
	}
	static ArrayList<Integer> nextIntArray(int size){
		ArrayList<Integer> ret = new ArrayList<>(size);
		for(int i = 0; i < size; i++){
			ret.add(Integer.parseInt(next()));
		}
		return ret;
	}
	static ArrayList<Long> nextLongArray(int size){
		ArrayList<Long> ret = new ArrayList<>(size);
		for(int i = 0; i < size; i++){
			ret.add(Long.parseLong(next()));
		}
		return ret;
	}
	@SuppressWarnings("unchecked")
	static String myconv(Object list, int no){//only join
		StringBuilder sb = new StringBuilder("");
		String joinString = CONVSTR.get(no);
		if(list instanceof String[]){
			return String.join(joinString, (String[])list);
		}else if(list instanceof long[]){
			long[] tmp = (long[])list;
			if(tmp.length == 0){
				return "";
			}
			sb.append(String.valueOf(tmp[0]));
			for(int i = 1; i < tmp.length; i++){
				sb.append(joinString).append(String.valueOf(tmp[i]));
			}
			return sb.toString();
		}else if(list instanceof int[]){
			int[] tmp = (int[])list;
			if(tmp.length == 0){
				return "";
			}
			sb.append(String.valueOf(tmp[0]));
			for(int i = 1; i < tmp.length; i++){
				sb.append(joinString).append(String.valueOf(tmp[i]));
			}
			return sb.toString();
		}else if(list instanceof ArrayList){
			ArrayList tmp = (ArrayList)list;
			if(tmp.size() == 0){
				return "";
			}
			sb.append(tmp.get(0));
			for(int i = 1; i < tmp.size(); i++){
				sb.append(joinString).append(tmp.get(i));
			}
			return sb.toString();
		}else{
			throw new ClassCastException("Don't join");
		}
	}
	static ArrayList<String> myconv(String str, int no){//only split
		String splitString = CONVSTR.get(no);
		return new ArrayList<String>(Arrays.asList(str.split(splitString)));
	}
	static ArrayList<String> myconv(String str, String no){
		return new ArrayList<String>(Arrays.asList(str.split(no)));
	}
	public static void main(String[] args){
		CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, "");
		solve();flush();
	}
	//見なくていいよ　ここまで------------------------------------------
	//このコードをコンパイルするときは、「-encoding UTF-8」を指定すること
	static void solve(){//ここがメイン関数
		int H = nextInt();
		int W = nextInt();
		Node[][] list = new Node[H][W];
		for(int i = 0; i < H; i++){
			String s = next();
			for(int j = 0; j < W; j++){
				char c = s.charAt(j);
				list[i][j] = new Node(i, j, c);
			}
		}
		ArrayDeque<Edge> queue = new ArrayDeque<>();
		queue.add(new Edge(0, 0));
		list[0][0].access = true;
		while(queue.size() > 0){
			ArrayList<Edge> nx = new ArrayList<>();
			while(queue.size() > 0){
				Edge tmp = queue.pollFirst();
				int y = tmp.y;
				int x = tmp.x;
				if(y < H - 1){
					nx.add(new Edge(y + 1, x));
				}
				if(x < W - 1){
					nx.add(new Edge(y, x + 1));
				}
			}
			if(nx.size() == 0){
				break;
			}
			char ok = Character.MAX_VALUE;
			for(Edge nxe : nx){
				if(Character.compare(ok, list[nxe.y][nxe.x].S) >= 1){
					ok = list[nxe.y][nxe.x].S;
				}
			}
			for(Edge nxe : nx){
				if(ok == list[nxe.y][nxe.x].S && !list[nxe.y][nxe.x].access){
					list[nxe.y][nxe.x].access = true;
					queue.add(nxe);
				}
			}
		}
		int lastY = H - 1;
		int lastX = W - 1;
		char[] output = new char[H + W - 1];
		int lastIndex = H + W - 2;
		while(true){
			output[lastIndex] = list[lastY][lastX].S;
			lastIndex--;
			if(lastY == 0 && lastX == 0){
				break;
			}
			if(lastY > 0 && lastX > 0){
				if(list[lastY - 1][lastX].access){
					lastY--;
				}else{
					lastX--;
				}
			}else if(lastY > 0){
				lastY--;
			}else{
				lastX--;
			}
		}
		myout(new String(output));
	}
	//メソッド追加エリア　ここから

static class Node implements Comparable<Node>{
	char S;
	int y;
	int x;
	boolean access = false;
	Node(int y, int x, char S){
		this.S = S;
		this.y = y;
		this.x = x;
	}
	public int compareTo(Node ato){
		return Character.compare(this.S, ato.S);
	}
}

static class Edge{
	int y;
	int x;
	Edge(int y, int x){
		this.x = x;
		this.y = y;
	}
}

	//メソッド追加エリア　ここまで
}
0