結果
| 問題 |
No.340 雪の足跡
|
| コンテスト | |
| ユーザー |
 ぴろず
|
| 提出日時 | 2016-01-29 22:58:03 |
| 言語 | Java (openjdk 23) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 6,438 bytes |
| コンパイル時間 | 2,580 ms |
| コンパイル使用メモリ | 80,260 KB |
| 実行使用メモリ | 289,164 KB |
| 最終ジャッジ日時 | 2024-09-21 18:31:07 |
| 合計ジャッジ時間 | 21,038 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 5 |
| other | AC * 25 TLE * 7 |
ソースコード
package no340;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
public class Main {
public static void main(String[] args) {
IO io = new IO();
int w = io.nextInt();
int h = io.nextInt();
int n = io.nextInt();
int[][] vert = new int[h][w];
int[][] hori = new int[h][w];
for(int i=0;i<n;i++) {
int m = io.nextInt();
int[] b = io.nextIntArray(m+1);
for(int j=0;j<m;j++) {
int i1 = b[j] / w;
int j1 = b[j] % w;
int i2 = b[j+1] / w;
int j2 = b[j+1] % w;
if (i1 == i2) { //horizontal
int min = Math.min(j1, j2);
int max = Math.max(j1, j2);
hori[i1][min] += 1;
if (max < w - 1) {
hori[i1][max + 1] -= 1;
}
}else{ //vertical
int min = Math.min(i1, i2);
int max = Math.max(i1, i2);
vert[min][j1] += 1;
if (max < h - 1) {
vert[max+1][j1] -= 1;
}
}
}
}
// System.out.println(Arrays.deepToString(vert));
// System.out.println(Arrays.deepToString(hori));
for(int i=0;i<h;i++) {
for(int j=0;j<w-1;j++) {
hori[i][j+1] += hori[i][j];
}
}
for(int j=0;j<w;j++) {
for(int i=0;i<h-1;i++) {
vert[i+1][j] += vert[i][j];
}
}
// System.out.println(Arrays.deepToString(vert));
// System.out.println(Arrays.deepToString(hori));
Graph g = new Graph(h*w);
for(int i=0;i<h;i++) {
for(int j=0;j<w;j++) {
if (i < h - 1 && vert[i][j] >= 1 && vert[i+1][j] >= 1) {
g.addBidirectionalEdge(i * w + j, (i + 1) * w + j, 1);
}
if (j < w - 1 && hori[i][j] >= 1 && hori[i][j+1] >= 1) {
g.addBidirectionalEdge(i * w + j, i * w + j + 1, 1);
}
}
}
int dist = g.minDistQueue(0)[w*h-1];
System.out.println(dist >= Graph.INF ? "Odekakedekinai.." : dist);
}
}
class Graph {
public static final int INF = 1<<29;
int n;
ArrayList<Edge>[] graph;
@SuppressWarnings("unchecked")
public Graph(int n) {
this.n = n;
this.graph = new ArrayList[n];
for(int i=0;i<n;i++) {
graph[i] = new ArrayList<Edge>();
}
}
public void addBidirectionalEdge(int from,int to,int cost) {
addEdge(from,to,cost);
addEdge(to,from,cost);
}
public void addEdge(int from,int to,int cost) {
graph[from].add(new Edge(to, cost));
}
//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(Edge e:graph[v]) {
int u = e.to;
if (d[v] + e.cost < d[u]) {
d[u] = d[v] + e.cost;
if (e.cost == 0) {
q.addFirst(u);
}else{
q.addLast(u);
}
}
}
}
return d;
}
class Edge {
int to;
int cost;
public Edge(int to,int cost) {
this.to = to;
this.cost = cost;
}
}
}
class IO extends PrintWriter {
private final InputStream in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
public IO() { this(System.in);}
public IO(InputStream source) { super(System.out); 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';}
public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; 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) {
if (!hasNext()) {
throw new NoSuchElementException();
}
char[] s = new char[len];
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[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
public void nextIntArrays(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[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}