結果

問題 No.449 ゆきこーだーの雨と雪 (4)
ユーザー りあんりあん
提出日時 2016-10-26 19:44:47
言語 C#(csc)
(csc 3.9.0)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 4,192 bytes
コンパイル時間 1,214 ms
コンパイル使用メモリ 117,128 KB
実行使用メモリ 66,268 KB
最終ジャッジ日時 2024-09-22 09:25:59
合計ジャッジ時間 124,120 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 43 ms
27,308 KB
testcase_01 AC 45 ms
29,476 KB
testcase_02 AC 43 ms
25,784 KB
testcase_03 AC 58 ms
29,632 KB
testcase_04 AC 58 ms
29,756 KB
testcase_05 AC 59 ms
28,064 KB
testcase_06 AC 55 ms
27,696 KB
testcase_07 AC 58 ms
31,808 KB
testcase_08 AC 55 ms
27,948 KB
testcase_09 AC 56 ms
27,680 KB
testcase_10 AC 54 ms
27,820 KB
testcase_11 AC 57 ms
29,600 KB
testcase_12 AC 2,500 ms
51,312 KB
testcase_13 AC 4,041 ms
52,944 KB
testcase_14 AC 3,264 ms
55,032 KB
testcase_15 AC 4,331 ms
58,928 KB
testcase_16 AC 3,604 ms
57,864 KB
testcase_17 AC 3,602 ms
53,764 KB
testcase_18 AC 2,505 ms
51,184 KB
testcase_19 AC 3,247 ms
54,836 KB
testcase_20 AC 3,248 ms
55,012 KB
testcase_21 AC 3,940 ms
56,844 KB
testcase_22 AC 3,990 ms
57,020 KB
testcase_23 AC 2,492 ms
51,308 KB
testcase_24 AC 3,614 ms
55,616 KB
testcase_25 AC 2,082 ms
51,960 KB
testcase_26 AC 1,690 ms
50,400 KB
testcase_27 AC 3,956 ms
55,740 KB
testcase_28 AC 4,007 ms
57,024 KB
testcase_29 AC 3,269 ms
57,072 KB
testcase_30 AC 4,359 ms
58,872 KB
testcase_31 AC 3,996 ms
57,168 KB
testcase_32 AC 3,261 ms
55,268 KB
testcase_33 AC 3,623 ms
56,076 KB
testcase_34 AC 2,097 ms
52,216 KB
testcase_35 AC 4,333 ms
57,072 KB
testcase_36 AC 2,094 ms
51,588 KB
testcase_37 TLE -
testcase_38 AC 3,402 ms
58,924 KB
testcase_39 AC 2,937 ms
57,652 KB
testcase_40 AC 3,497 ms
57,524 KB
testcase_41 AC 4,954 ms
60,676 KB
testcase_42 AC 4,980 ms
55,788 KB
testcase_43 AC 2,012 ms
54,584 KB
testcase_44 AC 3,103 ms
55,376 KB
testcase_45 TLE -
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.IO;
using System.Text;

class contestant
{
    static int n;
    static int[] lev;
    static int[] counts;
    public string name;
    public int sum = 0;
    public long uniscore = 0;
    public long preuni = 0;
    public static void init(int _n, int[] _lev)
    {
        n = _n;
        lev = _lev;
        counts = new int[n];
    }
    public contestant(string name)
    {
        this.name = name;
    }
    public long submit(char c, int t)
    {
        int p = c - 'A';
        sum += lev[p] * 50 + (int)(lev[p] * 50 / (1 + 0.2 * counts[p]) + 1e-9);
        ++counts[p];
        preuni = uniscore;
        return uniscore = (long)sum * 100000 - t;
    }
}
class Program
{
    static StreamWriter sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
    static void Main()
    {
        var sc = new Scan();
        int n = sc.Int;
        var lev = sc.IntArr;
        contestant.init(n, lev);
        var id = new SortedDictionary<string, int>();
        var lis = new List<contestant>();
        var uniscore = new List<long>();
        var zip = new SortedDictionary<long, int>();
        int t = sc.Int;
        var np = new string[t][];
        var unis = new long[t];
        var preuni = new long[t];
        uniscore.Add(0);
        for (int i = 0; i < t; i++)
        {
            np[i] = sc.StrArr;
            if (np[i][1] == "?")
            {
                unis[i] = lis[id[np[i][0]]].uniscore;
                continue;
            }
            if (!id.ContainsKey(np[i][0]))
            {
                id.Add(np[i][0], lis.Count);
                lis.Add(new contestant(np[i][0]));
            }
            else
            {
                preuni[i] = lis[id[np[i][0]]].uniscore;
            }
            unis[i] = lis[id[np[i][0]]].submit(np[i][1][0], 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 sg = new Segtree<int>(lim + 1, (i, j) => i + j, 0);
        for (int i = 0; i < t; ++i)
        {
            int zuni = zip[unis[i]];
            if (np[i][1] == "?")
            {
                sw.WriteLine(sg.run(zuni, lim + 1));
                continue;
            }
            sg.update(zip[preuni[i]], 0);
            sg.update(zuni, 1);
        }
        sw.Flush();
    }
    static void Prt<T>(IEnumerable<T> a) => sw.WriteLine(string.Join(" ", a));
}
class Scan
{
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public string Str => Console.ReadLine().Trim();
    public int[] IntArr => StrArr.Select(int.Parse).ToArray();
    public long[] LongArr => StrArr.Select(long.Parse).ToArray();
    public double[] DoubleArr => StrArr.Select(double.Parse).ToArray();
    public string[] StrArr => Str.Split();
}
class Segtree<T>
{
    int n, s, t;
    T[] tr;
    Func<T, T, T> f;
    T exnum;
    public Segtree(int m, Func<T, T, T> f, T ex)
    {
        this.f = f;
        this.exnum = ex;
        n = 1;
        while (n < m) n <<= 1;
        tr = new T[(n << 1) - 1];
        for (int i = 0; i < tr.Length; i++) tr[i] = ex;
    }
    public Segtree(int m, T ini, Func<T, T, T> f, T ex) : this(m, f, ex)
    {
        for (int i = 0; i < m; ++i) tr[i + n - 1] = ini;
        all_update();
    }
    public void assign(int j, T x) => tr[j + n - 1] = x;
    public void update(int j, T x)
    {
        int i = j + n - 1;
        tr[i] = x;
        while (i > 0) { i = i - 1 >> 1; tr[i] = f(tr[i << 1 | 1], tr[i + 1 << 1]); }
    }
    public void all_update() { for (int i = n - 2; i >= 0; i--) tr[i] = f(tr[i << 1 | 1], tr[i + 1 << 1]); }
    public T look(int i) => tr[i + n - 1];

    // [s, t)
    public T run(int s, int t) { this.s = s; this.t = t; return q(0, 0, n); }
    T q(int k, int l, int r) => r <= s || t <= l ? exnum
                              : s <= l && r <= t ? tr[k]
                              : f(q(k << 1 | 1, l, l + r >> 1), q(k + 1 << 1, l + r >> 1, r));
}
0