結果

問題 No.956 Number of Unbalanced
ユーザー uwiuwi
提出日時 2019-12-19 02:22:37
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,445 ms / 2,000 ms
コード長 7,328 bytes
コンパイル時間 4,663 ms
コンパイル使用メモリ 83,160 KB
実行使用メモリ 81,060 KB
最終ジャッジ日時 2024-07-06 23:20:33
合計ジャッジ時間 22,722 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
52,576 KB
testcase_01 AC 52 ms
52,432 KB
testcase_02 AC 55 ms
52,608 KB
testcase_03 AC 55 ms
52,188 KB
testcase_04 AC 56 ms
52,600 KB
testcase_05 AC 54 ms
52,252 KB
testcase_06 AC 633 ms
68,516 KB
testcase_07 AC 403 ms
62,232 KB
testcase_08 AC 723 ms
68,552 KB
testcase_09 AC 666 ms
70,508 KB
testcase_10 AC 549 ms
65,344 KB
testcase_11 AC 554 ms
63,472 KB
testcase_12 AC 702 ms
68,580 KB
testcase_13 AC 786 ms
75,060 KB
testcase_14 AC 404 ms
62,924 KB
testcase_15 AC 1,445 ms
81,060 KB
testcase_16 AC 455 ms
63,992 KB
testcase_17 AC 721 ms
70,736 KB
testcase_18 AC 463 ms
65,912 KB
testcase_19 AC 1,100 ms
75,052 KB
testcase_20 AC 306 ms
62,960 KB
testcase_21 AC 1,047 ms
72,976 KB
testcase_22 AC 990 ms
75,364 KB
testcase_23 AC 389 ms
63,008 KB
testcase_24 AC 1,199 ms
79,476 KB
testcase_25 AC 459 ms
64,020 KB
testcase_26 AC 768 ms
69,772 KB
testcase_27 AC 501 ms
64,300 KB
testcase_28 AC 533 ms
64,060 KB
testcase_29 AC 444 ms
64,500 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package adv2019;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;

