#8584 (Java21) No.124 門松列(3)

提出ソース

結果

問題	No.124 門松列(3)
ユーザー	threepipes_s
提出日時	2015-01-12 00:56:27
言語	Java21 (openjdk 21)
結果	WA
実行時間	-
コード長	6,737 bytes
コンパイル時間	2,738 ms
コンパイル使用メモリ	83,240 KB
実行使用メモリ	52,268 KB
最終ジャッジ日時	2024-06-22 04:22:31
合計ジャッジ時間	5,611 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	WA	-
testcase_01	WA	-
testcase_02	AC	53 ms 50,340 KB
testcase_03	WA	-
testcase_04	AC	96 ms 52,168 KB
testcase_05	AC	84 ms 52,092 KB
testcase_06	AC	52 ms 50,572 KB
testcase_07	AC	53 ms 50,540 KB
testcase_08	AC	52 ms 50,604 KB
testcase_09	AC	53 ms 50,588 KB
testcase_10	WA	-
testcase_11	WA	-
testcase_12	AC	52 ms 50,696 KB
testcase_13	WA	-
testcase_14	AC	52 ms 50,192 KB
testcase_15	AC	52 ms 50,484 KB
testcase_16	WA	-
testcase_17	AC	53 ms 50,548 KB
testcase_18	WA	-
testcase_19	AC	53 ms 50,212 KB
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	AC	67 ms 51,376 KB
testcase_24	AC	83 ms 51,576 KB
testcase_25	AC	71 ms 51,580 KB
testcase_26	AC	56 ms 50,416 KB
testcase_27	AC	56 ms 50,312 KB
testcase_28	AC	93 ms 52,236 KB
testcase_29	AC	91 ms 51,876 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
import java.util.TreeSet;
public class Main {
	public static Queue<Data> qu = new LinkedList<Data>();
	public static int[][][] dp;
	public static void main(String[] args) throws NumberFormatException, IOException{
		ContestScanner in = new ContestScanner();
		int w = in.nextInt();
		int h = in.nextInt();
		int[][] masu = new int[h][w];
		for(int i=0; i<h; i++){
			for(int j=0; j<w; j++){
				masu[i][j] = in.nextInt();
			}
		}
		dp = new int[2][h][w];
		for(int i=0; i<h; i++){
			for(int j=0; j<w; j++){
				dp[0][i][j] = -1;
				dp[1][i][j] = -1;
			}
		}
		qu.add(new Data(0, 0, 0, -1, masu[0][0]));
		dp[0][0][0] = 0;
		dp[1][0][0] = 0;
		boolean ok = false;
		while(!qu.isEmpty()){
			Data d = qu.poll();
			for(int i=0; i<4; i++){
				int next = d.turn+1;
				int x, y;
				if(i==0){
					x = d.x;
					y = d.y - 1;
				}else if(i==1){
					x = d.x + 1;
					y = d.y;
				}else if(i==2){
					x = d.x;
					y = d.y + 1;
				}else{
					x = d.x - 1;
					y = d.y;
				}
				if(x >= 0 && x < w && y >= 0 && y < h
					&& d.isKadomatsuSequence(masu[y][x])){
					if((dp[d.world][y][x] == -1 || dp[d.world][y][x] >= 0 && dp[d.world][y][x] > next)){
						dp[d.world][y][x] = next;
						if(x == w-1 && y == h-1){
							ok = true;
							break;
						}
						qu.add(new Data(x, y, next, d.a1, masu[y][x]));
					}
				}
				if(ok) break;
			}
		}

		if(dp[0][h-1][w-1] == -1 && dp[1][h-1][w-1] == -1){
			System.out.println(-1);
		}else{
			if(dp[0][h-1][w-1] < dp[1][h-1][w-1] || dp[1][h-1][w-1] == -1)
				System.out.println(dp[0][h-1][w-1]);
			else System.out.println(dp[0][h-1][w-1]);
		}
	}
}

class Data{
	int turn;
	int x;
	int y;
	int a0;
	int a1;
	int world;
	public Data(int x, int y, int turn, int a0, int a1){
		this.turn = turn;
		this.x = x;
		this.y = y;
		this.a0 = a0;
		this.a1 = a1;
	}
	
	public boolean isKadomatsuSequence(int a){
		if(a0 == -1){
			if(a1 < a) world = 1;
			return true;
		}
		if(a != a0 && a != a1 && a0 != a1){
			if(a1 < a && a1 < a0){
				world = 1;
				return true;
			}else if(a1 > a && a1 > a0){
				world = 0;
				return true;
			}
		}
		return false;
	}
}

class MyComp implements Comparator<int[]>{
	public int compare(int[] a, int[] b) {
		return a[0] - b[0];
	}
}


