結果
問題 | No.122 傾向と対策:門松列(その3) |
ユーザー | 紙ぺーぱー |
提出日時 | 2016-05-29 09:56:07 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 232 ms / 5,000 ms |
コード長 | 6,923 bytes |
コンパイル時間 | 1,134 ms |
コンパイル使用メモリ | 112,128 KB |
実行使用メモリ | 21,760 KB |
最終ジャッジ日時 | 2024-10-07 17:38:22 |
合計ジャッジ時間 | 3,155 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 136 ms
21,760 KB |
testcase_01 | AC | 149 ms
21,504 KB |
testcase_02 | AC | 232 ms
21,504 KB |
testcase_03 | AC | 180 ms
21,760 KB |
testcase_04 | AC | 146 ms
21,376 KB |
testcase_05 | AC | 231 ms
21,760 KB |
testcase_06 | AC | 134 ms
21,760 KB |
testcase_07 | AC | 123 ms
21,632 KB |
コンパイルメッセージ
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.Linq.Expressions; 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.Double; using _ANSWER = System.String; namespace Program { public class Solver { public void Solve() { var A = Enumerate(7, x => sc.Integer(2)); var dpA = new ModInteger[1 << 7]; var dpB = new ModInteger[1 << 7]; dpA[0] = dpB[0] = 1; for (int val = 1; val <= 20000; val++) { var nextA = new ModInteger[1 << 7]; var nextB = new ModInteger[1 << 7]; for (int i = 0; i < 1 << 7; i++) { nextA[i] += dpA[i]; nextB[i] += dpB[i]; for (int j = 0; j < 7; j++) { if (val < A[j][0] || A[j][1] < val) continue; if ((i >> j & 1) == 1) continue; var ni = i | 1 << j; if (j % 2 == 1 && (i & (1 + 4 + 16 + 64)) == 1 + 4 + 16 + 64) nextA[ni] += dpA[i]; if (j % 2 == 0) nextA[ni] += dpA[i]; if (j % 2 == 0 && (i & (2 + 8 + 32)) == 2 + 8 + 32) nextB[ni] += dpB[i]; if (j % 2 == 1) nextB[ni] += dpB[i]; } } dpA = nextA; dpB = nextB; } IO.Printer.Out.WriteLine(dpA[(1 << 7) - 1] + dpB[(1 << 7) - 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 ModNumber public partial struct ModInteger { public const long Mod = (long)1e9 + 7; public long num; public ModInteger(long n) : this() { num = n % Mod; if (num < 0) num += Mod; } public override string ToString() { return num.ToString(); } public static ModInteger operator +(ModInteger l, ModInteger r) { var n = l.num + r.num; if (n >= Mod) n -= Mod; return new ModInteger() { num = n }; } public static ModInteger operator -(ModInteger l, ModInteger r) { var n = l.num + Mod - r.num; if (n >= Mod) n -= Mod; return new ModInteger() { num = n }; } public static ModInteger operator *(ModInteger l, ModInteger r) { return new ModInteger(l.num * r.num); } public static ModInteger operator ^(ModInteger l, long r) { return ModInteger.Pow(l, r); } public static implicit operator ModInteger(long n) { return new ModInteger(n); } public static ModInteger Pow(ModInteger v, long k) { ModInteger ret = 1; var n = k; for (; n > 0; n >>= 1, v *= v) { if ((n & 1) == 1) ret = ret * v; } return ret; } } #endregion