public class D19 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		// (v,k),(w,l)
		// (v,k-l)
		int n = ni();
		a = na(n);
		b = makeBuckets(a, 100000);
		dfs(0, n);
		out.println(ans);
	}
	
	int[] a;
	int[][] b;
	
	public static int[][] makeBuckets(int[] a, int sup)
	{
		int n = a.length;
		int[][] bucket = new int[sup+1][];
		int[] bp = new int[sup+1];
		for(int i = 0;i < n;i++)bp[a[i]]++;
		for(int i = 0;i <= sup;i++)bucket[i] = new int[bp[i]];
		for(int i = n-1;i >= 0;i--)bucket[a[i]][--bp[a[i]]] = i;
		return bucket;
	}

	
	long ans;
	
	void dfs(int l, int r)
	{
		if(r-l == 1) {
			ans++;
			return;
		}
		if(r-l <= 0) {
			return;
		}
		int h = l+r>>1;
		
//		int[] L = new int[h-l];
//		for(int i = 0;i < h-l;i++)L[i] = a[h-1-i];
//		int[] R = new int[r-h];
//		for(int i = 0;i < r-h;i++)R[i] = a[i+h];
		
		int[][] cansl = null;
		int[][] cansr = null;
		{
			int s = 0;
			int arg = 0;
			int[][] cans = new int[h-l][];
			int[] allcan = new int[h-l];
			int p = 0;
			for(int i = h-1;i >= l;i--) {
				if(a[i] == arg) {
					s++;
				}else {
					if(--s < 0) {
						s = 1;
						arg = a[i];
					}
				}
				// そいつが本当に過半数か
				int fa = lowerBound(b[arg], h) - lowerBound(b[arg], i);
				if(fa * 2 > h-i) {
					allcan[p] = arg;
					cans[p++] = new int[] {i, arg, fa-(h-i-fa)};
				}
			}
			cans = Arrays.copyOf(cans, p);
			Arrays.sort(cans, new Comparator<int[]>() {
				public int compare(int[] a, int[] b) {
					return a[1] - b[1];
				}
			});
			cansl = cans;
			for(int i = 0;i < p;) {
				int j = i;
				while(j < p && cans[j][1] == cans[i][1])j++;
				
				int[] lfs = new int[j-i];
				for(int k = i;k < j;k++) {
					lfs[k-i] = cans[k][2];
				}
				Arrays.sort(lfs); // リードしているカウントたち
				
				int ok = j-i;
				int ud = 0;
				for(int k = h;k < r;k++) {
					if(a[k] == cans[i][1]) {
						ud++;
						int lb = lowerBound(lfs, -ud+2) - lowerBound(lfs, -ud+1);
						ok += lb;
					}else {
						int lb = lowerBound(lfs, -ud+2) - lowerBound(lfs, -ud+1);
						ok -= lb;
						ud--;
					}
					ans += ok;
				}
				
				i = j;
			}
		}
		
		{
			int s = 0;
			int arg = 0;
			int[][] cans = new int[r-h][];
			int[] allcan = new int[r-h];
			int p = 0;
			for(int i = h;i < r;i++) {
				if(a[i] == arg) {
					s++;
				}else {
					if(--s < 0) {
						s = 1;
						arg = a[i];
					}
				}
				// そいつが本当に過半数か
				int fa = lowerBound(b[arg], i+1) - lowerBound(b[arg], h);
				if(fa * 2 > i-h+1) {
					allcan[p] = arg;
					cans[p++] = new int[] {i, arg, fa-(i-h+1-fa)};
				}
			}
			cans = Arrays.copyOf(cans, p);
			Arrays.sort(cans, new Comparator<int[]>() {
				public int compare(int[] a, int[] b) {
					return a[1] - b[1];
				}
			});
			cansr = cans;
			for(int i = 0;i < p;) {
				int j = i;
				while(j < p && cans[j][1] == cans[i][1])j++;
				
				int[] lfs = new int[j-i];
				for(int k = i;k < j;k++) {
					lfs[k-i] = cans[k][2];
				}
				Arrays.sort(lfs); // リードしているカウントたち
				
				int ok = j-i;
				int ud = 0;
				for(int k = h-1;k >= l;k--) {
					if(a[k] == cans[i][1]) {
						ud++;
						int lb = lowerBound(lfs, -ud+2) - lowerBound(lfs, -ud+1);
						ok += lb;
					}else {
						int lb = lowerBound(lfs, -ud+2) - lowerBound(lfs, -ud+1);
						ok -= lb;
						ud--;
					}
					ans += ok;
				}
				
				i = j;
			}
		}
//		tr(ans);
		
//		tr(cansl, cansr);
		int q = 0;
		for(int i = 0;i < cansl.length;){
			int j = i;
			while(j < cansl.length && cansl[i][1] == cansl[j][1])j++;
			while(q < cansr.length && cansr[q][1] < cansl[i][1])q++;
			int oq = q;
			while(q < cansr.length && cansr[q][1] == cansl[i][1])q++;
			ans -= (long)(j-i) * (q-oq); // うそくさい
			
			i = j;
		}
//		tr(ans);
		
		dfs(l, h);
		dfs(h, r);
	}
	
	public static int[] uniq(int[] a)
	{
		int n = a.length;
		int p = 0;
		for(int i = 0;i < n;i++) {
			if(i == 0 || a[i] != a[i-1])a[p++] = a[i];
		}
		return Arrays.copyOf(a, p);
	}

	
	public static int lowerBound(int[] a, int v){ return lowerBound(a, 0, a.length, v); }
	public static int lowerBound(int[] a, int l, int r, int v)
	{
		if(l > r || l < 0 || r > a.length)throw new IllegalArgumentException();
		int low = l-1, high = r;
		while(high-low > 1){
			int h = high+low>>>1;
			if(a[h] >= v){
				high = h;
			}else{
				low = h;
			}
		}
		return high;
	}

	
	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 D19().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