結果

問題 No.449 ゆきこーだーの雨と雪 (4)
ユーザー eitahoeitaho
提出日時 2016-12-03 15:16:33
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 4,663 bytes
コンパイル時間 1,139 ms
コンパイル使用メモリ 115,732 KB
実行使用メモリ 58,532 KB
最終ジャッジ日時 2023-10-23 16:01:16
合計ジャッジ時間 16,092 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 38 ms
26,948 KB
testcase_01 AC 40 ms
27,012 KB
testcase_02 AC 37 ms
26,948 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 AC 370 ms
57,668 KB
testcase_38 AC 329 ms
51,776 KB
testcase_39 AC 309 ms
51,776 KB
testcase_40 AC 299 ms
51,776 KB
testcase_41 AC 356 ms
53,428 KB
testcase_42 AC 361 ms
53,428 KB
testcase_43 AC 259 ms
45,480 KB
testcase_44 AC 259 ms
43,448 KB
testcase_45 AC 386 ms
58,532 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.IO;
using System.Linq;
using System.Text;
using System.Text.RegularExpressions;
using System.Collections.Generic;
using System.Diagnostics;
using System.Numerics;
using Enu = System.Linq.Enumerable;

public class Program
{
    public void Solve()
    {
        int NP = Reader.Int();
        var P = Reader.IntArray(NP);
        int Q = Reader.Int();
        var table = Reader.StringTable(Q);

        var nameId = new Dictionary<string, int>();
        foreach (var t in table)
            if (!nameId.ContainsKey(t[0]))
                nameId[t[0]] = nameId.Count;
        int N = nameId.Count;

        var scoreSet = new SortedSet<long>();
        scoreSet.Add(0);
        var scoreAt = new long[Q];
        var score = new long[N];
        var solved = new int[26];
        var dic = new Dictionary<long, int>();
        dic[0] = N;
        Func<long, int> Add = x => dic[x] = dic.ContainsKey(x) ? dic[x] + 1 : 1;

        for (int qi = 0; qi < Q; qi++)
            if (table[qi][1] != "?")
            {
                int who = nameId[table[qi][0]];
                int prob = table[qi][1][0] - 'A';
                dic[score[who]]--;
                score[who] += 50 * P[prob] + 500 * P[prob] / (8 + 2 * ++solved[prob]);
                Add(score[who]);
                scoreAt[qi] = ((long)score[who] << 32) + (N - dic[score[who]]);
                scoreSet.Add(scoreAt[qi]);
            }

        int M = scoreSet.Count;
        var sorted = scoreSet.ToArray();
        var count = new BinaryIndexedTree(M);
        count.Add(0, N);
        Array.Clear(score, 0, score.Length);

        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        for (int qi = 0; qi < Q; qi++)
        {
            int who = nameId[table[qi][0]];
            if (table[qi][1] == "?")
                Console.WriteLine(N - count.Sum(Array.BinarySearch(sorted, score[who]) - 1));
            else
            {
                count.Add(Array.BinarySearch(sorted, score[who]), -1);
                score[who] = scoreAt[qi];
                count.Add(Array.BinarySearch(sorted, score[who]), 1);
            }
        }
        Console.Out.Flush();
    }
}


class BinaryIndexedTree
{
    private readonly int N;
    private readonly int[] A;

    public BinaryIndexedTree(int N)
    {
        this.N = N + 1;
        A = new int[N + 2];
    }
    public void Add(int i, int val)
    {
        if (i < 0) return;
        for (++i; i <= N; i += i & -i) A[i] += val;
    }
    public void Update(int i, int val)
    {
        Add(i, val - (Sum(i) - Sum(i - 1)));
    }
    public int Sum(int i) // [0, i]
    {
        if (i < 0) return 0;
        int sum = 0;
        for (++i; i > 0; i &= i - 1) sum += A[i];
        return sum;
    }
    public int Sum(int L, int R) // [L, R)
    {
        return Sum(R - 1) - Sum(L - 1);
    }
}



class Entry { static void Main() { new Program().Solve(); } }
class Reader
{
    static TextReader reader = Console.In;
    static readonly char[] separator = { ' ' };
    static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries;
    static string[] A = new string[0];
    static int i;
    static void Init() { A = new string[0]; }
    public static void Set(TextReader r) { reader = r; Init(); }
    public static void Set(string file) { reader = new StreamReader(file); Init(); }
    public static bool HasNext() { return CheckNext(); }
    public static string String() { return Next(); }
    public static int Int() { return int.Parse(Next()); }
    public static long Long() { return long.Parse(Next()); }
    public static double Double() { return double.Parse(Next()); }
    public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); }
    public static int[] IntArray(int N) { return Range(N, Int); }
    public static int[][] IntTable(int H) { return Range(H, IntLine); }
    public static string[] StringArray(int N) { return Range(N, Next); }
    public static string[][] StringTable(int N) { return Range(N, () => Split(Line())); }
    public static string Line() { return reader.ReadLine().Trim(); }
    public static T[] Range<T>(int N, Func<T> f) { var r = new T[N]; for (int i = 0; i < N; r[i++] = f()) ; return r; }
    static string[] Split(string s) { return s.Split(separator, op); }
    static string Next() { CheckNext(); return A[i++]; }
    static bool CheckNext()
    {
        if (i < A.Length) return true;
        string line = reader.ReadLine();
        if (line == null) return false;
        if (line == "") return CheckNext();
        A = Split(line);
        i = 0;
        return true;
    }
}
0