結果
| 問題 | No.340 雪の足跡 |
| ユーザー |
 紙ぺーぱー
|
| 提出日時 | 2016-01-29 23:26:58 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 10,293 bytes |
| コンパイル時間 | 2,569 ms |
| コンパイル使用メモリ | 118,256 KB |
| 実行使用メモリ | 97,156 KB |
| 最終ジャッジ日時 | 2023-10-21 17:29:30 |
| 合計ジャッジ時間 | 16,568 ms |
|
ジャッジサーバーID （参考情報） |
judge11 / judge14 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 27 ms
24,984 KB |
| testcase_01 | AC | 26 ms
24,972 KB |
| testcase_02 | AC | 26 ms
24,784 KB |
| testcase_03 | AC | 27 ms
24,984 KB |
| testcase_04 | AC | 26 ms
24,788 KB |
| testcase_05 | AC | 26 ms
24,980 KB |
| testcase_06 | RE | - |
| testcase_07 | AC | 26 ms
24,784 KB |
| testcase_08 | AC | 26 ms
24,784 KB |
| testcase_09 | RE | - |
| testcase_10 | WA | - |
| testcase_11 | AC | 29 ms
24,972 KB |
| testcase_12 | RE | - |
| testcase_13 | AC | 29 ms
24,976 KB |
| testcase_14 | RE | - |
| testcase_15 | AC | 95 ms
34,452 KB |
| testcase_16 | RE | - |
| testcase_17 | AC | 111 ms
35,360 KB |
| testcase_18 | AC | 103 ms
35,360 KB |
| testcase_19 | AC | 111 ms
35,360 KB |
| testcase_20 | AC | 544 ms
97,156 KB |
| testcase_21 | RE | - |
| testcase_22 | AC | 97 ms
94,900 KB |
| testcase_23 | AC | 932 ms
97,152 KB |
| testcase_24 | WA | - |
| testcase_25 | AC | 404 ms
96,948 KB |
| testcase_26 | AC | 75 ms
27,024 KB |
| testcase_27 | RE | - |
| testcase_28 | AC | 94 ms
32,144 KB |
| testcase_29 | TLE | - |
| testcase_30 | RE | - |
| testcase_31 | TLE | - |
| testcase_32 | TLE | - |
| testcase_33 | TLE | - |
| testcase_34 | TLE | - |
| testcase_35 | TLE | - |
| testcase_36 | TLE | - |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;
using System.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
using Point = System.Numerics.Complex;
using Number = System.Int64;
namespace Program
{
public class Solver
{
public void Solve()
{
var w = sc.Integer();
var h = sc.Integer();
var n = sc.Integer();
var map = Enumerate(h * w, x => 0);
var U = Enumerate(w, x => new RangeAddFenwickTree(h));
var D = Enumerate(w, x => new RangeAddFenwickTree(h));
var R = Enumerate(h, x => new RangeAddFenwickTree(w));
var L = Enumerate(h, x => new RangeAddFenwickTree(w));
for (int i = 0; i < n; i++)
{
var m = sc.Integer();
var a = sc.Integer(m + 1);
for (int j = 0; j < m; j++)
{
var u = a[j];
var v = a[j + 1];
var diff = Math.Abs(v - u);
var x = u / w;
var y = u % w;
var nx = v / w;
var ny = v % w;
if (diff % w == 0)
{
D[y].Add(Math.Min(x, nx) + 1, Math.Max(x, nx), 1);
U[y].Add(Math.Min(x, nx) + 2, Math.Max(x, nx) + 1, 1);
}
else
{
R[x].Add(Math.Min(y, ny) + 1, Math.Max(y, ny), 1);
L[x].Add(Math.Min(y, ny) + 2, Math.Max(y, ny) + 1, 1);
}
}
}
var q = new Queue<int>();
var dist = Enumerate(w * h, x => 1 << 30);
dist[0] = 0;
q.Enqueue(0);
int[] dx = { 1, 0, 0, -1 };
int[] dy = { 0, 1, -1, 0 };
while (q.Any())
{
var p = q.Dequeue();
var x = p / w;
var y = p % w;
Debug.WriteLine(p);
for (int i = 0; i < 4; i++)
{
var nx = x + dx[i];
var ny = y + dy[i];
if (nx < 0 || nx >= h || ny < 0 || ny >= w) continue;
var to = nx * w + ny;
if (i == 0)
{
if (D[y][x + 1, x + 1] == 0) continue;
}
if (i == 3)
{
if (U[y][x + 1, x + 1] == 0) continue;
}
if (i == 1)
{
if (R[x][y + 1, y + 1] == 0) continue;
}
if (i == 2)
{
if (L[y][y + 1, y + 1] == 0) continue;
}
if (dist[to] > dist[p] + 1)
{
dist[to] = dist[p] + 1;
q.Enqueue(to);
}
}
}
if (dist[w * h - 1] >= 1 << 20)
IO.Printer.Out.WriteLine("Odekakedekinai..");
else IO.Printer.Out.WriteLine(dist[w * h - 1]);
}
public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
}
}
#region main
static class Ex
{
static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
static public void Main()
{
var solver = new Program.Solver();
solver.Solve();
Program.IO.Printer.Out.Flush();
}
}
#endregion
#region Ex
namespace Program.IO
{
using System.IO;
using System.Text;
using System.Globalization;
public class Printer : StreamWriter
{
static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }
public static Printer Out { get; set; }
public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
}
public class StreamScanner
{
public StreamScanner(Stream stream) { str = stream; }
public readonly Stream str;
private readonly byte[] buf = new byte[1024];
private int len, ptr;
public bool isEof = false;
public bool IsEndOfStream { get { return isEof; } }
private byte read()
{
if (isEof) return 0;
if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
return buf[ptr++];
}
public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; }
public string Scan()
{
var sb = new StringBuilder();
for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
sb.Append(b);
return sb.ToString();
}
public string ScanLine()
{
var sb = new StringBuilder();
for (var b = Char(); b != '\n'; b = (char)read())
if (b == 0) break;
else if (b != '\r') sb.Append(b);
return sb.ToString();
}
public long Long()
{
if (isEof) return long.MinValue;
long ret = 0; byte b = 0; var ng = false;
do b = read();
while (b != 0 && b != '-' && (b < '0' || '9' < b));
if (b == 0) return long.MinValue;
if (b == '-') { ng = true; b = read(); }
for (; true; b = read())
{
if (b < '0' || '9' < b)
return ng ? -ret : ret;
else ret = ret * 10 + b - '0';
}
}
public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
public double Double() { var s = Scan(); return s != "" ? double.Parse(s, CultureInfo.InvariantCulture) : double.NaN; }
private T[] enumerate<T>(int n, Func<T> f)
{
var a = new T[n];
for (int i = 0; i < n; ++i) a[i] = f();
return a;
}
public char[] Char(int n) { return enumerate(n, Char); }
public string[] Scan(int n) { return enumerate(n, Scan); }
public double[] Double(int n) { return enumerate(n, Double); }
public int[] Integer(int n) { return enumerate(n, Integer); }
public long[] Long(int n) { return enumerate(n, Long); }
}
}
#endregion
#region Compair
static public class Pair
{
static public Pair<FT, ST> Create<FT, ST>(FT f, ST s)
where FT : IComparable<FT>
where ST : IComparable<ST>
{ return new Pair<FT, ST>(f, s); }
static public Pair<FT, ST> Min<FT, ST>(Pair<FT, ST> p, Pair<FT, ST> q)
where FT : IComparable<FT>
where ST : IComparable<ST>
{ return (p.CompareTo(q) <= 0) ? p : q; }
static public Pair<FT, ST> Max<FT, ST>(Pair<FT, ST> p, Pair<FT, ST> q)
where FT : IComparable<FT>
where ST : IComparable<ST>
{ return (p.CompareTo(q) >= 0) ? p : q; }
}
public struct Pair<FT, ST> : IComparable<Pair<FT, ST>>
where FT : IComparable<FT>
where ST : IComparable<ST>
{
public FT x;
public ST y;
public Pair(FT f, ST s) : this() { x = f; y = s; }
public int CompareTo(Pair<FT, ST> other)
{
var cmp = x.CompareTo(other.x);
return cmp != 0 ? cmp : y.CompareTo(other.y);
}
public override string ToString() { return string.Format("{0} {1}", x, y); }
}
#endregion
#region FenwickTree
[System.Diagnostics.DebuggerDisplay("Data={ToString()}")]
public class FenwickTree
{
int n;
long[] bit;
int max = 1;
public FenwickTree(int size)
{
n = size; bit = new long[n + 1];
while ((max << 1) <= n) max <<= 1;
}
/// <summary>sum[a,b]</summary>
public long this[int i, int j] { get { return this[j] - this[i - 1]; } }
/// <summary>sum[0,i]</summary>
public long this[int i] { get { long s = 0; for (; i > 0; i -= i & -i) s += bit[i]; return s; } }
public int LowerBound(long w)
{
if (w <= 0) return 0;
int x = 0;
for (int k = max; k > 0; k >>= 1)
if (x + k <= n && bit[x + k] < w)
{
w -= bit[x + k];
x += k;
}
return x + 1;
}
/// <summary>add v to bit[i]</summary>
public void Add(int i, long v)
{
if (i == 0) System.Diagnostics.Debug.Fail("BIT is 1 indexed");
for (; i <= n; i += i & -i) bit[i] += v;
}
public override string ToString() { return string.Join(",", Enumerable.Range(0, n + 1).Select(i => this[i, i])); }
}
#endregion
#region RangeAddFenwickTree
public class RangeAddFenwickTree
{
int n;
FenwickTree a, b;
public RangeAddFenwickTree(int n)
{
this.n = n;
a = new FenwickTree(n);
b = new FenwickTree(n);
}
/// <summary>Add V to[i,j]</summary>
public void Add(int i, int j, long v)
{
a.Add(i, -(i - 1) * v); a.Add(j + 1, j * v);
b.Add(i, v); b.Add(j + 1, -v);
}
/// <summary>Sum [0,i]</summary>
public long this[int i] { get { return a[i] + b[i] * i; } }
/// <summary>Sum [i,j]</summary>
public long this[int i, int j] { get { return this[j] - this[i - 1]; } }
public override string ToString() { return string.Join(",", Enumerable.Range(0, n + 1).Select(i => this[i, i])); }
}
#endregion