結果
| 問題 | No.323 yuki国 |
| ユーザー |
 りあん
|
| 提出日時 | 2015-12-17 02:15:54 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
WA
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 9,868 bytes |
| コンパイル時間 | 849 ms |
| コンパイル使用メモリ | 114,748 KB |
| 実行使用メモリ | 27,188 KB |
| 最終ジャッジ日時 | 2024-09-16 06:54:55 |
| 合計ジャッジ時間 | 2,741 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 6 |
| other | AC * 31 WA * 1 |
コンパイルメッセージ
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;
//using System.Numerics;
namespace Solver
{
class Program
{
const int M = 1000000007;
const double eps = 1e-9;
static int[] dd = { 0, 1, 0, -1, 0 };
static int h, w;
static string[] m;
static void Main()
{
var sw = new System.IO.StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
var sc = new Scan();
sc.Multi(out h, out w);
int a, si, sj, b, gi, gj;
sc.Multi(out a, out si, out sj);
sc.Multi(out b, out gi, out gj);
if ((Math.Abs(si - gi) + Math.Abs(sj - gj)) % 2 != Math.Abs(a - b) % 2)
{
Console.WriteLine("No");
return;
}
m = new string[h];
var bigger = new bool[h][];
var smaller = new bool[h][];
bool existsmaller = false, existbigger = false;
var dummy = new bool[h][];
for (int i = 0; i < h; i++)
{
bigger[i] = new bool[w];
smaller[i] = new bool[w];
dummy[i] = new bool[w];
m[i] = sc.Str;
}
for (int i = 0; i < h; i++)
{
for (int j = 0; j < w; j++)
{
if (m[i][j] == '*')
{
for (int k = 0; k < 4; k++)
{
int p = i + dd[k], q = j + dd[k + 1];
if (0 <= p && p < h && 0 <= q && q < w && m[p][q] == '*')
{
existbigger = true;
bigger[i][j] = true;
break;
}
}
}
else
{
for (int k = 0; k < 4; k++)
{
int p = i + dd[k], q = j + dd[k + 1];
if (0 <= p && p < h && 0 <= q && q < w && m[p][q] == '.')
{
existsmaller = true;
smaller[i][j] = true;
break;
}
}
}
}
}
if (Math.Abs(a - b) < 2)
{
if (check2(si, sj, a, gi, gj, b) || check(si, sj, a, false, bigger, dummy) && check(gi, gj, b, true, smaller, dummy))
{
Console.WriteLine("Yes");
return;
}
}
if (a > b)
{
if (check(gi, gj, b, true, smaller, dummy) && check(si, sj, a, false, bigger, smaller))
Console.WriteLine("Yes");
else
Console.WriteLine("No");
return;
}
if (a < b)
{
if (check(si, sj, a, false, bigger, dummy) && check(gi, gj, b, true, bigger, smaller))
Console.WriteLine("Yes");
else
Console.WriteLine("No");
return;
}
Console.WriteLine("No");
}
static bool check(int si, int sj, int a, bool rev, bool[][] g1, bool[][] g2)
{
if (a < 1) return false;
var yuki = new int[h][];
for (int i = 0; i < h; i++)
yuki[i] = new int[w];
yuki[si][sj] = a;
var qi = new Queue<int>();
var qj = new Queue<int>();
qi.Enqueue(si);
qj.Enqueue(sj);
while (qi.Count > 0)
{
int pi = qi.Dequeue(), pj = qj.Dequeue();
if (g1[pi][pj] || g2[pi][pj])
return true;
for (int k = 0; k < 4; k++)
{
int i = pi + dd[k], j = pj + dd[k + 1];
if (0 <= i && i < h && 0 <= j && j < w)
{
var aa = yuki[pi][pj] + ((m[i][j] == '*') ? 1 : -1);
if (rev)
aa = yuki[pi][pj] + ((m[pi][pj] == '*') ? -1 : 1);
if (aa > yuki[i][j])
{
yuki[i][j] = aa;
qi.Enqueue(i);
qj.Enqueue(j);
}
}
}
}
return false;
}
static bool check2(int si, int sj, int a, int gi, int gj, int b)
{
var yuki = new int[h][];
for (int i = 0; i < h; i++)
yuki[i] = new int[w];
yuki[si][sj] = a;
var qi = new Queue<int>();
var qj = new Queue<int>();
qi.Enqueue(si);
qj.Enqueue(sj);
while (qi.Count > 0)
{
int pi = qi.Dequeue(), pj = qj.Dequeue();
if (pi == gi && pj == gj && yuki[pi][pj] == b)
return true;
for (int k = 0; k < 4; k++)
{
int i = pi + dd[k], j = pj + dd[k + 1];
if (0 <= i && i < h && 0 <= j && j < w && m[pi][pj] != m[i][j])
{
var aa = yuki[pi][pj] + ((m[i][j] == '*') ? 1 : -1);
if (aa > yuki[i][j])
{
yuki[i][j] = aa;
qi.Enqueue(i);
qj.Enqueue(j);
}
}
}
}
return false;
}
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); }
}
}