結果
問題 | No.990 N×Mマス計算(Kの倍数) |
ユーザー | ひばち |
提出日時 | 2020-02-15 18:09:28 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 247 ms / 2,000 ms |
コード長 | 6,481 bytes |
コンパイル時間 | 2,900 ms |
コンパイル使用メモリ | 118,260 KB |
実行使用メモリ | 49,212 KB |
最終ジャッジ日時 | 2024-04-27 20:48:45 |
合計ジャッジ時間 | 5,712 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 31 ms
24,480 KB |
testcase_01 | AC | 31 ms
26,484 KB |
testcase_02 | AC | 32 ms
26,520 KB |
testcase_03 | AC | 30 ms
24,336 KB |
testcase_04 | AC | 31 ms
24,084 KB |
testcase_05 | AC | 31 ms
24,324 KB |
testcase_06 | AC | 31 ms
24,492 KB |
testcase_07 | AC | 31 ms
26,360 KB |
testcase_08 | AC | 30 ms
24,328 KB |
testcase_09 | AC | 31 ms
26,492 KB |
testcase_10 | AC | 102 ms
39,096 KB |
testcase_11 | AC | 122 ms
39,612 KB |
testcase_12 | AC | 247 ms
42,472 KB |
testcase_13 | AC | 88 ms
37,860 KB |
testcase_14 | AC | 134 ms
38,484 KB |
testcase_15 | AC | 97 ms
30,980 KB |
testcase_16 | AC | 119 ms
39,248 KB |
testcase_17 | AC | 79 ms
33,108 KB |
testcase_18 | AC | 247 ms
42,348 KB |
testcase_19 | AC | 127 ms
34,024 KB |
testcase_20 | AC | 184 ms
49,212 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.Runtime.CompilerServices; using System.Text; using System.Numerics; using static Template; using static System.Console; using static System.Convert; using static System.Math; using Pi = Pair<int, int>; class Solver { public void Solve(Scanner sc) { int N, M, K; sc.Make(out N, out M, out K); char o = sc.Next<char>(); var res = 0L; var d = new Dictionary<long, int>(); if (o == '+') { for(var i = 0; i < M; i++) { var b = sc.Next<long>() % K; if (!d.ContainsKey(b)) d[b] = 0; d[b]++; } for(var i = 0; i < N; i++) { var l = ((K - sc.Next<long>()) % K + K) % K; if (d.ContainsKey(l)) res += d[l]; } WriteLine(res);return; } var a = new Dictionary<long, int>(); for(var i = 0; i < M; i++) { var b = GCD(K, sc.Next<long>()); if (!d.ContainsKey(b)) d[b] = 0; d[b]++; } for(var i = 0; i < N; i++) { var p = GCD(K, sc.Next<long>()); if (!a.ContainsKey(p)) a[p] = 0; a[p]++; } foreach (var k in d.Keys) foreach (var v in a.Keys) if (k * v % K == 0) res += (long)d[k] * a[v]; WriteLine(res); } #region GCD public static int LCM(int num1, int num2) => num1 / GCD(num1, num2) * num2; public static long LCM(long num1, long num2) => num1 / GCD(num1, num2) * num2; public static int GCD(int num1, int num2) => num1 < num2 ? GCD(num2, num1) : num2 > 0 ? GCD(num2, num1 % num2) : num1; public static long GCD(long num1, long num2) => num1 < num2 ? GCD(num2, num1) : num2 > 0 ? GCD(num2, num1 % num2) : num1; #endregion } #region Template public static class Template { static void Main(string[] args) { Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }); new Solver().Solve(new Scanner()); Console.Out.Flush(); } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) == 1) { a = b; return true; } return false; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) == -1) { a = b; return true; } return false; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void swap<T>(ref T a, ref T b) { var t = b; b = a; a = t; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static T[] Create<T>(int n, Func<T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(); return rt; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static T[] Create<T>(int n, Func<int, T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(i); return rt; } public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); } } public class Scanner { public string Str => Console.ReadLine().Trim(); public int Int => int.Parse(Str); public long Long => long.Parse(Str); public double Double => double.Parse(Str); public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray(); public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray(); public char[][] Grid(int n) => Create(n, () => Str.ToCharArray()); public int[] ArrInt1D(int n) => Create(n, () => Int); public long[] ArrLong1D(int n) => Create(n, () => Long); public int[][] ArrInt2D(int n) => Create(n, () => ArrInt); public long[][] ArrLong2D(int n) => Create(n, () => ArrLong); private Queue<string> q = new Queue<string>(); [MethodImpl(MethodImplOptions.AggressiveInlining)] public T Next<T>() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); } public void Make<T1>(out T1 v1) => v1 = Next<T1>(); public void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); } public void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); } public void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next<T4>(); } public void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next<T5>(); } public void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next<T6>(); } //public (T1, T2) Make<T1, T2>() { Make(out T1 v1, out T2 v2); return (v1, v2); } //public (T1, T2, T3) Make<T1, T2, T3>() { Make(out T1 v1, out T2 v2, out T3 v3); return (v1, v2, v3); } //public (T1, T2, T3, T4) Make<T1, T2, T3, T4>() { Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4); return (v1, v2, v3, v4); } } public class Pair<T1, T2> : IComparable<Pair<T1, T2>> { public T1 v1; public T2 v2; public Pair() { } public Pair(T1 v1, T2 v2) { this.v1 = v1; this.v2 = v2; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public int CompareTo(Pair<T1, T2> p) { var c = Comparer<T1>.Default.Compare(v1, p.v1); if (c == 0) c = Comparer<T2>.Default.Compare(v2, p.v2); return c; } public override string ToString() => $"{v1.ToString()} {v2.ToString()}"; public void Deconstruct(out T1 a, out T2 b) { a = v1; b = v2; } } public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>> { public T3 v3; public Pair() : base() { } public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2) { this.v3 = v3; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public int CompareTo(Pair<T1, T2, T3> p) { var c = base.CompareTo(p); if (c == 0) c = Comparer<T3>.Default.Compare(v3, p.v3); return c; } public override string ToString() => $"{base.ToString()} {v3.ToString()}"; public void Deconstruct(out T1 a, out T2 b, out T3 c) { Deconstruct(out a, out b); c = v3; } } #endregion