結果
問題 | No.2684 折々の色 |
ユーザー | tobisatis |
提出日時 | 2024-03-20 22:07:23 |
言語 | C# (.NET 8.0.203) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,515 bytes |
コンパイル時間 | 8,487 ms |
コンパイル使用メモリ | 168,484 KB |
実行使用メモリ | 193,276 KB |
最終ジャッジ日時 | 2024-09-30 07:59:35 |
合計ジャッジ時間 | 35,716 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 60 ms
30,564 KB |
testcase_01 | AC | 59 ms
30,572 KB |
testcase_02 | AC | 59 ms
30,336 KB |
testcase_03 | AC | 59 ms
30,720 KB |
testcase_04 | AC | 60 ms
30,700 KB |
testcase_05 | AC | 58 ms
30,208 KB |
testcase_06 | AC | 61 ms
30,592 KB |
testcase_07 | AC | 60 ms
30,336 KB |
testcase_08 | AC | 63 ms
30,464 KB |
testcase_09 | AC | 62 ms
30,464 KB |
testcase_10 | AC | 61 ms
30,576 KB |
testcase_11 | AC | 709 ms
95,872 KB |
testcase_12 | AC | 411 ms
81,444 KB |
testcase_13 | AC | 436 ms
96,816 KB |
testcase_14 | AC | 279 ms
73,292 KB |
testcase_15 | AC | 434 ms
82,116 KB |
testcase_16 | AC | 125 ms
45,824 KB |
testcase_17 | AC | 365 ms
72,432 KB |
testcase_18 | AC | 455 ms
91,104 KB |
testcase_19 | AC | 612 ms
99,300 KB |
testcase_20 | AC | 434 ms
81,576 KB |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | AC | 663 ms
88,060 KB |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | AC | 763 ms
115,792 KB |
testcase_30 | AC | 724 ms
116,152 KB |
testcase_31 | AC | 769 ms
116,504 KB |
testcase_32 | AC | 1,544 ms
130,896 KB |
testcase_33 | AC | 967 ms
121,308 KB |
testcase_34 | AC | 872 ms
117,044 KB |
testcase_35 | AC | 789 ms
116,536 KB |
testcase_36 | AC | 799 ms
116,792 KB |
testcase_37 | AC | 774 ms
116,408 KB |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | AC | 60 ms
30,336 KB |
testcase_48 | AC | 59 ms
30,336 KB |
testcase_49 | AC | 59 ms
30,336 KB |
testcase_50 | AC | 60 ms
30,720 KB |
testcase_51 | AC | 58 ms
30,572 KB |
testcase_52 | AC | 60 ms
30,464 KB |
testcase_53 | AC | 58 ms
30,336 KB |
testcase_54 | AC | 58 ms
30,584 KB |
testcase_55 | AC | 60 ms
30,208 KB |
testcase_56 | AC | 56 ms
30,336 KB |
testcase_57 | WA | - |
コンパイルメッセージ
復元対象のプロジェクトを決定しています... /home/judge/data/code/main.csproj を復元しました (91 ms)。 MSBuild のバージョン 17.9.6+a4ecab324 (.NET) main -> /home/judge/data/code/bin/Release/net8.0/main.dll main -> /home/judge/data/code/bin/Release/net8.0/publish/
ソースコード
namespace AtCoder; #nullable enable using System.Numerics; static class Extensions { public static T[] Repeat<T>(this int time, Func<T> F) => Enumerable.Range(0, time).Select(_ => F()).ToArray(); } readonly record struct Rational<T> : IAdditiveIdentity<Rational<T>, Rational<T>>, IAdditionOperators<Rational<T>, Rational<T>, Rational<T>>, ISubtractionOperators<Rational<T>, Rational<T>, Rational<T>>, IUnaryNegationOperators<Rational<T>, Rational<T>>, IMultiplicativeIdentity<Rational<T>, Rational<T>>, IMultiplyOperators<Rational<T>, Rational<T>, Rational<T>>, IDivisionOperators<Rational<T>, Rational<T>, Rational<T>>, IComparable<Rational<T>>, IEqualityOperators<Rational<T>, Rational<T>, bool>, IComparisonOperators<Rational<T>, Rational<T>, bool> where T : IBinaryInteger<T>, IConvertible { public T P { get; private init; } public T Q { get; private init; } public Rational(T p, T q) { if (q == T.Zero) throw new DivideByZeroException(); if (q < T.Zero) (p, q) = (-p, -q); var (x, y) = (T.Abs(p), q); while (y > T.Zero) (x, y) = (y, x % y); (P, Q) = (p / x, q / x); } public Rational(T p) { (P, Q) = (p, T.One); } public static Rational<T> AdditiveIdentity => new(T.Zero); public static Rational<T> MultiplicativeIdentity => new(T.One); public static implicit operator Rational<T>(T i) => new(i); public static Rational<T> operator -(Rational<T> r) => new(-r.P, r.Q); public static Rational<T> operator +(Rational<T> r1, Rational<T> r2) => new(r1.P * r2.Q + r1.Q * r2.P, r1.Q * r2.Q); public static Rational<T> operator -(Rational<T> r1, Rational<T> r2) => new(r1.P * r2.Q - r1.Q * r2.P, r1.Q * r2.Q); public static Rational<T> operator *(Rational<T> r1, Rational<T> r2) => new(r1.P * r2.P, r1.Q * r2.Q); public static Rational<T> operator /(Rational<T> r1, Rational<T> r2) => new(r1.P * r2.Q, r1.Q * r2.P); public static bool operator <(Rational<T> r1, Rational<T> r2) => r1.CompareTo(r2) < 0; public static bool operator <=(Rational<T> r1, Rational<T> r2) => r1.CompareTo(r2) <= 0; public static bool operator >(Rational<T> r1, Rational<T> r2) => r1.CompareTo(r2) > 0; public static bool operator >=(Rational<T> r1, Rational<T> r2) => r1.CompareTo(r2) >= 0; public int CompareTo(Rational<T> r) => (P * r.Q).CompareTo(Q * r.P); public override string ToString() => Q == T.One ? P.ToString()! : (P.ToDouble(null) / Q.ToDouble(null)).ToString(); } class HashMap<K, V> : Dictionary<K, V> where K : notnull where V : struct { public new V this[K k] { get => TryGetValue(k, out var value) ? value : base[k] = default; set { base[k] = value; } } } class AtCoder { object? Solve() { var n = Int(); var m = Int(); var xz = m.Repeat(() => new Rational<long>(Int() * 100)); var cz = new Rational<long>[n][]; for (var i = 0; i < n; i++) cz[i] = new Rational<long>[m]; var tz = new int[n]; for (var i = 0; i < n; i++) { for (var j = 0; j < m; j++) cz[i][j] = Int(); var t = tz[i] = Int(); for (var j = 0; j < m; j++) cz[i][j] *= t; } static long H(Rational<long>[] color) { var p = 998247893; var res = 0L; foreach (var x in color) { res *= 1 << 30; res += x.P; res %= p; res *= 1 << 30; res += x.Q; res %= p; } return res; } var hcz = new long[n]; for (var i = 0; i < n; i++) hcz[i] = H(cz[i]); var hcd = new HashMap<long, int>(); foreach (var h in hcz) hcd[h]++; for (var i = 0; i < n; i++) { var hi = hcz[i]; if (tz[i] == 100) { if (hcd[H(xz)] == hi) return true; continue; } hcd[hi]--; var hz = new Rational<long>[m]; for (var j = 0; j < m; j++) hz[j] = (xz[j] - cz[i][j]) * 100 / (100 - tz[i]); var h = H(hz); if (hcd[h] > 0) return true; hcd[hi]++; } return false; } public static void Main() => new AtCoder().Run(); public void Run() { var res = Solve(); if (res != null) { if (res is bool yes) res = yes ? "Yes" : "No"; sw.WriteLine(res); } sw.Flush(); } string[] input = Array.Empty<string>(); int iter = 0; readonly StreamWriter sw = new(Console.OpenStandardOutput()) { AutoFlush = false }; #pragma warning disable IDE0051 string String() { while (iter >= input.Length) (input, iter) = (Console.ReadLine()!.Split(' '), 0); return input[iter++]; } T Input<T>() where T : IParsable<T> => T.Parse(String(), null); int Int() => Input<int>(); void Out(object? x, string? separator = null) { separator ??= Environment.NewLine; if (x is System.Collections.IEnumerable obj and not string) { var firstLine = true; foreach (var item in obj) { if (!firstLine) sw.Write(separator); firstLine = false; sw.Write(item); } } else sw.Write(x); sw.WriteLine(); } #pragma warning restore IDE0051 }