結果

問題 No.323 yuki国
ユーザー threepipes_sthreepipes_s
提出日時 2015-12-18 23:21:25
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,320 bytes
コンパイル時間 3,491 ms
コンパイル使用メモリ 80,872 KB
実行使用メモリ 50,704 KB
最終ジャッジ日時 2023-10-14 14:03:06
合計ジャッジ時間 6,326 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 47 ms
49,684 KB
testcase_01 AC 47 ms
49,476 KB
testcase_02 AC 46 ms
49,568 KB
testcase_03 AC 47 ms
49,584 KB
testcase_04 AC 46 ms
50,180 KB
testcase_05 AC 47 ms
50,056 KB
testcase_06 WA -
testcase_07 AC 46 ms
49,620 KB
testcase_08 AC 47 ms
50,068 KB
testcase_09 AC 47 ms
49,556 KB
testcase_10 WA -
testcase_11 AC 48 ms
49,624 KB
testcase_12 AC 47 ms
49,560 KB
testcase_13 AC 48 ms
49,508 KB
testcase_14 AC 48 ms
49,600 KB
testcase_15 AC 58 ms
50,232 KB
testcase_16 AC 48 ms
49,536 KB
testcase_17 AC 48 ms
49,616 KB
testcase_18 AC 47 ms
49,432 KB
testcase_19 AC 48 ms
49,768 KB
testcase_20 AC 48 ms
49,760 KB
testcase_21 AC 47 ms
49,620 KB
testcase_22 AC 47 ms
49,652 KB
testcase_23 AC 47 ms
49,496 KB
testcase_24 AC 58 ms
50,656 KB
testcase_25 AC 59 ms
50,624 KB
testcase_26 AC 47 ms
49,556 KB
testcase_27 AC 48 ms
49,780 KB
testcase_28 AC 59 ms
50,628 KB
testcase_29 AC 59 ms
50,704 KB
testcase_30 AC 47 ms
49,584 KB
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 AC 47 ms
49,696 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();
        Queue<Pos> qu = new PriorityQueue<>();
        final int[] dx = {1, 0, -1, 0};
        final int[] dy = {0, 1, 0, -1};
        qu.add(new Pos(sx, sy, a));
        int max = 0;
        out:while(!qu.isEmpty()){
            Pos p = qu.poll();
            if(p.x==gx && p.y==gy){
                max = Math.max(max, p.s);
            }
            for(int i=0; i<4; i++){
                final int ny = dy[i]+p.y;
                final int nx = dx[i]+p.x;
                if(out(ny, nx)) continue;
                if(map[ny][nx]=='.'&&p.s==1) continue;
                int ns = p.s+(map[ny][nx]=='.'?-1:1);
                if(used.get(ny<<6|nx) || ns==0) continue;
                used.set(ny<<6|nx);
                if(map[p.y][p.x]=='*'&&map[ny][nx]=='*'){
                    max = ns+1200-dist(gx, gy, ny, nx);
                    break out;
                }
                qu.add(new Pos(nx, ny, ns));
            }
        }

        if(b<=max && max%2==b%2){
            System.out.println("Yes");
            return;
        }
        System.out.println("No");
    }
    
    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