結果
| 問題 |
No.340 雪の足跡
|
| コンテスト | |
| ユーザー |
 eitaho
|
| 提出日時 | 2016-03-23 03:06:58 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 7,744 bytes |
| コンパイル時間 | 2,717 ms |
| コンパイル使用メモリ | 112,256 KB |
| 実行使用メモリ | 169,740 KB |
| 最終ジャッジ日時 | 2024-10-01 19:25:29 |
| 合計ジャッジ時間 | 24,931 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 5 |
| other | AC * 22 TLE * 10 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;
using System.IO;
using System.Linq;
using System.Text;
using System.Collections.Generic;
using System.Diagnostics;
using System.Numerics;
using Enu = System.Linq.Enumerable;
class Program
{
static readonly string Impossible = "Odekakedekinai..";
public void Solve()
{
int W = Reader.Int(), H = Reader.Int(), N = Reader.Int();
var table = Reader.IntTable(N * 2);
var dij = new Dijkstra(H * W);
long[][] row = new long[H][];
long[][] col = new long[W][];
for (int r = 0; r < H; r++)
row[r] = new long[(W + 63) / 64];
for (int c = 0; c < W; c++)
col[c] = new long[(H + 63) / 64];
for (int ti = 1; ti < N * 2; ti += 2)
{
var t = table[ti];
for (int i = 0; i + 1 < t.Length; i++)
{
int r = t[i] / W, c = t[i] % W;
int nr = t[i + 1] / W, nc = t[i + 1] % W;
if (Math.Sign(nr - r) != 0)
Paint(col[c], Math.Min(r, nr), Math.Max(r, nr));
else
Paint(row[r], Math.Min(c, nc), Math.Max(c, nc));
}
}
for (int r = 0; r < H; r++)
for (int c = 0; c + 1 < W; c++)
if ((row[r][c / 64] >> c % 64 & 1) == 1 && (row[r][(c + 1) / 64] >> (c + 1) % 64 & 1) == 1)
{
dij.AddEdge(r * W + c, r * W + c + 1, 1);
dij.AddEdge(r * W + c + 1, r * W + c, 1);
}
for (int c = 0; c < W; c++)
for (int r = 0; r + 1 < H; r++)
if ((col[c][r / 64] >> r % 64 & 1) == 1 && (col[c][(r + 1) / 64] >> (r + 1) % 64 & 1) == 1)
{
dij.AddEdge(r * W + c, (r + 1) * W + c, 1);
dij.AddEdge((r + 1) * W + c, r * W + c, 1);
}
int ans = dij.MinCost(0, H, W).Last();
Console.WriteLine(ans == Dijkstra.INF ? Impossible : ans + "");
}
private void Paint(long[] A, int from, int to)
{
if ((from >> 6) == (to >> 6))
{
A[from >> 6] |= (1L << to - from + 1) - 1 << from;
return;
}
int a = (from + 63) >> 6;
int b = to >> 6;
for (int i = from & 63; i < 64; i++)
A[from >> 6] |= 1L << i;
for (int i = a; i < b; i++)
A[i] = -1L;
A[to >> 6] |= (1L << (to + 1 & 63)) - 1;
}
class Dijkstra
{
public static readonly int INF = (int)1e9;
private readonly List<Edge>[] G;
public Dijkstra(int V)
{
G = new List<Edge>[V];
for (int i = 0; i < G.Length; i++) G[i] = new List<Edge>();
}
public void AddEdge(int from, int to, int cost)
{
G[from].Add(new Edge(to, cost));
}
public int[] MinCost(int start, int H, int W)
{
var minCost = new int[G.Length];
for (int i = 0; i < minCost.Length; i++)
minCost[i] = INF;
minCost[start] = 0;
var heap = new Heap<Vertex>();
heap.Push(new Vertex(start, 0, 0));
while (heap.Count > 0)
{
var t = heap.Pop();
int a = t.v;
var cost = t.cost;
if (cost > minCost[a]) continue;
foreach (var e in G[a])
{
int b = e.to;
var nextCost = cost + e.cost;
if (nextCost < minCost[b])
{
minCost[b] = nextCost;
int r = a / W, c = a % W;
int manhattanDist = H - 1 - r + W - 1 - c;
heap.Push(new Vertex(b, nextCost, nextCost + manhattanDist));
}
}
}
return minCost;
}
}
public struct Vertex : IComparable<Vertex>
{
public int v;
public int cost;
public int heuristic;
public Vertex(int v, int cost, int h) { this.v = v; this.cost = cost; heuristic = h; }
public int CompareTo(Vertex other) { return Math.Sign(heuristic - other.heuristic); }
}
public struct Edge
{
public int to;
public int cost;
public Edge(int to, int cost) { this.to = to; this.cost = cost; }
}
class Heap<T>
{
private const int InitialSize = 1024;
private readonly int sign;
private readonly Comparer<T> comp = Comparer<T>.Default;
private T[] A = new T[InitialSize];
public int Count { get; private set; }
public Heap(bool greater = false) { sign = greater ? 1 : -1; }
public T Peek() { return A[0]; }
public bool Empty() { return Count == 0; }
public void Push(T val)
{
if (Count == A.Length)
{
T[] next = new T[A.Length * 2];
Array.Copy(A, next, A.Length);
A = next;
}
A[Count++] = val;
int i = Count - 1;
while (i > 0)
{
int parent = (i - 1) / 2;
if (Math.Sign(comp.Compare(val, A[parent])) == sign)
{
A[i] = A[parent];
i = parent;
}
else break;
}
A[i] = val;
}
public T Pop()
{
T res = A[0];
T val = A[--Count];
if (Count == 0) return res;
int i = 0;
while (i * 2 + 1 < Count)
{
int L = i * 2 + 1;
int R = i * 2 + 2;
if (R < Count && Math.Sign(comp.Compare(A[R], A[L])) == sign) L = R;
if (Math.Sign(comp.Compare(A[L], val)) == sign) { A[i] = A[L]; i = L; }
else break;
}
A[i] = val;
return res;
}
}
}
class Entry { static void Main() { new Program().Solve(); } }
class Reader
{
private static TextReader reader = Console.In;
private static readonly char[] separator = { ' ' };
private static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries;
private static string[] A = new string[0];
private static int i;
private static void Init() { A = new string[0]; }
public static void Set(TextReader r) { reader = r; Init(); }
public static void Set(string file) { reader = new StreamReader(file); Init(); }
public static bool HasNext() { return CheckNext(); }
public static string String() { return Next(); }
public static int Int() { return int.Parse(Next()); }
public static long Long() { return long.Parse(Next()); }
public static double Double() { return double.Parse(Next()); }
public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); }
public static int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); }
public static int[][] IntTable(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); }
public static string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Next()).ToArray(); }
public static string Line() { return reader.ReadLine().Trim(); }
private static string[] Split(string s) { return s.Split(separator, op); }
private static string Next() { CheckNext(); return A[i++]; }
private static bool CheckNext()
{
if (i < A.Length) return true;
string line = reader.ReadLine();
if (line == null) return false;
if (line == "") return CheckNext();
A = Split(line);
i = 0;
return true;
}
}