結果

問題 No.449 ゆきこーだーの雨と雪 (4)
ユーザー りあんりあん
提出日時 2016-11-18 12:03:49
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 383 ms / 5,000 ms
コード長 11,930 bytes
コンパイル時間 1,260 ms
コンパイル使用メモリ 117,612 KB
実行使用メモリ 53,984 KB
最終ジャッジ日時 2023-10-22 08:27:32
合計ジャッジ時間 15,156 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge9
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 40 ms
27,348 KB
testcase_01 AC 39 ms
27,416 KB
testcase_02 AC 38 ms
27,284 KB
testcase_03 AC 41 ms
27,420 KB
testcase_04 AC 41 ms
27,420 KB
testcase_05 AC 41 ms
27,420 KB
testcase_06 AC 41 ms
27,420 KB
testcase_07 AC 41 ms
27,420 KB
testcase_08 AC 41 ms
27,420 KB
testcase_09 AC 42 ms
27,420 KB
testcase_10 AC 42 ms
27,420 KB
testcase_11 AC 42 ms
27,420 KB
testcase_12 AC 309 ms
42,924 KB
testcase_13 AC 356 ms
48,720 KB
testcase_14 AC 313 ms
45,720 KB
testcase_15 AC 378 ms
49,516 KB
testcase_16 AC 334 ms
45,908 KB
testcase_17 AC 329 ms
45,880 KB
testcase_18 AC 304 ms
42,944 KB
testcase_19 AC 316 ms
45,756 KB
testcase_20 AC 312 ms
45,796 KB
testcase_21 AC 359 ms
48,640 KB
testcase_22 AC 366 ms
48,716 KB
testcase_23 AC 312 ms
42,936 KB
testcase_24 AC 338 ms
45,856 KB
testcase_25 AC 282 ms
41,880 KB
testcase_26 AC 254 ms
40,100 KB
testcase_27 AC 355 ms
48,628 KB
testcase_28 AC 358 ms
48,668 KB
testcase_29 AC 317 ms
45,804 KB
testcase_30 AC 383 ms
49,548 KB
testcase_31 AC 356 ms
48,728 KB
testcase_32 AC 316 ms
45,708 KB
testcase_33 AC 331 ms
45,808 KB
testcase_34 AC 284 ms
41,940 KB
testcase_35 AC 376 ms
49,592 KB
testcase_36 AC 284 ms
41,916 KB
testcase_37 AC 343 ms
53,984 KB
testcase_38 AC 290 ms
48,252 KB
testcase_39 AC 279 ms
48,252 KB
testcase_40 AC 276 ms
48,252 KB
testcase_41 AC 352 ms
52,392 KB
testcase_42 AC 362 ms
52,392 KB
testcase_43 AC 285 ms
41,136 KB
testcase_44 AC 340 ms
46,396 KB
testcase_45 AC 343 ms
53,984 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

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

using Binary = System.Func<System.Linq.Expressions.ParameterExpression, System.Linq.Expressions.ParameterExpression, System.Linq.Expressions.BinaryExpression>;
using Unary = System.Func<System.Linq.Expressions.ParameterExpression, System.Linq.Expressions.UnaryExpression>;

