結果

問題 No.449 ゆきこーだーの雨と雪 (4)
ユーザー 👑 hos.lyrichos.lyric
提出日時 2019-06-11 02:17:27
言語 D
(dmd 2.105.2)
結果
AC  
実行時間 214 ms / 5,000 ms
コード長 3,489 bytes
コンパイル時間 947 ms
コンパイル使用メモリ 117,744 KB
実行使用メモリ 22,288 KB
最終ジャッジ日時 2023-09-04 01:37:30
合計ジャッジ時間 11,041 ms
ジャッジサーバーID
(参考情報)
judge13 / judge14
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 3 ms
4,376 KB
testcase_04 AC 3 ms
4,380 KB
testcase_05 AC 3 ms
4,380 KB
testcase_06 AC 2 ms
4,380 KB
testcase_07 AC 3 ms
4,380 KB
testcase_08 AC 2 ms
4,376 KB
testcase_09 AC 2 ms
4,380 KB
testcase_10 AC 2 ms
4,380 KB
testcase_11 AC 3 ms
4,376 KB
testcase_12 AC 171 ms
16,144 KB
testcase_13 AC 195 ms
20,484 KB
testcase_14 AC 183 ms
19,680 KB
testcase_15 AC 197 ms
20,532 KB
testcase_16 AC 188 ms
19,684 KB
testcase_17 AC 183 ms
19,156 KB
testcase_18 AC 169 ms
16,108 KB
testcase_19 AC 179 ms
19,664 KB
testcase_20 AC 182 ms
19,396 KB
testcase_21 AC 214 ms
20,472 KB
testcase_22 AC 197 ms
19,640 KB
testcase_23 AC 172 ms
15,968 KB
testcase_24 AC 188 ms
20,264 KB
testcase_25 AC 161 ms
15,380 KB
testcase_26 AC 151 ms
14,724 KB
testcase_27 AC 196 ms
19,736 KB
testcase_28 AC 195 ms
20,284 KB
testcase_29 AC 184 ms
20,504 KB
testcase_30 AC 204 ms
20,528 KB
testcase_31 AC 194 ms
19,408 KB
testcase_32 AC 179 ms
19,108 KB
testcase_33 AC 199 ms
21,032 KB
testcase_34 AC 162 ms
17,420 KB
testcase_35 AC 197 ms
19,668 KB
testcase_36 AC 160 ms
15,584 KB
testcase_37 AC 162 ms
22,288 KB
testcase_38 AC 151 ms
19,612 KB
testcase_39 AC 144 ms
19,400 KB
testcase_40 AC 144 ms
20,276 KB
testcase_41 AC 156 ms
21,428 KB
testcase_42 AC 157 ms
20,740 KB
testcase_43 AC 161 ms
15,576 KB
testcase_44 AC 173 ms
16,500 KB
testcase_45 AC 160 ms
21,628 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


void bAdd(T)(T[] bit, int pos, T val)
in {
  assert(0 <= pos && pos < bit.length, "bAdd: 0 <= pos < |bit| must hold");
}
do {
  for (int x = pos; x < bit.length; x |= x + 1) {
    bit[x] += val;
  }
}

// sum of [0, pos)
T bSum(T)(T[] bit, int pos)
in {
  assert(0 <= pos && pos <= bit.length, "bSum: 0 <= pos <= |bit| must hold");
}
do {
  T sum = 0;
  for (int x = pos - 1; x >= 0; x = (x & (x + 1)) - 1) {
    sum += bit[x];
  }
  return sum;
}


int N;
real[] L;
int T;
string[] S, P;

class Contestant {
  string name;
  int[] scores;
  int sum;
  int last;
}

void main() {
  try {
    for (; ; ) {
      N = readInt();
      L = new real[N];
      foreach (j; 0 .. N) {
        L[j] = readReal();
      }
      T = readInt();
      S = new string[T];
      P = new string[T];
      foreach (t; 0 .. T) {
        S[t] = readToken();
        P[t] = readToken();
      }
      
      int[string] ids;
      int m;
      foreach (t; 0 .. T) {
        if (S[t] !in ids) {
          ids[S[t]] = m++;
        }
      }
      debug {
        writeln("ids = ", ids);
      }
      
      Tuple!(int, int)[] ys;
      foreach (phase; 0 .. 2) {
        auto scores = new int[m];
        auto last = new int[m];
        auto cnt = new int[N];
        if (phase == 0) {
          ys ~= tuple(0, 0);
        }
        int[] bit;
        if (phase == 1) {
          bit = new int[ys.length];
        }
        foreach (t; 0 .. T) {
          const i = ids[S[t]];
          if (P[t] == "?") {
            if (phase == 1) {
              const ans = bit.bSum(ys.lowerBound(tuple(-scores[i], last[i])));
              writeln(ans + 1);
            }
          } else {
            const j = P[t][0] - 'A';
            if (phase == 1) {
              bit.bAdd(ys.lowerBound(tuple(-scores[i], last[i])), -1);
            }
            ++cnt[j];
            scores[i] += cast(int)(50 * L[j] + 5 * 50 * L[j] / (4 + cnt[j]));
            last[i] = t;
            if (phase == 0) {
              ys ~= tuple(-scores[i], last[i]);
            }
            if (phase == 1) {
              bit.bAdd(ys.lowerBound(tuple(-scores[i], last[i])), +1);
            }
          }
        }
        if (phase == 0) {
          ys = ys.sort.uniq.array;
          debug {
            writeln("ys = ", ys);
          }
        }
      }
    }
  } catch (EOFException e) {
  }
}
0