結果
問題 | No.695 square1001 and Permutation 4 |
ユーザー | claw88 |
提出日時 | 2018-09-27 21:36:51 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 1,816 ms / 7,000 ms |
コード長 | 3,786 bytes |
コンパイル時間 | 4,927 ms |
コンパイル使用メモリ | 108,632 KB |
実行使用メモリ | 61,452 KB |
最終ジャッジ日時 | 2023-09-30 01:38:27 |
合計ジャッジ時間 | 15,875 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 66 ms
20,960 KB |
testcase_01 | AC | 136 ms
24,372 KB |
testcase_02 | AC | 184 ms
30,064 KB |
testcase_03 | AC | 148 ms
30,112 KB |
testcase_04 | AC | 402 ms
30,156 KB |
testcase_05 | AC | 496 ms
30,176 KB |
testcase_06 | AC | 988 ms
40,076 KB |
testcase_07 | AC | 717 ms
41,976 KB |
testcase_08 | AC | 779 ms
39,836 KB |
testcase_09 | AC | 999 ms
41,852 KB |
testcase_10 | AC | 251 ms
26,364 KB |
testcase_11 | AC | 1,816 ms
61,416 KB |
testcase_12 | AC | 1,506 ms
61,452 KB |
testcase_13 | AC | 1,414 ms
59,392 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.Collections.Generic; using System.Linq; using System.IO; //using System.Text; //using System.Text.RegularExpressions; //using System.Globalization; //using System.Diagnostics; using static System.Console; using System.Numerics; //using static System.Math; //using pair = Pair<int, int>; class Program { static void Main() { //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false }); new Program().solve(); Out.Flush(); } Scanner cin = new Scanner(); readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑ readonly int mod = 1000000007; void chmax<T>(ref T a, T b) where T : IComparable<T> { a = a.CompareTo(b) < 0 ? b : a; } void chmin<T>(ref T a, T b) where T : IComparable<T> { a = a.CompareTo(b) < 0 ? a : b; } long calc(int N, int[] X, int[] dp, int p) { for (int i = 0; i < dp.Length; i++) { dp[i] = 0; } dp[0] = 1; for (int i = 1; i < dp.Length; i++) { foreach (var v in X) { if (i - v >= 0) { dp[i] += dp[i - v]; dp[i] %= p; } } } N--; int m = dp.Length; long ret = 0; for (int i = 0; i < m; i++) { foreach (var v in X) { //はじめゼロ、m - 1 からmへの飛び超えNまで if (m <= i + v && i + v <= N) { ret += (long)dp[i] * dp[N - (i + v)]; ret %= p; } } } return ret; } void solve() { int N = cin.nextint; int M = cin.nextint; var X = cin.scanint; int m1 = 168647939; int m2 = 592951213; var dp = new int[(N + 1) / 2 + 1]; long A = calc(N, X, dp, m1); long B = calc(N, X, dp, m2); //WriteLine(A + " " + B); WriteLine(crt(A, m1, B, m2)); } long gcd(long a, long b) { return (b != 0) ? gcd(b, a % b) : a; } long lcm(long a, long b) { return a / gcd(a, b) * b; } //ax + by = gcd(a, b)となるx, yを求める long extgcd(long a, long b, out long x, out long y) { long g = a; if (b != 0) { g = extgcd(b, a % b, out y, out x); y -= (a / b) * x; } else { x = 1; y = 0; } return g; } BigInteger crt(BigInteger a1, long m1, BigInteger a2, long m2) { extgcd(m1, m2, out long x, out long y); var p = m1 * m2; x %= p; y %= p; BigInteger ret = a1 * m2 % p * y % p + a2 * m1 % p * x % p; return ((ret % p) + p) % p; } } class Scanner { string[] s; int i; char[] cs = new char[] { ' ' }; public Scanner() { s = new string[0]; i = 0; } public string[] scan { get { return ReadLine().Split(); } } public int[] scanint { get { return Array.ConvertAll(scan, int.Parse); } } public long[] scanlong { get { return Array.ConvertAll(scan, long.Parse); } } public double[] scandouble { get { return Array.ConvertAll(scan, double.Parse); } } public string next { get { if (i < s.Length) return s[i++]; string st = ReadLine(); while (st == "") st = ReadLine(); s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries); i = 0; return next; } } public int nextint { get { return int.Parse(next); } } public long nextlong { get { return long.Parse(next); } } public double nextdouble { get { return double.Parse(next); } } }