class Program
{
    class contestant
    {
        static int n;
        static int[] lev;
        static int[] counts;
        public int sum = 0;
        public long uniscore = 0;
        public static void init(int _n, int[] _lev)
        {
            n = _n;
            lev = _lev;
            counts = new int[n];
        }
        public long submit(char c, int t)
        {
            int p = c - 'A';
            sum += lev[p] * 50 + lev[p] * 250 / (5 + counts[p]);
            ++counts[p];
            return uniscore = (long)sum * 100010 - t;
        }
    }
    static StreamWriter sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
    const int M = 1000000007;
    const double eps = 1e-9;
    static int[] dd = { 0, 1, 0, -1, 0 };
    static void Main()
    {
        int n = sc.Int;
        var lev = sc.IntArr;
        contestant.init(n, lev);
        var cont = new Dictionary<string, contestant>();
        var uniscore = new List<long>();
        var zip = new SortedDictionary<long, int>();
        int t = sc.Int;
        var name = new string[t];
        var p = new char[t];
        var unis = new long[t];
        var preuni = new long[t];
        uniscore.Add(0);
        for (int i = 0; i < t; i++)
        {
            sc.Multi(out name[i], out p[i]);
            if (p[i] == '?')
            {
                unis[i] = cont[name[i]].uniscore;
                continue;
            }
            if (!cont.ContainsKey(name[i]))
                cont.Add(name[i], new contestant());
            else
                preuni[i] = cont[name[i]].uniscore;

            unis[i] = cont[name[i]].submit(p[i], i);
            uniscore.Add(unis[i]);
        }
        uniscore.Sort();
        int lim = uniscore.Count;
        for (int i = 0; i < lim; i++)
        {
            zip.Add(uniscore[i], i + 1);
        }
        var bit = new BIT(lim + 1);
        for (int i = 0; i < t; ++i)
        {
            int zuni = zip[unis[i]];
            if (p[i] == '?')
            {
                sw.WriteLine(bit.sum(zuni, lim + 1));
                continue;
            }
            bit.add(zip[preuni[i]], -1);
            bit.add(zuni, 1);
        }
        sw.Flush();
    }
    static void swap<T>(ref T a, ref T b) { var t = a; a = b; b = t; }
    static T Max<T>(params T[] a) => a.Max();
    static T Min<T>(params T[] a) => a.Min();
    static void DBG<T>(params T[] a) => Console.WriteLine(string.Join(" ", a));
    static void DBG(params object[] a) => Console.WriteLine(string.Join(" ", a));
    static void Prt<T>(params T[] a) => sw.WriteLine(string.Join(" ", a));
    static void Prt(params object[] a) => sw.WriteLine(string.Join(" ", a));
}
static class ex
{
    public static void swap<T>(this IList<T> a, int i, int j) { var t = a[i]; a[i] = a[j]; a[j] = t; }
    public static T[] copy<T>(this IList<T> a)
    {
        var ret = new T[a.Count];
        for (int i = 0; i < a.Count; i++) ret[i] = a[i];
        return ret;
    }
}
public static class Operator<T>
{
    static readonly ParameterExpression x = Expression.Parameter(typeof(T), "x");
    static readonly ParameterExpression y = Expression.Parameter(typeof(T), "y");
    public static readonly Func<T, T, T> Add = Lambda(Expression.Add);
    public static readonly Func<T, T, T> Subtract = Lambda(Expression.Subtract);
    public static readonly Func<T, T, T> Multiply = Lambda(Expression.Multiply);
    public static readonly Func<T, T, T> Divide = Lambda(Expression.Divide);
    public static readonly Func<T, T> Plus = Lambda(Expression.UnaryPlus);
    public static readonly Func<T, T> Negate = Lambda(Expression.Negate);
    public static Func<T, T, T> Lambda(Binary op) => Expression.Lambda<Func<T, T, T>>(op(x, y), x, y).Compile();
    public static Func<T, T> Lambda(Unary op) => Expression.Lambda<Func<T, T>>(op(x), x).Compile();
}

class scanCHK : sc
{
    public static new string Str { get { var s = Console.ReadLine(); return s == s.Trim() ? s : ""; } }
}
class sc
{
    public static int Int => int.Parse(Str);
    public static long Long => long.Parse(Str);
    public static double Double => double.Parse(Str);
    public static string Str => Console.ReadLine().Trim();
    public static int[] IntArr => StrArr.Select(int.Parse).ToArray();
    public static long[] LongArr => StrArr.Select(long.Parse).ToArray();
    public static double[] DoubleArr => StrArr.Select(double.Parse).ToArray();
    public static string[] StrArr => Str.Split();
    static bool eq<T, U>() => typeof(T).Equals(typeof(U));
    static T ct<T, U>(U inp) => (T)Convert.ChangeType(inp, typeof(T));
    static T cv<T>(string inp) => eq<T, int>() ? ct<T, int>(int.Parse(inp))
                         : eq<T, long>() ? ct<T, long>(long.Parse(inp))
                         : eq<T, double>() ? ct<T, double>(double.Parse(inp))
                         : eq<T, char>() ? ct<T, char>(inp[0])
                         : ct<T, string>(inp);
    public static void Multi<T>(out T a) => a = cv<T>(Str);
    public static void Multi<T, U>(out T a, out U b)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); }
    public static void Multi<T, U, V>(out T a, out U b, out V c)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); }
    public static void Multi<T, U, V, W>(out T a, out U b, out V c, out W d)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); }
    public static void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]); }
}
struct ModInt
{
    public static long Mod = 1000000007;
    long val;
    public ModInt(long v) { val = (v % Mod + Mod) % Mod; }

    public static implicit operator ModInt(long x) => new ModInt(x);
    public static explicit operator long(ModInt x) => x.val;

    public static ModInt operator+(ModInt x, ModInt y) => x.val + y.val;
    public static ModInt operator-(ModInt x, ModInt y) => x.val - y.val;
    public static ModInt operator*(ModInt x, ModInt y) => x.val * y.val;
    // must : gcd(y, Mod) == 1
    public static ModInt operator/(ModInt x, ModInt y) => x * ~y;
    // powmod(x, y, Mod);
    public static ModInt operator^(ModInt x, long y)
    {
        if (x.val == 0) return x;
        if (y == 0) return 1;
        var t = x ^ (y / 2);
        if ((y & 1) == 0) return t * t;
        return t * t * x;
    }

    public static ModInt operator-(ModInt x) => -(x.val);
    // inv(x) : x * inv(x) == 1
    // must : gcd(x, Mod) == 1
    public static ModInt operator~(ModInt x) => x ^ (Mod - 2);

    public override string ToString() => this.val.ToString();

