結果
問題 | No.1260 たくさんの多項式 |
ユーザー | yupiteru_kun |
提出日時 | 2020-10-16 23:26:18 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 1,310 ms / 2,000 ms |
コード長 | 13,937 bytes |
コンパイル時間 | 6,385 ms |
コンパイル使用メモリ | 115,644 KB |
実行使用メモリ | 29,884 KB |
最終ジャッジ日時 | 2023-09-28 05:35:08 |
合計ジャッジ時間 | 42,545 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 53 ms
20,700 KB |
testcase_01 | AC | 57 ms
24,216 KB |
testcase_02 | AC | 59 ms
22,680 KB |
testcase_03 | AC | 53 ms
22,620 KB |
testcase_04 | AC | 53 ms
18,692 KB |
testcase_05 | AC | 59 ms
22,736 KB |
testcase_06 | AC | 51 ms
20,680 KB |
testcase_07 | AC | 58 ms
22,764 KB |
testcase_08 | AC | 57 ms
20,708 KB |
testcase_09 | AC | 54 ms
20,684 KB |
testcase_10 | AC | 58 ms
20,724 KB |
testcase_11 | AC | 58 ms
20,708 KB |
testcase_12 | AC | 59 ms
20,156 KB |
testcase_13 | AC | 59 ms
22,260 KB |
testcase_14 | AC | 56 ms
22,668 KB |
testcase_15 | AC | 54 ms
22,228 KB |
testcase_16 | AC | 52 ms
20,636 KB |
testcase_17 | AC | 56 ms
20,620 KB |
testcase_18 | AC | 56 ms
18,576 KB |
testcase_19 | AC | 58 ms
20,616 KB |
testcase_20 | AC | 1,265 ms
27,768 KB |
testcase_21 | AC | 369 ms
24,232 KB |
testcase_22 | AC | 1,081 ms
28,020 KB |
testcase_23 | AC | 884 ms
26,012 KB |
testcase_24 | AC | 903 ms
26,324 KB |
testcase_25 | AC | 732 ms
25,256 KB |
testcase_26 | AC | 885 ms
26,304 KB |
testcase_27 | AC | 711 ms
25,968 KB |
testcase_28 | AC | 1,240 ms
29,644 KB |
testcase_29 | AC | 922 ms
28,268 KB |
testcase_30 | AC | 591 ms
24,768 KB |
testcase_31 | AC | 932 ms
26,728 KB |
testcase_32 | AC | 931 ms
28,316 KB |
testcase_33 | AC | 727 ms
26,768 KB |
testcase_34 | AC | 1,160 ms
27,248 KB |
testcase_35 | AC | 539 ms
23,804 KB |
testcase_36 | AC | 491 ms
26,772 KB |
testcase_37 | AC | 926 ms
26,324 KB |
testcase_38 | AC | 1,004 ms
24,756 KB |
testcase_39 | AC | 1,202 ms
29,572 KB |
testcase_40 | AC | 898 ms
28,824 KB |
testcase_41 | AC | 1,133 ms
29,032 KB |
testcase_42 | AC | 835 ms
26,960 KB |
testcase_43 | AC | 1,168 ms
25,196 KB |
testcase_44 | AC | 768 ms
26,176 KB |
testcase_45 | AC | 741 ms
24,700 KB |
testcase_46 | AC | 666 ms
26,244 KB |
testcase_47 | AC | 820 ms
28,264 KB |
testcase_48 | AC | 200 ms
23,224 KB |
testcase_49 | AC | 624 ms
26,296 KB |
testcase_50 | AC | 341 ms
24,352 KB |
testcase_51 | AC | 1,200 ms
29,372 KB |
testcase_52 | AC | 425 ms
25,756 KB |
testcase_53 | AC | 558 ms
25,152 KB |
testcase_54 | AC | 1,241 ms
27,524 KB |
testcase_55 | AC | 1,299 ms
27,816 KB |
testcase_56 | AC | 603 ms
25,792 KB |
testcase_57 | AC | 869 ms
26,272 KB |
testcase_58 | AC | 538 ms
25,272 KB |
testcase_59 | AC | 924 ms
26,232 KB |
testcase_60 | AC | 1,310 ms
29,884 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.IO; using System.Linq; using static System.Math; using System.Text; using System.Threading; using System.Globalization; using System.Runtime.CompilerServices; using Library; namespace Program { public static class ProblemE { static bool SAIKI = false; static public int numberOfRandomCases = 0; static public void MakeTestCase(List<string> _input, List<string> _output, ref Func<string[], bool> _outputChecker) { var N = (long)(xorshift % 100) + 2; LIB_Mod ans = 0; for (var i = 2L; i <= N; i++) { var t = N; while (t > 0) { ans += t % i; t /= i; } } _input.Add(N.ToString()); _output.Add(ans.ToString()); } static public void Solve() { var N = NN; LIB_Mod ans = 0; var lasti = 0L; for (var i = 2L; i * i <= N; i++) { var t = N; var thisans = 0L; while (t > 0) { thisans += t % i; t /= i; } ans += thisans; lasti = N / i; } var ary = new long[1000001]; { var i = 1L; for (; i * i < N; i++) { var left = 1L; var right = N + 1; while (right - left > 1) { var mid = (right + left) / 2; if (N / mid >= i) left = mid; else right = mid; } ary[i] = left; } { var left = 1L; var right = N + 1; while (right - left > 1) { var mid = (right + left) / 2; if (N / mid >= i) left = mid; else right = mid; } ary[i] = left; } } for (var i = 1L; i * i < N; i++) { if (i == lasti) break; var t = N; LIB_Mod a = 0; while (t > 0) { a += t % ary[i]; t /= ary[i]; } var d = (LIB_Mod)i; var n = ary[i] - ary[i + 1]; ans += n * (2 * a + (n - 1) * d) / 2; } Console.WriteLine(ans); } class Printer : StreamWriter { public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } } public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { base.AutoFlush = false; } public Printer(Stream stream, Encoding encoding) : base(stream, encoding) { base.AutoFlush = false; } } static LIB_FastIO fastio = new LIB_FastIODebug(); static public void Main(string[] args) { if (args.Length == 0) { fastio = new LIB_FastIO(); Console.SetOut(new Printer(Console.OpenStandardOutput())); } if (SAIKI) { var t = new Thread(Solve, 134217728); t.Start(); t.Join(); } else Solve(); Console.Out.Flush(); } static long NN => fastio.Long(); static double ND => fastio.Double(); static string NS => fastio.Scan(); static long[] NNList(long N) => Repeat(0, N).Select(_ => NN).ToArray(); static double[] NDList(long N) => Repeat(0, N).Select(_ => ND).ToArray(); static string[] NSList(long N) => Repeat(0, N).Select(_ => NS).ToArray(); static long Count<T>(this IEnumerable<T> x, Func<T, bool> pred) => Enumerable.Count(x, pred); static IEnumerable<T> Repeat<T>(T v, long n) => Enumerable.Repeat<T>(v, (int)n); static IEnumerable<int> Range(long s, long c) => Enumerable.Range((int)s, (int)c); static IOrderedEnumerable<T> OrderByRand<T>(this IEnumerable<T> x) => Enumerable.OrderBy(x, _ => xorshift); static IOrderedEnumerable<T> OrderBy<T>(this IEnumerable<T> x) => Enumerable.OrderBy(x.OrderByRand(), e => e); static IOrderedEnumerable<T1> OrderBy<T1, T2>(this IEnumerable<T1> x, Func<T1, T2> selector) => Enumerable.OrderBy(x.OrderByRand(), selector); static IOrderedEnumerable<T> OrderByDescending<T>(this IEnumerable<T> x) => Enumerable.OrderByDescending(x.OrderByRand(), e => e); static IOrderedEnumerable<T1> OrderByDescending<T1, T2>(this IEnumerable<T1> x, Func<T1, T2> selector) => Enumerable.OrderByDescending(x.OrderByRand(), selector); static IOrderedEnumerable<string> OrderBy(this IEnumerable<string> x) => x.OrderByRand().OrderBy(e => e, StringComparer.OrdinalIgnoreCase); static IOrderedEnumerable<T> OrderBy<T>(this IEnumerable<T> x, Func<T, string> selector) => x.OrderByRand().OrderBy(selector, StringComparer.OrdinalIgnoreCase); static IOrderedEnumerable<string> OrderByDescending(this IEnumerable<string> x) => x.OrderByRand().OrderByDescending(e => e, StringComparer.OrdinalIgnoreCase); static IOrderedEnumerable<T> OrderByDescending<T>(this IEnumerable<T> x, Func<T, string> selector) => x.OrderByRand().OrderByDescending(selector, StringComparer.OrdinalIgnoreCase); static string Join<T>(this IEnumerable<T> x, string separator = "") => string.Join(separator, x); static uint xorshift { get { _xsi.MoveNext(); return _xsi.Current; } } static IEnumerator<uint> _xsi = _xsc(); static IEnumerator<uint> _xsc() { uint x = 123456789, y = 362436069, z = 521288629, w = (uint)(DateTime.Now.Ticks & 0xffffffff); while (true) { var t = x ^ (x << 11); x = y; y = z; z = w; w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)); yield return w; } } static bool Chmax<T>(this ref T lhs, T rhs) where T : struct, IComparable<T> { if (lhs.CompareTo(rhs) < 0) { lhs = rhs; return true; } return false; } static bool Chmin<T>(this ref T lhs, T rhs) where T : struct, IComparable<T> { if (lhs.CompareTo(rhs) > 0) { lhs = rhs; return true; } return false; } } } namespace Library { class LIB_FastIO { [MethodImpl(MethodImplOptions.AggressiveInlining)] public LIB_FastIO() { str = Console.OpenStandardInput(); } readonly Stream str; readonly byte[] buf = new byte[2048]; int len, ptr; [MethodImpl(MethodImplOptions.AggressiveInlining)] byte read() { if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 2048)) <= 0) { return 0; } } return buf[ptr++]; } [MethodImpl(MethodImplOptions.AggressiveInlining)] char Char() { byte b = 0; do b = read(); while (b < 33 || 126 < b); return (char)b; } [MethodImpl(MethodImplOptions.AggressiveInlining)] virtual public string Scan() { var sb = new StringBuilder(); for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b); return sb.ToString(); } [MethodImpl(MethodImplOptions.AggressiveInlining)] virtual public long Long() { long ret = 0; byte b = 0; var ng = false; do b = read(); while (b != '-' && (b < '0' || '9' < b)); if (b == '-') { ng = true; b = read(); } for (; true; b = read()) { if (b < '0' || '9' < b) return ng ? -ret : ret; else ret = (ret << 3) + (ret << 1) + b - '0'; } } [MethodImpl(MethodImplOptions.AggressiveInlining)] virtual public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); } } class LIB_FastIODebug : LIB_FastIO { Queue<string> param = new Queue<string>(); [MethodImpl(MethodImplOptions.AggressiveInlining)] string NextString() { if (param.Count == 0) foreach (var item in Console.ReadLine().Split(' ')) param.Enqueue(item); return param.Dequeue(); } [MethodImpl(MethodImplOptions.AggressiveInlining)] public LIB_FastIODebug() { } [MethodImpl(MethodImplOptions.AggressiveInlining)] public override string Scan() => NextString(); [MethodImpl(MethodImplOptions.AggressiveInlining)] public override long Long() => long.Parse(NextString()); [MethodImpl(MethodImplOptions.AggressiveInlining)] public override double Double() => double.Parse(NextString()); } partial struct LIB_Mod : IEquatable<LIB_Mod>, IEquatable<long> { static public long _mod = 1000000007; long v; [MethodImpl(MethodImplOptions.AggressiveInlining)] public LIB_Mod(long x) { if (x < _mod && x >= 0) v = x; else if ((v = x % _mod) < 0) v += _mod; } [MethodImpl(MethodImplOptions.AggressiveInlining)] static public implicit operator LIB_Mod(long x) => new LIB_Mod(x); [MethodImpl(MethodImplOptions.AggressiveInlining)] static public implicit operator long(LIB_Mod x) => x.v; [MethodImpl(MethodImplOptions.AggressiveInlining)] public void Add(LIB_Mod x) { if ((v += x.v) >= _mod) v -= _mod; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public void Sub(LIB_Mod x) { if ((v -= x.v) < 0) v += _mod; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public void Mul(LIB_Mod x) => v = (v * x.v) % _mod; [MethodImpl(MethodImplOptions.AggressiveInlining)] public void Div(LIB_Mod x) => v = (v * Inverse(x.v)) % _mod; [MethodImpl(MethodImplOptions.AggressiveInlining)] static public LIB_Mod operator +(LIB_Mod x, LIB_Mod y) { var t = x.v + y.v; return t >= _mod ? new LIB_Mod { v = t - _mod } : new LIB_Mod { v = t }; } [MethodImpl(MethodImplOptions.AggressiveInlining)] static public LIB_Mod operator -(LIB_Mod x, LIB_Mod y) { var t = x.v - y.v; return t < 0 ? new LIB_Mod { v = t + _mod } : new LIB_Mod { v = t }; } [MethodImpl(MethodImplOptions.AggressiveInlining)] static public LIB_Mod operator *(LIB_Mod x, LIB_Mod y) => x.v * y.v; [MethodImpl(MethodImplOptions.AggressiveInlining)] static public LIB_Mod operator /(LIB_Mod x, LIB_Mod y) => x.v * Inverse(y.v); [MethodImpl(MethodImplOptions.AggressiveInlining)] static public bool operator ==(LIB_Mod x, LIB_Mod y) => x.v == y.v; [MethodImpl(MethodImplOptions.AggressiveInlining)] static public bool operator !=(LIB_Mod x, LIB_Mod y) => x.v != y.v; [MethodImpl(MethodImplOptions.AggressiveInlining)] static public long Inverse(long x) { long b = _mod, r = 1, u = 0, t = 0; while (b > 0) { var q = x / b; t = u; u = r - q * u; r = t; t = b; b = x - q * b; x = t; } return r < 0 ? r + _mod : r; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public bool Equals(LIB_Mod x) => v == x.v; [MethodImpl(MethodImplOptions.AggressiveInlining)] public bool Equals(long x) => v == x; [MethodImpl(MethodImplOptions.AggressiveInlining)] public override bool Equals(object x) => x == null ? false : Equals((LIB_Mod)x); [MethodImpl(MethodImplOptions.AggressiveInlining)] public override int GetHashCode() => v.GetHashCode(); [MethodImpl(MethodImplOptions.AggressiveInlining)] public override string ToString() => v.ToString(); static List<LIB_Mod> _fact = new List<LIB_Mod>() { 1 }; static long _factm = _mod; [MethodImpl(MethodImplOptions.AggressiveInlining)] static void B(long n) { if (_factm != _mod) _fact = new List<LIB_Mod>() { 1 }; if (n >= _fact.Count) for (int i = _fact.Count; i <= n; ++i) _fact.Add(_fact[i - 1] * i); _factm = _mod; } [MethodImpl(MethodImplOptions.AggressiveInlining)] static public LIB_Mod Comb(long n, long k) { B(n); if (n == 0 && k == 0) return 1; if (n < k || n < 0) return 0; return _fact[(int)n] / _fact[(int)(n - k)] / _fact[(int)k]; } [MethodImpl(MethodImplOptions.AggressiveInlining)] static public LIB_Mod CombOK(long n, long k) { LIB_Mod ret = 1; for (var i = 0; i < k; i++) ret *= n - i; for (var i = 1; i <= k; i++) ret /= i; return ret; } [MethodImpl(MethodImplOptions.AggressiveInlining)] static public LIB_Mod Perm(long n, long k) { B(n); if (n == 0 && k == 0) return 1; if (n < k || n < 0) return 0; return _fact[(int)n] / _fact[(int)(n - k)]; } [MethodImpl(MethodImplOptions.AggressiveInlining)] static public LIB_Mod KanzenPerm(long n) => Enumerable.Range(0, (int)n + 1).Aggregate((LIB_Mod)0, (a, e) => a + (1 - ((e & 1) << 1)) * LIB_Mod.Comb(n, e) * LIB_Mod.Perm(n - e, n - e)); [MethodImpl(MethodImplOptions.AggressiveInlining)] static public LIB_Mod Pow(LIB_Mod x, long y) { LIB_Mod a = 1; while (y != 0) { if ((y & 1) == 1) a.Mul(x); x.Mul(x); y >>= 1; } return a; } } }