結果
| 問題 |
No.34 砂漠の行商人
|
| コンテスト | |
| ユーザー |
 ぴろず
|
| 提出日時 | 2014-12-17 20:54:35 |
| 言語 | Java (openjdk 23) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 5,955 bytes |
| コンパイル時間 | 2,379 ms |
| コンパイル使用メモリ | 79,644 KB |
| 実行使用メモリ | 736,308 KB |
| 最終ジャッジ日時 | 2024-06-12 01:05:13 |
| 合計ジャッジ時間 | 21,492 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 4 WA * 3 MLE * 2 -- * 17 |
ソースコード
package no034;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
public class Main {
public static final int[] D = {1,0,-1,0};
public static final int MAX = 199*9+1;
public static void main(String[] args) {
IO io = new IO();
int n = io.nextInt();
int v = io.nextInt();
int sj = io.nextInt()-1;
int si = io.nextInt()-1;
int gj = io.nextInt()-1;
int gi = io.nextInt()-1;
int[][] map = io.matrixInt(n, n);
Graph g = new Graph(n*n*MAX);
for(int i=0;i<n;i++) {
for(int j=0;j<n;j++) {
for(int k=0;k<4;k++) {
int ni = i + D[k];
int nj = j + D[3-k];
if (ni < 0 || ni >= n || nj < 0 || nj >= n) {
continue;
}
for(int l=0;l<MAX-map[ni][nj];l++) {
g.addEdge(i+j*n+l*n*n, ni+nj*n+(l+map[ni][nj])*n*n);
}
}
}
}
int[] dist = g.minDistQueue(si+sj*n);
int ans = Graph.INF;
for(int i=0;i<Math.min(v, MAX);i++) {
ans = Math.min(ans,dist[gi+gj*n+i*n*n]);
}
if (ans == Graph.INF) {
System.out.println(-1);
}else{
System.out.println(ans);
}
}
}
class Graph {
public static final int INF = 1<<29;
int n;
int[][] graph;
int[] edges;
public Graph(int n) {
this.n = n;
this.graph = new int[n][4];
this.edges = new int[n];
}
public void addEdge(int from,int to) {
graph[from][edges[from]++] = to;
}
//O(E) all cost is 0 or 1
public int[] minDistQueue(int s) {
int[] d = new int[n];
Arrays.fill(d, INF);
ArrayDeque<Integer> q = new ArrayDeque<Integer>();
q.add(s);
d[s] = 0;
while(!q.isEmpty()) {
int v = q.pollFirst();
for(Integer e:graph[v]) {
if (d[v] + 1 < d[e]) {
d[e] = d[v] + 1;
q.addLast(e);
}
}
}
return d;
}
}
class IO {
private final InputStream in;
private final PrintWriter out = new PrintWriter(System.out);
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
public IO() { this(System.in);}
public IO(InputStream source) { this.in = source;}
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
private void skipNewLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++;}
public boolean hasNext() { skipUnprintable(); return hasNextByte();}
public boolean hasNextLine() { skipNewLine(); return hasNextByte();}
public String next() {
if (!hasNext()) {
throw new NoSuchElementException();
}
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public char[] nextCharArray(int len) {
char[] s = new char[len];
if (!hasNext()) {
throw new NoSuchElementException();
}
int i = 0;
int b = readByte();
while(isPrintableChar(b)) {
if (i == len) {
throw new InputMismatchException();
}
s[i++] = (char) b;
b = readByte();
}
return s;
}
public String nextLine() {
if (!hasNextLine()) {
throw new NoSuchElementException();
}
StringBuilder sb = new StringBuilder();
int b = readByte();
while(!isNewLine(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) {
throw new NoSuchElementException();
}
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
throw new NumberFormatException();
}
return (int) nl;
}
public char nextChar() {
if (!hasNext()) {
throw new NoSuchElementException();
}
return (char) readByte();
}
public double nextDouble() { return Double.parseDouble(next());}
public int[] arrayInt(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
public long[] arrayLong(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
public double[] arrayDouble(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
public void arrayInt(int[]... a) {for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
public int[][] matrixInt(int n,int m) { int[][] a = new int[n][m]; for(int i=0;i<n;i++) a[i] = arrayInt(m); return a;}
public char[][] charMap(int n,int m) { char[][] a = new char[n][m]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
public void println(long x) { out.println(x);}
public void println(double x) { out.println(x);}
public void println(String s) { out.println(s);}
public void println() { out.println(); }
public void print(long x) { out.print(x); }
public void print(double x) { out.print(x); }
public void print(String s) { out.print(s); }
public void print(char c) {out.print(c);}
public void flush() {out.flush(); }
}