    // public static bool operator==(ModInt x, ModInt y) => x.val == y.val;
    // public static bool operator!=(ModInt x, ModInt y) => x.val != y.val;
    // public override bool Equals(object obj) => obj != null && this.GetType() == obj.GetType() && this.val == ((ModInt)obj).val;
    // public override int GetHashCode() => (int)this.val;

}
class mymath
{
    public static long Mod = 1000000007;
    public static bool isprime(long a)
    {
        if (a < 2) return false;
        for (long i = 2; i * i <= a; i++) if (a % i == 0) return false;
        return true;
    }
    public static bool[] sieve(int n)
    {
        var p = new bool[n + 1];
        for (int i = 2; i <= n; i++) p[i] = true;
        for (int i = 2; i * i <= n; i++) if (p[i]) for (int j = i * i; j <= n; j += i) p[j] = false;
        return p;
    }
    public static List<int> getprimes(int n)
    {
        var prs = new List<int>();
        var p = sieve(n);
        for (int i = 2; i <= n; i++) if (p[i]) prs.Add(i);
        return prs;
    }
    public static long[][] E(int n)
    {
        var ret = new long[n][];
        for (int i = 0; i < n; i++) { ret[i] = new long[n]; ret[i][i] = 1; }
        return ret;
    }
    public static long[][] pow(long[][] A, long n)
    {
        if (n == 0) return E(A.Length);
        var t = pow(A, n / 2);
        if ((n & 1) == 0) return mul(t, t);
        return mul(mul(t, t), A);
    }
    public static long dot(long[] x, long[] y)
    {
        int n = x.Length;
        long ret = 0;
        for (int i = 0; i < n; i++) ret = (ret + x[i] * y[i]) % Mod;
        return ret;
    }
    public static long[][] trans(long[][] A)
    {
        int n = A[0].Length, m = A.Length;
        var ret = new long[n][];
        for (int i = 0; i < n; i++)
        {
            ret[i] = new long[m];
            for (int j = 0; j < m; j++) ret[i][j] = A[j][i];
        }
        return ret;
    }
    public static long[] mul(long[][] A, long[] x)
    {
        int n = A.Length;
        var ret = new long[n];
        for (int i = 0; i < n; i++) ret[i] = dot(x, A[i]);
        return ret;
    }
    public static long[][] mul(long[][] A, long[][] B)
    {
        int n = A.Length;
        var Bt = trans(B);
        var ret = new long[n][];
        for (int i = 0; i < n; i++) ret[i] = mul(Bt, A[i]);
        return ret;
    }
    public static long[] add(long[] x, long[] y)
    {
        int n = x.Length;
        var ret = new long[n];
        for (int i = 0; i < n; i++) ret[i] = (x[i] + y[i]) % Mod;
        return ret;
    }
    public static long[][] add(long[][] A, long[][] B)
    {
        int n = A.Length;
        var ret = new long[n][];
        for (int i = 0; i < n; i++) ret[i] = add(A[i], B[i]);
        return ret;
    }
    public static long pow(long a, long b)
    {
        if (a >= Mod) return pow(a % Mod, b);
        if (a == 0) return 0;
        if (b == 0) return 1;
        var t = pow(a, b / 2);
        if ((b & 1) == 0) return t * t % Mod;
        return t * t % Mod * a % Mod;
    }
    public static long inv(long a) => pow(a, Mod - 2);
    public static long gcd(long a, long b)
    {
        while (b > 0) { var t = a % b; a = b; b = t; }
        return a;
    }
    // a x + b y = gcd(a, b)
    public static long extgcd(long a, long b, out long x, out long y)
    {
        long g = a;
        x = 1;
        y = 0;
        if (b != 0)
        {
            g = extgcd(b, a % b, out y, out x);
            y -= a / b * x;
        }
        return g;
    }
    public static long lcm(long a, long b) => a * (b / gcd(a, b));
    public static long comb(int n, int r)
    {
        if (n < 0 || r < 0 || r > n) return 0;
        if (n - r < r) r = n - r;
        if (r == 0) return 1;
        if (r == 1) return n;
        int[] numer = new int[r], denom = new int[r];
        for (int k = 0; k < r; k++) { numer[k] = n - r + k + 1; denom[k] = k + 1; }
        for (int p = 2; p <= r; p++)
        {
            int piv = denom[p - 1];
            if (piv > 1)
            {
                int ofst = (n - r) % p;
                for (int k = p - 1; k < r; k += p) { numer[k - ofst] /= piv; denom[k] /= piv; }
            }
        }
        long ret = 1;
        for (int k = 0; k < r; k++) if (numer[k] > 1) ret = ret * numer[k] % Mod;
        return ret;
    }
}
class BIT
{
    int n;
    long[] bit;
    public BIT(int n)
    {
        this.n = n;
        bit = new long[n];
    }
    public void add(int j, long w)
    {
        for (int i = j; i < n; i |= i + 1) bit[i] += w;
    }
    // [0, j)
    public long sum(int j)
    {
        long ret = 0;
        for (int i = j - 1; i >= 0; i = (i & (i + 1)) - 1) ret += bit[i];

        return ret;
    }
    // [j, k)
    public long sum(int j, int k) => sum(k) - sum(j);
}
0