Submission #352019


Source Code Expand

using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.IO;

class Myon
{
    public Myon() { }
    public static int Main()
    {
        new Myon().calc();
        return 0;
    }

    Scanner cin;

    long mod = (int)1e9 + 7;
    void calc()
    {
        cin = new Scanner();

        int N = cin.nextInt();
        int[] T = new int[N];
        for (int i = 0; i < N; i++)
        {
            T[i] = cin.nextInt();
        }

        Array.Sort(T);

        long ret1 = 0;
        long now = 0;

        long ret2 = 1;

        int pre = -1;
        int precount = 0;

        for (int i = 0; i < N; i++)
        {
            now += T[i];
            ret1 += now;
            if (pre == T[i]) precount++;
            else
            {
                pre = T[i];
                precount = 1;
            }
            ret2 *= precount;
            ret2 %= mod;
        }

        Console.WriteLine(ret1);
        Console.WriteLine(ret2);
    }
}




class Scanner
{
    string[] s;
    int i;

    char[] cs = new char[] { ' ' };

    public Scanner()
    {
        s = new string[0];
        i = 0;
    }

    public string next()
    {
        if (i < s.Length) return s[i++];
        string st = Console.ReadLine();
        while (st == "") st = Console.ReadLine();
        s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
        i = 0;
        return s[i++];
    }

    public int nextInt()
    {
        return int.Parse(next());
    }

    public long nextLong()
    {
        return long.Parse(next());
    }

    public double nextDouble()
    {
        return double.Parse(next());
    }

}


class XRand
{
    uint x, y, z, w;


    public XRand()
    {
        init();
    }

    public XRand(uint s)
    {
        init();
        init_xor128(s);
    }

    void init()
    {
        x = 314159265; y = 358979323; z = 846264338; w = 327950288;

    }

    public void init_xor128(uint s)
    {
        z ^= s;
        z ^= z >> 21; z ^= z << 35; z ^= z >> 4;
        z *= 736338717;
    }

    uint next()
    {
        uint t = x ^ x << 11; x = y; y = z; z = w; return w = w ^ w >> 19 ^ t ^ t >> 8;
    }

    public long nextLong(long m)
    {
        return (long)((((ulong)next() << 32) + next()) % (ulong)m);
    }

    public int nextInt(int m)
    {
        return (int)(next() % m);
    }

    public long nextLong(long min, long max)
    {
        return min + nextLong(max - min + 1);
    }

    public int nextInt(int min, int max)
    {
        return min + nextInt(max - min + 1);
    }

    public int nextIntP(int a)
    {
        return (int)Math.Pow(a, nextDouble());
    }

    public int nextIntP(int min, int max)
    {
        int diff = max - min;
        return min + nextIntP(diff + 2) - 1;
    }

    public long nextLongP(long a)
    {
        return (long)Math.Pow(a, nextDouble());
    }

    public long nextLongP(long min, long max)
    {
        long diff = max - min;
        return min + nextLongP(diff + 2) - 1;
    }


    public double nextDouble()
    {
        return (double)next() / uint.MaxValue;
    }

    public double nextDoubleP(double a)
    {
        return Math.Pow(a, nextDouble());
    }
}

Submission Info

Submission Time
Task B - アットコーダー王国のコンテスト事情
User chokudai
Language C# (Mono 3.2.1.0)
Score 100
Code Size 3409 Byte
Status AC
Exec Time 182 ms
Memory 9808 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 50 / 50 50 / 50
Status
AC × 3
AC × 23
AC × 42
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt
Subtask1 subtask0_sample_01.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt
All subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 167 ms 9004 KB
subtask0_sample_02.txt AC 168 ms 9004 KB
subtask0_sample_03.txt AC 170 ms 9020 KB
subtask1_01.txt AC 168 ms 9004 KB
subtask1_02.txt AC 167 ms 9000 KB
subtask1_03.txt AC 173 ms 9028 KB
subtask1_04.txt AC 166 ms 9004 KB
subtask1_05.txt AC 167 ms 9000 KB
subtask1_06.txt AC 166 ms 9004 KB
subtask1_07.txt AC 167 ms 9004 KB
subtask1_08.txt AC 167 ms 8996 KB
subtask1_09.txt AC 178 ms 9716 KB
subtask1_10.txt AC 178 ms 9708 KB
subtask1_11.txt AC 179 ms 9696 KB
subtask1_12.txt AC 178 ms 9720 KB
subtask1_13.txt AC 177 ms 9716 KB
subtask1_14.txt AC 177 ms 9716 KB
subtask1_15.txt AC 178 ms 9716 KB
subtask1_16.txt AC 181 ms 9720 KB
subtask1_17.txt AC 179 ms 9712 KB
subtask1_18.txt AC 178 ms 9712 KB
subtask1_19.txt AC 177 ms 9716 KB
subtask1_20.txt AC 165 ms 8872 KB
subtask1_21.txt AC 166 ms 8932 KB
subtask1_22.txt AC 168 ms 8960 KB
subtask2_01.txt AC 178 ms 9708 KB
subtask2_02.txt AC 176 ms 9744 KB
subtask2_03.txt AC 177 ms 9688 KB
subtask2_04.txt AC 178 ms 9708 KB
subtask2_05.txt AC 178 ms 9712 KB
subtask2_06.txt AC 179 ms 9704 KB
subtask2_07.txt AC 182 ms 9680 KB
subtask2_08.txt AC 179 ms 9716 KB
subtask2_09.txt AC 180 ms 9708 KB
subtask2_10.txt AC 179 ms 9720 KB
subtask2_11.txt AC 181 ms 9712 KB
subtask2_12.txt AC 181 ms 9748 KB
subtask2_13.txt AC 176 ms 9720 KB
subtask2_14.txt AC 180 ms 9716 KB
subtask2_15.txt AC 178 ms 9808 KB
subtask2_16.txt AC 179 ms 9720 KB
subtask2_17.txt AC 177 ms 9716 KB