結果

問題 No.1629 Sorting Integers (SUM of M)
ユーザー KumaTachiRenKumaTachiRen
提出日時 2022-10-18 22:31:56
言語 C#
(.NET 8.0.203)
結果
AC  
実行時間 50 ms / 2,000 ms
コード長 8,674 bytes
コンパイル時間 6,895 ms
コンパイル使用メモリ 145,320 KB
実行使用メモリ 164,176 KB
最終ジャッジ日時 2023-09-11 14:32:47
合計ジャッジ時間 8,907 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
23,628 KB
testcase_01 AC 42 ms
23,580 KB
testcase_02 AC 41 ms
23,548 KB
testcase_03 AC 41 ms
25,788 KB
testcase_04 AC 45 ms
25,008 KB
testcase_05 AC 42 ms
25,748 KB
testcase_06 AC 42 ms
24,012 KB
testcase_07 AC 47 ms
25,584 KB
testcase_08 AC 45 ms
24,876 KB
testcase_09 AC 46 ms
25,376 KB
testcase_10 AC 46 ms
25,000 KB
testcase_11 AC 43 ms
24,428 KB
testcase_12 AC 45 ms
25,156 KB
testcase_13 AC 45 ms
25,336 KB
testcase_14 AC 43 ms
24,480 KB
testcase_15 AC 45 ms
25,172 KB
testcase_16 AC 44 ms
25,092 KB
testcase_17 AC 50 ms
164,176 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  Determining projects to restore...
  Restored /home/judge/data/code/main.csproj (in 115 ms).
.NET 向け Microsoft (R) Build Engine バージョン 17.0.0-preview-21470-01+cb055d28f
Copyright (C) Microsoft Corporation.All rights reserved.

  プレビュー版の .NET を使用しています。https://aka.ms/dotnet-core-preview をご覧ください
  main -> /home/judge/data/code/bin/Release/net6.0/main.dll
  main -> /home/judge/data/code/bin/Release/net6.0/publish/

ソースコード

diff # 

using System.Diagnostics;
using System;
using System.Linq;
using System.Numerics;
using System.Collections;
using System.Collections.Generic;
using System.IO;
using System.Text;
using static Functions;

using N = System.Int64;

static class Program
{
    static public void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        var solver = new Solver();
        solver.Solve();
        Console.Out.Flush();
    }
}

public class Solver
{
    public void Solve()
    {
        int n = ri;
        var c = new int[9];
        for (int i = 0; i < 9; i++) c[i] = ri;
        ModInt ans = 0;
        var f = new ModFrac(n);
        ModInt a = f.f[n - 1];
        for (int i = 0; i < 9; i++) a *= f.fi[c[i]];
        for (int i = 0; i < 9; i++)
            ans += (i + 1) * a * c[i];
        ans *= (new ModInt(10).Pow(n) - 1) / 9;
        Write(ans);
    }

    class ModFrac
    {
        public ModInt[] f;
        public ModInt[] fi;
        public ModFrac(long n)
        {
            f = new ModInt[n + 1];
            fi = new ModInt[n + 1];
            f[0] = 1;
            for (long i = 0; i < n; i++) f[i + 1] = f[i] * (i + 1);
            fi[n] = f[n].Inv;
            for (long i = n; i > 0; i--) fi[i - 1] = fi[i] * i;
        }
        public ModInt Binom(long n, long k)
        {
            if (n < 0) return 0;
            if (n == 0) return k == 0 ? 1 : 0;
            return 0 <= k && k <= n ? f[n] * fi[k] * fi[n - k] : 0;
        }
    }
    struct ModInt
    {
        private const long MOD = 1000000007;
        //private const long MOD = 998244353;
        long Val;
        public ModInt(long v)
        {
            if (v < 0)
            {
                Val = v % MOD;
                if (Val < 0) Val += MOD;
            }
            else if (v >= MOD) Val = v % MOD;
            else Val = v;
        }
        public override string ToString() { return Val.ToString(); }
        public override bool Equals(object obj) => obj is ModInt other && this.Equals(other);
        public bool Equals(ModInt x) => Val == x.Val;
        public override int GetHashCode() => Val.GetHashCode();
        public static bool operator ==(ModInt a, ModInt b) { return a.Val == b.Val; }
        public static bool operator !=(ModInt a, ModInt b) { return a.Val != b.Val; }
        public static implicit operator ModInt(long n)
        {
            long r = n % MOD;
            return new ModInt(r < 0 ? r + MOD : r);
        }
        public static ModInt operator +(ModInt a, ModInt b)
        {
            long r = a.Val + b.Val;
            return new ModInt(r < MOD ? r : r - MOD);
        }
        public static ModInt operator -(ModInt a, ModInt b)
        {
            long r = a.Val - b.Val;
            return new ModInt(r < 0 ? r + MOD : r);
        }
        public static ModInt operator -(ModInt a) => new ModInt(a.Val == 0 ? 0 : MOD - a.Val);
        public static ModInt operator *(ModInt a, ModInt b) => new ModInt(a.Val * b.Val % MOD);
        public static ModInt operator /(ModInt a, ModInt b) => a * b.Inv;
        public ModInt Pow(long n)
        {
            long t = Val, r = 1;
            while (n > 0)
            {
                if ((n & 1) == 1) r = r * t % MOD;
                t = t * t % MOD;
                n >>= 1;
            }
            return new ModInt(r);
        }
        public ModInt Inv { get => this.Pow(MOD - 2); }
    }



