結果
問題 | No.449 ゆきこーだーの雨と雪 (4) |
ユーザー |
![]() |
提出日時 | 2016-12-03 15:25:52 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 332 ms / 5,000 ms |
コード長 | 4,614 bytes |
コンパイル時間 | 1,039 ms |
コンパイル使用メモリ | 116,664 KB |
実行使用メモリ | 59,296 KB |
最終ジャッジ日時 | 2024-09-22 10:31:41 |
合計ジャッジ時間 | 13,615 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 43 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
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;Action<long> 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';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, N);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;}}