結果
| 問題 | No.340 雪の足跡 |
| ユーザー |
 りあん
|
| 提出日時 | 2016-02-08 15:00:33 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
TLE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 7,355 bytes |
| コンパイル時間 | 978 ms |
| コンパイル使用メモリ | 110,080 KB |
| 実行使用メモリ | 161,496 KB |
| 最終ジャッジ日時 | 2024-09-21 21:46:30 |
| 合計ジャッジ時間 | 15,074 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 5 |
| other | AC * 27 TLE * 5 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;using System.Collections.Generic;using System.Linq;using System.IO;using System.IO.Compression;using System.Text;namespace Solver{class Program{const int M = 1000000007;const double eps = 1e-9;static int[] dd = { 0, 1, 0, -1, 0 };static void Main(){var sw = new System.IO.StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };var sc = new Scan();int w, h, n;sc.Multi(out w, out h, out n);var l = new bool[w * h][];var dist = new int[w * h];var th = new int[w * h][];for (int i = 0; i < w * h; i++){l[i] = new bool[4];th[i] = new int[2];dist[i] = M;}for (int i = 0; i < n; i++){int m = sc.Int;var b = sc.IntArr;for (int j = 0; j < m; j++){var sm = Math.Min(b[j], b[j + 1]);var la = Math.Max(b[j], b[j + 1]);if ((la - sm) % w == 0){++th[sm][0];--th[la][0];}else{++th[sm][1];--th[la][1];}}}for (int i = 0; i < w; ++i){int sum = 0;for (int j = i; j < w * h; j += w){sum += th[j][0];if (sum > 0){l[j][0] = true;l[j + w][2] = true;}}}for (int i = 0; i < w * h; i += w){int sum = 0;for (int j = i; j < w + i; ++j){sum += th[j][1];if (sum > 0){l[j][1] = true;l[j + 1][3] = true;}}}var q = new Queue<int>();dist[0] = 0;q.Enqueue(0);while (q.Count > 0){var p = q.Dequeue();if (l[p][0] && dist[p + w] > dist[p] + 1){dist[p + w] = dist[p] + 1;q.Enqueue(p + w);}if (l[p][1] && dist[p + 1] > dist[p] + 1){dist[p + 1] = dist[p] + 1;q.Enqueue(p + 1);}if (l[p][2] && dist[p - w] > dist[p] + 1){dist[p - w] = dist[p] + 1;q.Enqueue(p - w);}if (l[p][3] && dist[p - 1] > dist[p] + 1){dist[p - 1] = dist[p] + 1;q.Enqueue(p - 1);}}if (dist[w * h - 1] >= M)sw.WriteLine("Odekakedekinai..");elsesw.WriteLine(dist[w * h - 1]);sw.Flush();}static void swap<T>(ref T a, ref T b){var t = a;a = b;b = t;}static bool isprime(long n){if (n == 1) return false;for (long i = 2; i * i <= n; i++)if (n % i == 0)return false;return true;}static string strsort(string s){var c = s.ToCharArray();Array.Sort(c);return string.Join("", c);}static string strswap(string s, int i, int j){var c = s.ToCharArray();c[i] = s[j];c[j] = s[i];return string.Join("", c);}static T[] copy<T>(T[] a){var ret = new T[a.Length];for (int i = 0; i < a.Length; i++) ret[i] = a[i];return ret;}}class Scan{public int Int { get { return int.Parse(Console.ReadLine().Trim()); } }public long Long { get { return long.Parse(Console.ReadLine().Trim()); } }public string Str { get { return Console.ReadLine().Trim(); } }public int[] IntArr { get { return Console.ReadLine().Trim().Split().Select(int.Parse).ToArray(); } }public int[] IntArrWithSep(char sep) { return Console.ReadLine().Trim().Split(sep).Select(int.Parse).ToArray(); }public long[] LongArr { get { return Console.ReadLine().Trim().Split().Select(long.Parse).ToArray(); } }public double[] DoubleArr { get { return Console.ReadLine().Split().Select(double.Parse).ToArray(); } }public string[] StrArr { get { return Console.ReadLine().Trim().Split(); } }public List<int> IntList { get { return Console.ReadLine().Trim().Split().Select(int.Parse).ToList(); } }public List<long> LongList { get { return Console.ReadLine().Trim().Split().Select(long.Parse).ToList(); } }public void Multi(out int a, out int b) { var arr = IntArr; a = arr[0]; b = arr[1]; }public void Multi(out int a, out int b, out int c) { var arr = IntArr; a = arr[0]; b = arr[1]; c = arr[2]; }public void Multi(out int a, out int b, out int c, out int d) { var arr = IntArr; a = arr[0]; b = arr[1]; c = arr[2]; d = arr[3]; }public void Multi(out int a, out string b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1]; }public void Multi(out int a, out int b, out string c) { var arr = StrArr; a = int.Parse(arr[0]); b = int.Parse(arr[1]); c = arr[2]; }public void Multi(out int a, out char b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1][0]; }public void Multi(out char a, out int b) { var arr = StrArr; a = arr[0][0]; b = int.Parse(arr[1]); }public void Multi(out long a, out long b) { var arr = LongArr; a = arr[0]; b = arr[1]; }public void Multi(out long a, out int b) { var arr = LongArr; a = arr[0]; b = (int)arr[1]; }public void Multi(out int a, out long b) { var arr = LongArr; a = (int)arr[0]; b = arr[1]; }public void Multi(out string a, out string b) { var arr = StrArr; a = arr[0]; b = arr[1]; }}class mymath{public bool isprime(long a){if (a < 2) return false;for (long i = 2; i * i <= a; i++)if (a % i == 0)return false;return true;}public long powmod(long a, long b, long M){if (a == 0) return 0;if (b == 0) return 1;if (b == 1) return a % M;var t = powmod(a, b / 2, M);if ((b & 1) == 0) return t * t % M;else return t * t % M * a % M;}public long gcd(long a, long b){while (b != 0){var t = a % b;a = b;b = t;}return a;}public long lcm(int a, int b) { return a * (long)b / gcd(a, b); }}}