class Reverse implements Comparator<Integer>{
	public int compare(Integer arg0, Integer arg1) {
		return arg1 - arg0;
	}
}

class Node{
	int id;
	List<Node> edge = new ArrayList<Node>();
	public Node(int id){
		this.id = id;
	}
	public void createEdge(Node node){
		edge.add(node);
	}
}


class NodeW{
	int id;
	List<NodeW> edge = new ArrayList<NodeW>();
	List<Integer> costList = new ArrayList<Integer>();
	public NodeW(int id) {
		this.id = id;
	}
	public void createEdge(NodeW node, int cost) {
		edge.add(node);
		costList.add(cost);
	}
}

class Range<T extends Comparable<T>> implements Comparable<Range<T>>{
	T start;
	T end;
	public Range(T start, T end){
		this.start = start;
		this.end = end;
	}
	public boolean inRange(T val){
		if(start.compareTo(val) <= 0 && end.compareTo(val) >= 0){
			return true;
		}
		return false;
	}
	public boolean isCommon(Range<T> range){
		if(inRange(range.start) || inRange(range.end) || range.inRange(start)){
			return true;
		}
		return false;
	}
	public Range<T> connect(Range<T> range){
		if(!isCommon(range)) return null;
		Range<T> res = new Range<T>(start.compareTo(range.start) <= 0 ? start : range.start,
				end.compareTo(range.end) >= 0 ? end : range.end);
		return res;
	}
	public boolean connectToThis(Range<T> range){
		if(!isCommon(range)) return false;
		start = start.compareTo(range.start) <= 0 ? start : range.start;
		end = end.compareTo(range.end) >= 0 ? end : range.end;
		return true;
	}
	@Override
	public int compareTo(Range<T> range) {
		int res = start.compareTo(range.start);
		if(res == 0) return end.compareTo(range.end);
		return res;
	}
	public String toString(){
		return "["+start+","+end+"]";
	}
}

class RangeSet<T extends Comparable<T>>{
	TreeSet<Range<T>> ranges = new TreeSet<Range<T>>();
	public void add(Range<T> range){
		Range<T> con = ranges.floor(range);
		if(con != null){
			if(con.connectToThis(range))
				range = con;
		}
		con = ranges.ceiling(range);
		while(con != null && range.connectToThis(con)){
			ranges.remove(con);
			con = ranges.ceiling(range);
		}
		ranges.add(range);
	}
	public String toString(){
		StringBuilder bld = new StringBuilder();
		for(Range<T> r: ranges){
			bld.append(r+"\n");
		}
		return bld.toString();
	}
}


class MyMath{
	public final static double PIhalf = Math.PI/2.0;
	public static double pAngle(double x, double y){
		// ベクトル(1, 0)と(x, y)とのなす角を返す(rad:0 to 2pi)
		if(x == 0){
			if(y == 0){
				System.err.println("pAngle error: zero vector.");
				return 0;
			}else if(y < 0){
				return PIhalf*3.0;
			}else{
				return PIhalf;
			}
		}
		double rad = Math.atan(y/x);
		if(rad < 0){
			rad += Math.PI*2.0;
		}
		return rad;
	}
	public static long fact(long n){
		long res = 1;
		while(n > 0){
			res *= n--;
		}
		return res;
	}
	public static long[][] pascalT(int n){
		long[][] tri = new long[n][];
		for(int i=0; i<n; i++){
			tri[i] = new long[i+1];
			for(int j=0; j<i+1; j++){
				if(j == 0 || j == i){
					tri[i][j] = 1;
				}else{
					tri[i][j] = tri[i-1][j-1] + tri[i-1][j];
				}
			}
		}
		return tri;
	}

	// 最大公約数
	static int gcd(int a, int b){
		return b == 0 ? a : gcd(b, a % b);
	}

	// 最小公倍数
	static int lcm(int a, int b){
		return a * b / gcd(a, b);
	}
}

class ContestScanner{
	private BufferedReader reader;
	private String[] line;
	private int idx;
	public ContestScanner() throws FileNotFoundException{
		reader = new BufferedReader(new InputStreamReader(System.in));
	}

	public ContestScanner(String filename) throws FileNotFoundException{
		reader = new BufferedReader(new InputStreamReader(new FileInputStream(filename)));
	}
	
	public String nextToken() throws IOException{
		if(line == null || line.length <= idx){
			line = reader.readLine().trim().split(" ");
			idx = 0;
		}
		return line[idx++];
	}
	public long nextLong() throws IOException, NumberFormatException{
		return Long.parseLong(nextToken());
	}
	public int nextInt() throws NumberFormatException, IOException{
		return (int)nextLong();
	}
	public double nextDouble() throws NumberFormatException, IOException{
		return Double.parseDouble(nextToken());
	}
}

yukicoder

結果

テストケース

ソースコード