結果

問題 No.190 Dry Wet Moist
ユーザー uwiuwi
提出日時 2015-04-22 00:48:21
言語 Java11
(openjdk 11.0.7)
結果
AC  
実行時間 177 ms / 2,000 ms
コード長 4,093 Byte
コンパイル時間 3,934 ms
使用メモリ 27,724 KB
最終ジャッジ日時 2020-06-26 22:49:20

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 117 ms
24,120 KB
testcase_01 AC 119 ms
24,428 KB
testcase_02 AC 123 ms
25,216 KB
testcase_03 AC 124 ms
24,440 KB
testcase_04 AC 120 ms
24,432 KB
testcase_05 AC 125 ms
24,440 KB
testcase_06 AC 113 ms
24,092 KB
testcase_07 AC 133 ms
25,180 KB
testcase_08 AC 127 ms
24,452 KB
testcase_09 AC 117 ms
24,092 KB
testcase_10 AC 123 ms
24,132 KB
testcase_11 AC 119 ms
24,116 KB
testcase_12 AC 175 ms
26,136 KB
testcase_13 AC 167 ms
26,364 KB
testcase_14 AC 168 ms
26,076 KB
testcase_15 AC 173 ms
26,424 KB
testcase_16 AC 169 ms
27,652 KB
testcase_17 AC 153 ms
25,452 KB
testcase_18 AC 177 ms
25,964 KB
testcase_19 AC 174 ms
27,596 KB
testcase_20 AC 167 ms
26,264 KB
testcase_21 AC 142 ms
25,288 KB
testcase_22 AC 174 ms
27,708 KB
testcase_23 AC 177 ms
27,724 KB
testcase_24 AC 176 ms
27,720 KB
testcase_25 AC 132 ms
25,156 KB
testcase_26 AC 122 ms
24,116 KB
testcase_27 AC 168 ms
26,248 KB
testcase_28 AC 161 ms
25,684 KB
testcase_29 AC 159 ms
25,796 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
package contest;

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

public class Q499 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni()*2;
		int[] a = na(n);
		for(int i = 0;i < n;i++){
			a[i] += 100000;
		}
		a = radixSort(a);
		for(int i = 0;i < n;i++){
			a[i] -= 100000;
		}
		
		{
			int p = n-1;
			int ct = 0;
			for(int i = 0;i < n;i++){
				while(i < p && a[i] + a[p] >= 0){
					p--;
				}
				if(i >= p)break;
				p--;
				ct++;
			}
			out.print(ct + " ");
		}
		{
			int p = 0;
			int ct = 0;
			for(int i = n-1;i >= 0;i--){
				while(p < i && a[i] + a[p] <= 0){
					p++;
				}
				if(p >= i)break;
				p++;
				ct++;
			}
			out.print(ct + " ");
		}
		{
			int[] f = new int[200001];
			for(int v : a)f[v+100000]++;
			int ret = 0;
			for(int i = 0, j = 200000;i < j;i++,j--){
				ret += Math.min(f[i], f[j]);
			}
			ret += f[100000]/2;
			out.println(ret);
		}
	}
	
	public static int[] radixSort(int[] f)
	{
		int[] to = new int[f.length];
		{
			int[] b = new int[65537];
			for(int i = 0;i < f.length;i++)b[1+(f[i]&0xffff)]++;
			for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];
			for(int i = 0;i < f.length;i++)to[b[f[i]&0xffff]++] = f[i];
			int[] d = f; f = to;to = d;
		}
		{
			int[] b = new int[65537];
			for(int i = 0;i < f.length;i++)b[1+(f[i]>>>16)]++;
			for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];
			for(int i = 0;i < f.length;i++)to[b[f[i]>>>16]++] = f[i];
			int[] d = f; f = to;to = d;
		}
		return f;
	}

	
	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");
	}
	
	public static void main(String[] args) throws Exception { new Q499().run(); }
	
	private byte[] inbuf = new byte[1024];
	private 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 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[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, 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 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