結果

問題 No.449 ゆきこーだーの雨と雪 (4)
ユーザー uwi
提出日時 2016-11-19 04:12:20
言語 Java
(openjdk 23)
結果
AC  
実行時間 532 ms / 5,000 ms
コード長 11,600 bytes
コンパイル時間 6,583 ms
コンパイル使用メモリ 98,144 KB
実行使用メモリ 83,468 KB
最終ジャッジ日時 2024-09-22 10:23:33
合計ジャッジ時間 22,455 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 43
権限があれば一括ダウンロードができます

ソースコード

diff # 

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 E2 {
	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 = NIL;
		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 XorShift();
	
	public static final Node NIL;
	static {
		NIL = new Node();
		NIL.priority = -1L;
		NIL.left = NIL.right = NIL.parent = NIL;
		NIL.count = 0;
	}
	
	static public class Node
	{
		public Datum d;
		public long v; // value
		public long priority;
		public Node left, right, parent;
		
		public int count;
		
		private Node(){}; // for NIL
		
		public Node(long v)
		{
			this.v = v;
			this.left = this.right = this.parent = NIL;
			priority = gen.nextLong();
			update(this);
		}

		@Override
		public String toString() {
			if(count == 0){
				return "NIL";
			}else{
				StringBuilder builder = new StringBuilder();
				builder.append("Node [v=");
				builder.append(v);
				builder.append(", count=");
				builder.append(count);
				builder.append(", parent=");
				builder.append(parent != NIL ? parent.v : "NIL");
				builder.append("]");
				return builder.toString();
			}
		}
	}

	public static Node update(Node a)
	{
		if(a == NIL)return NIL;
		a.count = 1 + a.left.count + a.right.count;
		
		// TODO
		return a;
	}
	
	public static void propagate(Node x)
	{
		for(;x != NIL;x = x.parent)update(x);
	}
	
	public static Node disconnect(Node a)
	{
		if(a == NIL)return NIL;
		a.left = a.right = a.parent = NIL;
		return update(a);
	}
	
	public static Node root(Node x)
	{
		while(x.parent != NIL)x = x.parent;
		return x;
	}
	
	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 == NIL)return a;
		if(a == NIL)return b;
		if(a.priority > b.priority){
			a.right.parent = NIL;
			b.parent = NIL;
			a.right = merge(a.right, b);
			a.right.parent = a;
			return update(a);
		}else{
			a.parent = NIL;
			b.left.parent = NIL;
			b.left = merge(a, b.left);
			b.left.parent = b;
			return update(b);
		}
	}
	
	public static Node[] split(Node x)
	{
		if(x == NIL)return new Node[]{NIL, NIL};
		x.left.parent = NIL;
		Node[] sp = new Node[]{x.left, x};
		x.left = NIL;
		update(x);
		while(x.parent != NIL){
			Node p = x.parent;
			x.parent = NIL;
			if(x == p.left){
				p.left = sp[1];
				sp[1].parent = p;
				sp[1] = p;
			}else{
				p.right = sp[0];
				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 == NIL)return new Node[]{NIL, NIL};
		if(K <= a.left.count){
			a.left.parent = NIL;
			Node[] s = split(a.left, K);
			a.left = s[1];
			a.left.parent = a;
			s[1] = update(a);
			return s;
		}else{
			a.right.parent = NIL;
			Node[] s = split(a.right, K-a.left.count-1);
			a.right = s[0];
			a.right.parent = 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 == NIL)return b;
		if(b.priority < a.priority){
			if(K <= a.left.count){
				a.left = insert(a.left, K, b);
				a.left.parent = a;
			}else{
				a.right = insert(a.right, K-a.left.count-1, b);
				a.right.parent = a;
			}
			return update(a);
		}else{
			Node[] ch = split(a, K);
			b.left = ch[0]; b.right = ch[1];
			b.left.parent = b;
			b.right.parent = b;
			return update(b);
		}
	}
	
	// delete K-th
	public static Node erase(Node a, int K)
	{
		if(a == NIL)return NIL;
		if(K < a.left.count){
			a.left = erase(a.left, K);
			a.left.parent = a;
			return update(a);
		}else if(K == a.left.count){
			a.left.parent = a.right.parent = NIL;
			Node aa = merge(a.left, a.right);
			disconnect(a);
			return aa;
		}else{
			a.right = erase(a.right, K-a.left.count-1);
			a.right.parent = a;
			return update(a);
		}
	}
	
	public static Node get(Node a, int K)
	{
		while(a != NIL){
			if(K < a.left.count){
				a = a.left;
			}else if(K == a.left.count){
				break;
			}else{
				K = K - a.left.count-1;
				a = a.right;
			}
		}
		return a;
	}
	
	public static int index(Node a)
	{
		if(a == NIL)return -1;
		int ind = a.left.count;
		while(a != NIL){
			Node par = a.parent;
			if(par != NIL && par.right == a){
				ind += par.left.count + 1;
			}
			a = par;
		}
		return ind;
	}
	
	public static Node mergeTechnically(Node x, Node y)
	{
		if(x.count > y.count){
			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 != NIL){
			if(a.v >= q){
				a = a.left;
			}else{
				lcount += a.left.count + 1;
				a = a.right;
			}
		}
		return lcount;
	}
	
	public static int search(Node a, long q)
	{
		int lcount = 0;
		while(a != NIL){
			if(a.v == q){
				lcount += a.left.count;
				break;
			}
			if(q < a.v){
				a = a.left;
			}else{
				lcount += a.left.count + 1;
				a = a.right;
			}
		}
		return a == NIL ? -(lcount+1) : lcount;
	}
	
	public static Node next(Node x)
	{
		if(x == NIL)return NIL;
		if(x.right != NIL){
			x = x.right;
			while(x.left != NIL)x = x.left;
			return x;
		}else{
			while(true){
				Node p = x.parent;
				if(p == NIL)return NIL;
				if(p.left == x)return p;
				x = p;
			}
		}
	}
	
	public static Node prev(Node x)
	{
		if(x == NIL)return NIL;
		if(x.left != NIL){
			x = x.left;
			while(x.right != NIL)x = x.right;
			return x;
		}else{
			while(true){
				Node p = x.parent;
				if(p == NIL)return NIL;
				if(p.right == x)return p;
				x = p;
			}
		}
	}
	
	public static Node[] nodes(Node a) { return nodes(a, new Node[a.count], 0, a.count); }
	public static Node[] nodes(Node a, Node[] ns, int L, int R)
	{
		if(a == NIL)return ns;
		nodes(a.left, ns, L, L+a.left.count);
		ns[L+a.left.count] = a;
		nodes(a.right, ns, R-a.right.count, 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 == NIL)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 == NIL)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();
	}
	
	public static class XorShift extends Random {
		private static final long serialVersionUID = 6806629989739663134L;
		private long x=123456789, y=362436069, z=521288629, w=88675123;
		public XorShift() {super(); x = System.nanoTime();}
		public XorShift(long seed) {super(seed); x = seed;}
		public synchronized void setSeed(long seed) {super.setSeed(seed); x = seed;}
		protected int next(int bits){
			long t=(x^x<<11)&(1L<<32)-1; x=y; y=z; z=w; w=(w^w>>>19^t^t>>>8)&(1L<<32)-1;
			return (int)w>>>32-bits;
		}
	}
	
	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 E2().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)); }
}
0