結果
問題 | No.187 中華風 (Hard) |
ユーザー | EmKjp |
提出日時 | 2020-06-25 02:06:03 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 215 ms / 3,000 ms |
コード長 | 7,841 bytes |
コンパイル時間 | 941 ms |
コンパイル使用メモリ | 111,744 KB |
実行使用メモリ | 18,816 KB |
最終ジャッジ日時 | 2024-07-03 20:33:29 |
合計ジャッジ時間 | 4,786 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 22 ms
18,560 KB |
testcase_01 | AC | 23 ms
18,432 KB |
testcase_02 | AC | 167 ms
18,688 KB |
testcase_03 | AC | 165 ms
18,432 KB |
testcase_04 | AC | 210 ms
18,688 KB |
testcase_05 | AC | 215 ms
18,560 KB |
testcase_06 | AC | 213 ms
18,432 KB |
testcase_07 | AC | 214 ms
18,560 KB |
testcase_08 | AC | 153 ms
18,688 KB |
testcase_09 | AC | 155 ms
18,432 KB |
testcase_10 | AC | 152 ms
18,560 KB |
testcase_11 | AC | 214 ms
18,560 KB |
testcase_12 | AC | 214 ms
18,432 KB |
testcase_13 | AC | 77 ms
18,560 KB |
testcase_14 | AC | 68 ms
18,432 KB |
testcase_15 | AC | 151 ms
18,688 KB |
testcase_16 | AC | 156 ms
18,560 KB |
testcase_17 | AC | 22 ms
18,560 KB |
testcase_18 | AC | 22 ms
18,176 KB |
testcase_19 | AC | 22 ms
18,688 KB |
testcase_20 | AC | 175 ms
18,816 KB |
testcase_21 | AC | 24 ms
18,560 KB |
testcase_22 | AC | 213 ms
18,432 KB |
testcase_23 | AC | 23 ms
18,688 KB |
testcase_24 | AC | 22 ms
18,560 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; using System.Collections.Generic; using System.Diagnostics; using System.Globalization; using System.IO; using System.Text; using System.Linq; using E = System.Linq.Enumerable; internal partial class Solver { public static long Gcd(long s, long t) { return t != 0 ? Gcd(t, s % t) : s; } private static long ExtendedGcd(long a, long b, ref long x, ref long y) { if (b == 0) { x = 1; y = 0; return a; } else { var d = ExtendedGcd(b, a % b, ref y, ref x); y -= a / b * x; return d; } } private static long Inverse(long a, long mod) { long x = 0, y = 0; if (ExtendedGcd(a, mod, ref x, ref y) == 1) { return (x + mod) % mod; } else { throw new Exception("Invalid inverse " + a + " " + mod); } } /// <summary> /// m 同士がすべて互いに素になるように変換する /// </summary> bool PreGarner(long[] b, long[] m) { for (int i = 0; i < b.Length; i++) { for (int j = 0; j < i; j++) { var gcd = Gcd(m[i], m[j]); if (b[i] % gcd != b[j] % gcd) return false; var gi = m[i] / gcd; var lcm = gi * m[j]; while (true) { var g = Gcd(gi, gcd); if (g == 1) break; gi *= g; gcd /= g; }; m[i] = gi; m[j] = lcm / gi; } } for (int i = 0; i < b.Length; i++) { b[i] %= m[i]; } return true; } long Garner(long[] b, long[] m, long mod) { // x = c1 + c2 m1 + c3 m1 m2 + c4 m1 m2 m3 ... var c = new long[m.Length]; long sum = 0; for (int i = 0; i <= m.Length; i++) { long coef = 1; // m1*m2*m3* ... var modInternal = i == m.Length ? mod : m[i]; sum = 0; for (int j = 0; j < i; j++) { sum += coef * c[j]; coef *= m[j]; sum %= modInternal; coef %= modInternal; } if (i == m.Length) break; c[i] = (b[i] - sum) * Inverse(coef, modInternal) % modInternal; if (c[i] < 0) c[i] += modInternal; } return sum; } public void Run() { var n = ni(); var x = new long[n]; var y = new long[n]; var mod = 1000000007; for (int i = 0; i < n; i++) { x[i] = nl(); y[i] = nl(); } if (!PreGarner(x, y)) { cout.WriteLine(-1); } else if (x.All(a => a == 0)) { var ans = y.Aggregate((a, b) => a * b % mod); cout.WriteLine(ans); } else { var g = Garner(x, y, mod); cout.WriteLine(g); } } } // PREWRITEN CODE BEGINS FROM HERE static public class StringExtensions { static public string JoinToString<T>(this IEnumerable<T> source, string separator = " ") { return string.Join(separator, source); } } internal partial class Solver : Scanner { public static void Main() { #if LOCAL byte[] inputBuffer = new byte[1000000]; var inputStream = Console.OpenStandardInput(inputBuffer.Length); using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) { Console.SetIn(reader); new Solver(Console.In, Console.Out).Run(); } #else Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }); new Solver(Console.In, Console.Out).Run(); Console.Out.Flush(); #endif } #pragma warning disable IDE0052 private readonly TextReader cin; private readonly TextWriter cout; private readonly TextWriter cerr; #pragma warning restore IDE0052 public Solver(TextReader reader, TextWriter writer) : base(reader) { cin = reader; cout = writer; cerr = Console.Error; } public Solver(string input, TextWriter writer) : this(new StringReader(input), writer) { } #pragma warning disable IDE1006 #pragma warning disable IDE0051 private int ni() { return NextInt(); } private int[] ni(int n) { return NextIntArray(n); } private long nl() { return NextLong(); } private long[] nl(int n) { return NextLongArray(n); } private double nd() { return NextDouble(); } private double[] nd(int n) { return NextDoubleArray(n); } private string ns() { return Next(); } private string[] ns(int n) { return NextArray(n); } #pragma warning restore IDE1006 #pragma warning restore IDE0051 } internal static class LinqPadExtension { [Conditional("DEBUG")] public static void Dump<T>(this T obj) { #if DEBUG LINQPad.Extensions.Dump(obj); #endif } } public class Scanner { private readonly TextReader Reader; private readonly CultureInfo ci = CultureInfo.InvariantCulture; private readonly char[] buffer = new char[2 * 1024]; private int cursor = 0, length = 0; private string Token; private readonly StringBuilder sb = new StringBuilder(1024); public Scanner() : this(Console.In) { } public Scanner(TextReader reader) { Reader = reader; } public int NextInt() { return checked((int)NextLong()); } public long NextLong() { var s = Next(); long r = 0; int i = 0; bool negative = false; if (s[i] == '-') { negative = true; i++; } for (; i < s.Length; i++) { r = r * 10 + (s[i] - '0'); #if DEBUG if (!char.IsDigit(s[i])) throw new FormatException(); #endif } return negative ? -r : r; } public double NextDouble() { return double.Parse(Next(), ci); } public string[] NextArray(int size) { string[] array = new string[size]; for (int i = 0; i < size; i++) { array[i] = Next(); } return array; } public int[] NextIntArray(int size) { int[] array = new int[size]; for (int i = 0; i < size; i++) { array[i] = NextInt(); } return array; } public long[] NextLongArray(int size) { long[] array = new long[size]; for (int i = 0; i < size; i++) { array[i] = NextLong(); } return array; } public double[] NextDoubleArray(int size) { double[] array = new double[size]; for (int i = 0; i < size; i++) { array[i] = NextDouble(); } return array; } public string Next() { if (Token == null) { if (!StockToken()) { throw new Exception(); } } var token = Token; Token = null; return token; } public bool HasNext() { if (Token != null) { return true; } return StockToken(); } private bool StockToken() { while (true) { sb.Clear(); while (true) { if (cursor >= length) { cursor = 0; if ((length = Reader.Read(buffer, 0, buffer.Length)) <= 0) { break; } } var c = buffer[cursor++]; if (33 <= c && c <= 126) { sb.Append(c); } else { if (sb.Length > 0) break; } } if (sb.Length > 0) { Token = sb.ToString(); return true; } return false; } } }