結果
問題 | No.449 ゆきこーだーの雨と雪 (4) |
ユーザー | uwi |
提出日時 | 2016-11-18 22:57:08 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 627 ms / 5,000 ms |
コード長 | 10,936 bytes |
コンパイル時間 | 6,262 ms |
コンパイル使用メモリ | 94,532 KB |
実行使用メモリ | 86,836 KB |
最終ジャッジ日時 | 2023-10-22 08:32:32 |
合計ジャッジ時間 | 26,374 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 57 ms
53,520 KB |
testcase_01 | AC | 57 ms
53,512 KB |
testcase_02 | AC | 57 ms
53,520 KB |
testcase_03 | AC | 97 ms
54,164 KB |
testcase_04 | AC | 93 ms
54,376 KB |
testcase_05 | AC | 86 ms
54,428 KB |
testcase_06 | AC | 81 ms
54,116 KB |
testcase_07 | AC | 93 ms
54,160 KB |
testcase_08 | AC | 91 ms
54,700 KB |
testcase_09 | AC | 95 ms
54,368 KB |
testcase_10 | AC | 89 ms
54,152 KB |
testcase_11 | AC | 92 ms
54,148 KB |
testcase_12 | AC | 408 ms
61,608 KB |
testcase_13 | AC | 600 ms
71,732 KB |
testcase_14 | AC | 543 ms
70,864 KB |
testcase_15 | AC | 566 ms
71,256 KB |
testcase_16 | AC | 575 ms
71,868 KB |
testcase_17 | AC | 576 ms
68,836 KB |
testcase_18 | AC | 403 ms
61,488 KB |
testcase_19 | AC | 562 ms
74,108 KB |
testcase_20 | AC | 535 ms
70,964 KB |
testcase_21 | AC | 614 ms
71,860 KB |
testcase_22 | AC | 627 ms
71,360 KB |
testcase_23 | AC | 404 ms
61,848 KB |
testcase_24 | AC | 567 ms
71,812 KB |
testcase_25 | AC | 381 ms
59,400 KB |
testcase_26 | AC | 354 ms
59,684 KB |
testcase_27 | AC | 585 ms
71,476 KB |
testcase_28 | AC | 586 ms
68,628 KB |
testcase_29 | AC | 544 ms
73,788 KB |
testcase_30 | AC | 547 ms
71,228 KB |
testcase_31 | AC | 607 ms
71,992 KB |
testcase_32 | AC | 543 ms
74,208 KB |
testcase_33 | AC | 562 ms
71,836 KB |
testcase_34 | AC | 382 ms
62,064 KB |
testcase_35 | AC | 591 ms
71,444 KB |
testcase_36 | AC | 385 ms
62,120 KB |
testcase_37 | AC | 499 ms
84,800 KB |
testcase_38 | AC | 481 ms
75,788 KB |
testcase_39 | AC | 445 ms
75,736 KB |
testcase_40 | AC | 446 ms
75,512 KB |
testcase_41 | AC | 440 ms
74,756 KB |
testcase_42 | AC | 435 ms
74,532 KB |
testcase_43 | AC | 291 ms
58,780 KB |
testcase_44 | AC | 286 ms
59,324 KB |
testcase_45 | AC | 387 ms
86,836 KB |
ソースコード
package contest161118; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.HashMap; import java.util.InputMismatchException; import java.util.Map; import java.util.Random; public class E { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(); int[] stars = na(n); int T = ni(); int[] rank = new int[n]; Arrays.fill(rank, 1); Map<String, Node> map = new HashMap<>(); Node root = null; for(int i = 0;i < T;i++){ String name = ns(); char pr = nc(); if(pr != '?'){ if(!map.containsKey(name)){ Datum d = new Datum(name, new int[n], 0); Node node = new Node(0); node.d = d; map.put(name, node); root = insertb(root, node); } int ls = score(stars[pr-'A'], rank[pr-'A']++); Node node = map.get(name); node.d.score[pr-'A'] = ls; node.d.sum += ls; node.d.last = i; root = erase(root, index(node)); node.v = (long)(10000000-node.d.sum)<<32|node.d.last; update(node); root = insertb(root, node); }else{ Node node = map.get(name); out.println(index(node)+1); } } } static class Datum { public String name; public int[] score; public int sum; public int last; public Datum(String name, int[] score, int sum) { this.name = name; this.score = score; this.sum = sum; } public void go() { sum = Arrays.stream(score).sum(); } } int score(int a, int b) { return 50*a+250*a/(4+b); } public static Random gen = new Random(); static public class Node { public long v; // value public long priority; public Node left, right, parent; public Datum d; public int count; public Node(long v) { this.v = v; priority = gen.nextLong(); update(this); } @Override public String toString() { StringBuilder builder = new StringBuilder(); builder.append("Node [v="); builder.append(v); builder.append(", count="); builder.append(count); builder.append(", parent="); builder.append(parent != null ? parent.v : "null"); builder.append("]"); return builder.toString(); } } public static Node update(Node a) { if(a == null)return null; a.count = 1; if(a.left != null)a.count += a.left.count; if(a.right != null)a.count += a.right.count; // TODO return a; } public static void propagate(Node x) { for(;x != null;x = x.parent)update(x); } public static Node disconnect(Node a) { if(a == null)return null; a.left = a.right = a.parent = null; return update(a); } public static Node root(Node x) { if(x == null)return null; while(x.parent != null)x = x.parent; return x; } public static int count(Node a) { return a == null ? 0 : a.count; } public static void setParent(Node a, Node par) { if(a != null)a.parent = par; } public static Node merge(Node a, Node b, Node... c) { Node x = merge(a, b); for(Node n : c)x = merge(x, n); return x; } public static Node merge(Node a, Node b) { if(b == null)return a; if(a == null)return b; if(a.priority > b.priority){ setParent(a.right, null); setParent(b, null); a.right = merge(a.right, b); setParent(a.right, a); return update(a); }else{ setParent(a, null); setParent(b.left, null); b.left = merge(a, b.left); setParent(b.left, b); return update(b); } } public static Node[] split(Node x) { if(x == null)return new Node[]{null, null}; if(x.left != null)x.left.parent = null; Node[] sp = new Node[]{x.left, x}; x.left = null; update(x); while(x.parent != null){ Node p = x.parent; x.parent = null; if(x == p.left){ p.left = sp[1]; if(sp[1] != null)sp[1].parent = p; sp[1] = p; }else{ p.right = sp[0]; if(sp[0] != null)sp[0].parent = p; sp[0] = p; } update(p); x = p; } return sp; } public static Node[] split(Node a, int... ks) { int n = ks.length; if(n == 0)return new Node[]{a}; for(int i = 0;i < n-1;i++){ if(ks[i] > ks[i+1])throw new IllegalArgumentException(Arrays.toString(ks)); } Node[] ns = new Node[n+1]; Node cur = a; for(int i = n-1;i >= 0;i--){ Node[] sp = split(cur, ks[i]); cur = sp[0]; ns[i] = sp[0]; ns[i+1] = sp[1]; } return ns; } // [0,K),[K,N) public static Node[] split(Node a, int K) { if(a == null)return new Node[]{null, null}; if(K <= count(a.left)){ setParent(a.left, null); Node[] s = split(a.left, K); a.left = s[1]; setParent(a.left, a); s[1] = update(a); return s; }else{ setParent(a.right, null); Node[] s = split(a.right, K-count(a.left)-1); a.right = s[0]; setParent(a.right, a); s[0] = update(a); return s; } } public static Node insertb(Node root, Node x) { int ind = lowerBound(root, x.v); return insert(root, ind, x); } public static Node insert(Node a, int K, Node b) { if(a == null)return b; if(b.priority < a.priority){ if(K <= count(a.left)){ a.left = insert(a.left, K, b); setParent(a.left, a); }else{ a.right = insert(a.right, K-count(a.left)-1, b); setParent(a.right, a); } return update(a); }else{ Node[] ch = split(a, K); b.left = ch[0]; b.right = ch[1]; setParent(b.left, b); setParent(b.right, b); return update(b); } } // delete K-th public static Node erase(Node a, int K) { if(a == null)return null; if(K < count(a.left)){ a.left = erase(a.left, K); setParent(a.left, a); return update(a); }else if(K == count(a.left)){ setParent(a.left, null); setParent(a.right, null); Node aa = merge(a.left, a.right); disconnect(a); return aa; }else{ a.right = erase(a.right, K-count(a.left)-1); setParent(a.right, a); return update(a); } } public static Node get(Node a, int K) { while(a != null){ if(K < count(a.left)){ a = a.left; }else if(K == count(a.left)){ break; }else{ K = K - count(a.left)-1; a = a.right; } } return a; } public static int index(Node a) { if(a == null)return -1; int ind = count(a.left); while(a != null){ Node par = a.parent; if(par != null && par.right == a){ ind += count(par.left) + 1; } a = par; } return ind; } public static Node mergeTechnically(Node x, Node y) { if(count(x) > count(y)){ Node d = x; x = y; y = d; } // |x|<=|y| for(Node cur : nodesdfs(x))y = insertb(y, disconnect(cur)); return y; } public static int lowerBound(Node a, long q) { int lcount = 0; while(a != null){ if(a.v >= q){ a = a.left; }else{ lcount += count(a.left) + 1; a = a.right; } } return lcount; } public static Node next(Node x) { if(x == null)return null; if(x.right != null){ x = x.right; while(x.left != null)x = x.left; return x; }else{ while(true){ Node p = x.parent; if(p == null)return null; if(p.left == x)return p; x = p; } } } public static Node prev(Node x) { if(x == null)return null; if(x.left != null){ x = x.left; while(x.right != null)x = x.right; return x; }else{ while(true){ Node p = x.parent; if(p == null)return null; if(p.right == x)return p; x = p; } } } public static Node[] nodes(Node a) { return nodes(a, new Node[count(a)], 0, count(a)); } public static Node[] nodes(Node a, Node[] ns, int L, int R) { if(a == null)return ns; nodes(a.left, ns, L, L+count(a.left)); ns[L+count(a.left)] = a; nodes(a.right, ns, R-count(a.right), R); return ns; } // faster than nodes but inconsistent public static Node[] nodesdfs(Node a) { return nodesdfs(a, new Node[a.count], new int[]{0}); } public static Node[] nodesdfs(Node a, Node[] ns, int[] pos) { if(a == null)return ns; ns[pos[0]++] = a; nodesdfs(a.left, ns, pos); nodesdfs(a.right, ns, pos); return ns; } public static String toString(Node a, String indent) { if(a == null)return ""; StringBuilder sb = new StringBuilder(); sb.append(toString(a.left, indent + " ")); sb.append(indent).append(a).append("\n"); sb.append(toString(a.right, indent + " ")); return sb.toString(); } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new E().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }