結果
| 問題 | No.936 Are |
| ユーザー |
 りあん
|
| 提出日時 | 2019-11-29 23:54:08 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
WA
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 11,154 bytes |
| コンパイル時間 | 3,059 ms |
| コンパイル使用メモリ | 119,028 KB |
| 実行使用メモリ | 245,132 KB |
| 最終ジャッジ日時 | 2024-11-21 00:35:21 |
| 合計ジャッジ時間 | 23,766 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge4 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | WA | - |
| testcase_01 | AC | 386 ms
241,172 KB |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | AC | 26 ms
18,560 KB |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | WA | - |
| testcase_19 | WA | - |
| testcase_20 | WA | - |
| testcase_21 | WA | - |
| testcase_22 | WA | - |
| testcase_23 | WA | - |
| testcase_24 | WA | - |
コンパイルメッセージ
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.Threading;
using System.Text;
using System.Diagnostics;
using static util;
using P = pair<int, int>;
class Program {
static void Main(string[] args) {
var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
var solver = new Solver(sw);
// var t = new Thread(solver.solve, 1 << 26); // 64 MB
// t.Start();
// t.Join();
solver.solve();
sw.Flush();
}
}
class Solver {
StreamWriter sw;
Scan sc;
void Prt(string a) => sw.WriteLine(a);
void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a));
void Prt(params object[] a) => Prt(string.Join(" ", a));
public Solver(StreamWriter sw) {
this.sw = sw;
this.sc = new Scan();
}
long[][] imemo, tmemo;
long tak(int k, int a1, int a2, int b1, int b2) {
if (b1 + b2 == 0) return 1;
if (k == 0 || a1 + a2 == 0) return 0;
int st = ((a1 * 5 + a2) * 5 + b1) * 5 + b2;
if (tmemo[k][st] != -1) return tmemo[k][st];
long ret = 0;
long retall = 0;
bool rf = false;
{
if (b1 > 0) {
int na1 = (a1 + b1) % 5, na2 = a2;
if (na1 + na2 == 0) {
return tmemo[k][st] = 0;
}
long r = iot(k - 1, na1, na2, b1, b2);
retall += r;
if ((b1 == 0 || b2 == 0) && (b1 + b2 + na1 == 5 || b1 + b2 + na2 == 5)) {}
else {
rf = true;
ret += r;
}
}
if (b1 > 0) {
int na1 = a1, na2 = (a2 + b1) % 5;
if (na1 + na2 == 0) {
return tmemo[k][st] = 0;
}
long r = iot(k - 1, na1, na2, b1, b2);
retall += r;
if ((b1 == 0 || b2 == 0) && (b1 + b2 + na1 == 5 || b1 + b2 + na2 == 5)) {}
else {
rf = true;
ret += r;
}
}
if (b2 > 0) {
int na1 = (a1 + b2) % 5, na2 = a2;
if (na1 + na2 == 0) {
return tmemo[k][st] = 0;
}
long r = iot(k - 1, na1, na2, b1, b2);
retall += r;
if ((b1 == 0 || b2 == 0) && (b1 + b2 + na1 == 5 || b1 + b2 + na2 == 5)) {}
else {
rf = true;
ret += r;
}
}
if (b2 > 0) {
int na1 = a1, na2 = (a2 + b2) % 5;
if (na1 + na2 == 0) {
return tmemo[k][st] = 0;
}
long r = iot(k - 1, na1, na2, b1, b2);
retall += r;
if ((b1 == 0 || b2 == 0) && (b1 + b2 + na1 == 5 || b1 + b2 + na2 == 5)) {}
else {
rf = true;
ret += r;
}
}
}
{
int s = b1 + b2;
for (int i = Math.Max(0, s - 4); i <= s && i < 5; i++)
{
int j = s - i;
if (i == b1 && j == b2 || i == b2 && j == b1) continue;
long r = iot(k - 1, a1, a2, i, j);
retall += r;
if ((i == 0 || j == 0) && (i + j + a1 == 5 || i + j + a2 == 5)) {}
else {
rf = true;
ret += r;
}
}
if (s > 5) {
s -= 5;
for (int i = Math.Max(0, s - 4); i <= s && i < 5; i++)
{
int j = s - i;
if (i == b1 && j == b2 || i == b2 && j == b1) continue;
long r = iot(k - 1, a1, a2, i, j);
retall += r;
if ((i == 0 || j == 0) && (i + j + a1 == 5 || i + j + a2 == 5)) {}
else {
rf = true;
ret += r;
}
}
}
}
if (rf)
return tmemo[k][st] = ret % M;
else
return tmemo[k][st] = retall % M;
}
long iot(int k, int a1, int a2, int b1, int b2) {
if (b1 + b2 == 0) return 1;
if (k == 0 || a1 + a2 == 0) return 0;
int st = ((a1 * 5 + a2) * 5 + b1) * 5 + b2;
if (imemo[k][st] != -1) return imemo[k][st];
long ret = 0;
{
if (a1 > 0) {
ret += tak(k - 1, a1, a2, (b1 + a1) % 5, b2);
}
if (a1 > 0) {
ret += tak(k - 1, a1, a2, b1, (b2 + a1) % 5);
}
if (a2 > 0) {
ret += tak(k - 1, a1, a2, (b1 + a2) % 5, b2);
}
if (a2 > 0) {
ret += tak(k - 1, a1, a2, b1, (b2 + a2) % 5);
}
}
{
int s = a1 + a2;
for (int i = Math.Max(0, s - 4); i <= s && i < 5; i++)
{
int j = s - i;
if (i == a1 && j == a2 || i == a2 && j == a1) continue;
ret += tak(k - 1, i, j, b1, b2);
}
if (s > 5) {
s -= 5;
for (int i = Math.Max(0, s - 4); i <= s && i < 5; i++)
{
int j = s - i;
if (i == a1 && j == a2 || i == a2 && j == a1) continue;
ret += tak(k - 1, i, j, b1, b2);
}
}
}
return imemo[k][st] = ret % M;
}
public void solve() {
int n, k;
sc.Multi(out n, out k);
int a1, a2, b1, b2;
sc.Multi(out a1, out a2, out b1, out b2);
imemo = new long[k + 1][];
tmemo = new long[k + 1][];
for (int i = 0; i < k + 1; i++)
{
imemo[i] = new long[630];
tmemo[i] = new long[630];
for (int j = 0; j < 630; j++)
{
imemo[i][j] = -1;
tmemo[i][j] = -1;
}
}
if (n == 0) {
Prt(iot(k, a1, a2, b1, b2));
}
else {
Prt(tak(k, a1, a2, b1, b2));
}
}
}
class pair<T, U> : IComparable<pair<T, U>> {
public T v1;
public U v2;
public pair() : this(default(T), default(U)) {}
public pair(T v1, U v2) { this.v1 = v1; this.v2 = v2; }
public int CompareTo(pair<T, U> a) {
int c = Comparer<T>.Default.Compare(v1, a.v1);
return c != 0 ? c : Comparer<U>.Default.Compare(v2, a.v2);
}
public override string ToString() => v1 + " " + v2;
public void Deconstruct(out T a, out U b) { a = v1; b = v2; }
}
static class util {
public static readonly int M = 1000000007;
// public static readonly int M = 998244353;
public static readonly long LM = 1L << 60;
public static readonly double eps = 1e-11;
public static void DBG(string a) => Console.Error.WriteLine(a);
public static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a));
public static void DBG(params object[] a) => DBG(string.Join(" ", a));
public static void Assert(bool cond) { if (!cond) throw new Exception(); }
public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2);
public static int CompareList<T>(IList<T> a, IList<T> b) where T : IComparable<T> {
for (int i = 0; i < a.Count && i < b.Count; i++)
if (a[i].CompareTo(b[i]) != 0) return a[i].CompareTo(b[i]);
return a.Count.CompareTo(b.Count);
}
public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w;
static readonly int[] dd = { 0, 1, 0, -1 };
// static readonly string dstring = "RDLU";
public static P[] adjacents(int i, int j)
=> Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1])).ToArray();
public static P[] adjacents(int i, int j, int h, int w)
=> Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1]))
.Where(p => inside(p.v1, p.v2, h, w)).ToArray();
public static P[] adjacents(this P p) => adjacents(p.v1, p.v2);
public static P[] adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w);
public static Dictionary<T, int> compress<T>(this IEnumerable<T> a)
=> a.Distinct().OrderBy(v => v).Select((v, i) => new { v, i }).ToDictionary(p => p.v, p => p.i);
public static Dictionary<T, int> compress<T>(params IEnumerable<T>[] a) => compress(a.Aggregate(Enumerable.Union));
public static T[] inv<T>(this Dictionary<T, int> dic) {
var res = new T[dic.Count];
foreach (var item in dic) res[item.Value] = item.Key;
return res;
}
public static void swap<T>(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; }
public static void swap<T>(this IList<T> a, int i, int j) where T : struct { var t = a[i]; a[i] = a[j]; a[j] = t; }
public static T[] copy<T>(this IList<T> a) {
var ret = new T[a.Count];
for (int i = 0; i < a.Count; i++) ret[i] = a[i];
return ret;
}
}
class Scan {
StreamReader sr;
public Scan() { sr = new StreamReader(Console.OpenStandardInput()); }
public Scan(string path) { sr = new StreamReader(path); }
public int Int => int.Parse(Str);
public long Long => long.Parse(Str);
public double Double => double.Parse(Str);
public string Str => sr.ReadLine().Trim();
public pair<T, U> Pair<T, U>() {
T a; U b;
Multi(out a, out b);
return new pair<T, U>(a, b);
}
public P P => Pair<int, int>();
public int[] IntArr => StrArr.Select(int.Parse).ToArray();
public long[] LongArr => StrArr.Select(long.Parse).ToArray();
public double[] DoubleArr => StrArr.Select(double.Parse).ToArray();
public string[] StrArr => Str.Split(new[]{' '}, StringSplitOptions.RemoveEmptyEntries);
bool eq<T, U>() => typeof(T).Equals(typeof(U));
T ct<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T));
T cv<T>(string s) => eq<T, int>() ? ct<T, int>(int.Parse(s))
: eq<T, long>() ? ct<T, long>(long.Parse(s))
: eq<T, double>() ? ct<T, double>(double.Parse(s))
: eq<T, char>() ? ct<T, char>(s[0])
: ct<T, string>(s);
public void Multi<T>(out T a) => a = cv<T>(Str);
public void Multi<T, U>(out T a, out U b)
{ var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); }
public void Multi<T, U, V>(out T a, out U b, out V c)
{ var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); }
public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d)
{ var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); }
public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e)
{ var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]); }
}