    const long inf = (long)1 << 60;
    int ri { get { return (int)sc.Integer(); } }
    long rl { get { return sc.Integer(); } }
    double rd { get { return sc.Double(); } }
    string rs { get { return sc.Scan(); } }
    string rline { get { return sc.Line(); } }
    public StreamScanner sc = new StreamScanner(Console.OpenStandardInput());

    T[] RepArray<T>(T t, int count) => Enumerable.Repeat(t, count).ToArray();
    void WriteJoin<T>(string s, IEnumerable<T> t) { Console.WriteLine(string.Join(s, t)); }
    void WriteMax(params long[] x) => Console.Write(x.Max());
    void WriteMin(params long[] x) => Console.Write(x.Min());
    void Write<T>(T t) { Console.WriteLine(t.ToString()); }
    void WriteFlush<T>(T t) { Console.WriteLine(t.ToString()); Console.Out.Flush(); }
    void WriteError<T>(T t) { Console.Error.WriteLine(t.ToString()); }
    void YN(bool t) { Console.WriteLine(t ? "YES" : "NO"); }
    void Yn(bool t) { Console.WriteLine(t ? "Yes" : "No"); }
    void yn(bool t) { Console.WriteLine(t ? "yes" : "no"); }
}

public static class Functions
{
    public static int Popcount(long x)
    {
        x = x - ((x >> 1) & 0x5555555555555555);
        x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333);
        x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f;
        x = x + (x >> 8);
        x = x + (x >> 16);
        x = x + (x >> 32);
        return (int)(x & 0x0000007f);
    }
    public static int Ctz(long x)
    {
        if (x == 0) return -1;
        return Popcount((x & -x) - 1);
    }
    public static int SafeMod(int x, int m)
    {
        int r = x % m;
        return r < 0 ? r + m : r;
    }
    public static long SafeMod(long x, long m)
    {
        long r = x % m;
        return r < 0 ? r + m : r;
    }
    public static long Floor(long a, long b) => a >= 0 ? a / b : (a + 1) / b - 1;
    public static long Ceil(long a, long b) => a > 0 ? (a - 1) / b + 1 : a / b;
    public static int Gcd(int a, int b) => b == 0 ? a : Gcd(b, a % b);
    public static long Gcd(long a, long b) => b == 0 ? a : Gcd(b, a % b);
    public static void Swap(ref int x, ref int y) { x ^= y; y ^= x; x ^= y; }
    public static void Swap(ref long x, ref long y) { x ^= y; y ^= x; x ^= y; }
    public static void Swap<T>(ref T x, ref T y) { T t = y; y = x; x = t; }
    public static T Clamp<T>(T x, T l, T r) where T : IComparable<T> => x.CompareTo(l) <= 0 ? l : (x.CompareTo(r) <= 0 ? x : r);
    public static void Chmin<T>(ref T x, T y) where T : IComparable<T> { if (x.CompareTo(y) > 0) x = y; }
    public static void Chmax<T>(ref T x, T y) where T : IComparable<T> { if (x.CompareTo(y) < 0) x = y; }
    public static int LowerBound<T, S>(in T[] list, S val, Func<T, S, int> comp)
    {
        if (list.Length == 0) return -1;
        int l = 0, r = list.Length;
        while (l < r)
        {
            int x = (l + r) / 2;
            if (comp(list[x], val) < 0) l = x + 1;
            else r = x;
        }
        return l;
    }
    public static int LowerBound<T, S>(in List<T> list, S val, Func<T, S, int> comp)
    {
        if (list.Count == 0) return -1;
        int l = 0, r = list.Count;
        while (l < r)
        {
            int x = (l + r) / 2;
            if (comp(list[x], val) < 0) l = x + 1;
            else r = x;
        }
        return l;
    }
    public static int UpperBound<T, S>(in List<T> list, S val, Func<T, S, int> comp)
    {
        if (list.Count == 0) return 0;
        if (comp(list.Last(), val) < 0) return list.Count;
        int l = 0, r = list.Count;
        while (l < r)
        {
            int x = (l + r) / 2;
            if (comp(list[x], val) <= 0) l = x + 1;
            else r = x;
        }
        return l;
    }
}

public class StreamScanner
{
    public StreamScanner(Stream stream) { str = stream; }
    private readonly Stream str;
    private readonly byte[] buf = new byte[1024];
    private int len, ptr;
    public bool isEof = false;
    public bool IsEndOfStream { get { return isEof; } }
    private byte read()
    {
        if (isEof) throw new EndOfStreamException();
        if (ptr >= len)
        {
            ptr = 0;
            if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; }
        }
        return buf[ptr++];
    }
    public char Char()
    {
        byte b = 0;
        do b = read();
        while (b < 33 || 126 < b);
        return (char)b;
    }
    public string Line()
    {
        var sb = new StringBuilder();
        for (var b = Char(); b != 10 && !isEof; b = (char)read()) sb.Append(b);
        return sb.ToString();
    }
    public string Scan()
    {
        var sb = new StringBuilder();
        for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b);
        return sb.ToString();
    }
    public long Integer()
    {
        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 * 10 + b - '0';
        }
    }
    public double Double() { return double.Parse(Scan()); }
}
0