結果

問題 No.323 yuki国
ユーザー threepipes_sthreepipes_s
提出日時 2015-12-18 23:39:41
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,412 ms / 5,000 ms
コード長 4,347 bytes
コンパイル時間 2,514 ms
コンパイル使用メモリ 77,572 KB
実行使用メモリ 58,784 KB
最終ジャッジ日時 2023-09-10 21:23:52
合計ジャッジ時間 24,109 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 46 ms
49,684 KB
testcase_01 AC 51 ms
50,816 KB
testcase_02 AC 46 ms
49,572 KB
testcase_03 AC 139 ms
55,128 KB
testcase_04 AC 78 ms
51,704 KB
testcase_05 AC 93 ms
55,792 KB
testcase_06 AC 76 ms
51,608 KB
testcase_07 AC 45 ms
49,616 KB
testcase_08 AC 699 ms
57,844 KB
testcase_09 AC 514 ms
56,196 KB
testcase_10 AC 45 ms
49,712 KB
testcase_11 AC 52 ms
48,100 KB
testcase_12 AC 49 ms
49,944 KB
testcase_13 AC 720 ms
57,848 KB
testcase_14 AC 839 ms
57,848 KB
testcase_15 AC 949 ms
57,792 KB
testcase_16 AC 1,412 ms
58,088 KB
testcase_17 AC 1,031 ms
57,396 KB
testcase_18 AC 448 ms
57,724 KB
testcase_19 AC 771 ms
57,396 KB
testcase_20 AC 1,195 ms
57,832 KB
testcase_21 AC 1,240 ms
57,724 KB
testcase_22 AC 1,277 ms
57,852 KB
testcase_23 AC 1,231 ms
58,784 KB
testcase_24 AC 901 ms
57,680 KB
testcase_25 AC 949 ms
57,336 KB
testcase_26 AC 1,264 ms
58,040 KB
testcase_27 AC 1,229 ms
58,124 KB
testcase_28 AC 900 ms
58,112 KB
testcase_29 AC 847 ms
57,300 KB
testcase_30 AC 46 ms
49,728 KB
testcase_31 AC 54 ms
49,780 KB
testcase_32 AC 71 ms
51,852 KB
testcase_33 AC 58 ms
50,072 KB
testcase_34 AC 88 ms
51,412 KB
testcase_35 AC 45 ms
49,620 KB
testcase_36 AC 70 ms
51,548 KB
testcase_37 AC 68 ms
51,080 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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.BitSet;
import java.util.HashMap;
import java.util.PriorityQueue;
import java.util.Queue;
 
public class Main {
	public static void main(String[] args) throws NumberFormatException,
	IOException {Solve solve = new Solve();solve.solve();}
}
class Solve{
    int h, w;
    void solve() throws NumberFormatException, IOException{
        final ContestScanner in = new ContestScanner();
        Writer out = new Writer();
        h = in.nextInt();
        w = in.nextInt();
        int a = in.nextInt();
        int sy = in.nextInt();
        int sx = in.nextInt();
        int b = in.nextInt();
        int gy = in.nextInt();
        int gx = in.nextInt();
        char[][] map = new char[h][];
        for(int i=0; i<h; i++){
            map[i] = in.nextToken().toCharArray();
        }
        BitSet used = new BitSet(h*w*1111);
        Queue<Integer> qu = new PriorityQueue<>();
        final int[] dx = {1, 0, -1, 0};
        final int[] dy = {0, 1, 0, -1};
        qu.add(id(sy, sx, a));
        final int mask = (1<<6)-1;
        while(!qu.isEmpty()){
        	int p = qu.poll();
            if(used.get(p)) continue;
            used.set(p);
            final int s = p>>12;
        	final int y = (p>>6)&mask;
        	final int x = p&mask;
//        	System.out.println("("+x+","+y+","+s+")");
            for(int i=0; i<4; i++){
                final int ny = dy[i]+y;
                final int nx = dx[i]+x;
                if(out(ny, nx)) continue;
//                if(map[ny][nx]=='.'&&s==1) continue;
                int ns = s+(map[ny][nx]=='.'?-1:1);
                if(ns<=0||ns>=1111) continue;
                qu.add(id(ny, nx, ns));
            }
        }

        if(used.get(b<<12|gy<<6|gx)){
            System.out.println("Yes");
            return;
        }
        System.out.println("No");
    }
    
    int id(int y, int x, int s){
    	return s<<12|y<<6|x;
    }
    
    int dist(int x1, int y1, int x2, int y2){
        return Math.abs(x1-x2) + Math.abs(y1-y2);
    }
    
    boolean out(int y, int x){
        return y<0||y>=h||x<0||x>=w;
    }
}
//
//class Pos implements Comparable<Pos>{
//    int id, x, y, s;
//    Pos(int x, int y, int s){
//        this.x = x;
//        this.y = y;
//        this.s = s;
//        id = y<<6|x;
//    }
//    @Override
//    public int compareTo(Pos o) {
//        return o.s-s;
//    }
//    @Override
//    public String toString() {
//        return "("+x+","+y+","+s+")";
//    }
//}

class MultiSet<T> extends HashMap<T, Integer>{
	@Override
	public Integer get(Object key){return containsKey(key)?super.get(key):0;}
	public void add(T key,int v){put(key,get(key)+v);}
	public void add(T key){put(key,get(key)+1);}
	public void sub(T key){
		final int num = get(key);
		if(num==1) remove(key);
		else put(key, num-1);
	}
}
class Timer{
	long time;
	public void set(){time = System.currentTimeMillis();}
	public long stop(){return System.currentTimeMillis()-time;}
}
class Writer extends PrintWriter{
	public Writer(String filename) throws IOException
	{super(new BufferedWriter(new FileWriter(filename)));}
	public Writer() throws IOException{super(System.out);}
}
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 String readLine() throws IOException{return reader.readLine();}
	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());}
}
0