結果

問題 No.182 新規性の虜
ユーザー uwiuwi
提出日時 2015-04-16 23:27:38
言語 Java21
(openjdk 21)
結果
AC  
実行時間 94 ms / 5,000 ms
コード長 3,602 bytes
コンパイル時間 4,489 ms
コンパイル使用メモリ 85,652 KB
実行使用メモリ 52,052 KB
最終ジャッジ日時 2023-08-27 07:06:15
合計ジャッジ時間 7,852 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 47 ms
49,164 KB
testcase_01 AC 46 ms
49,024 KB
testcase_02 AC 47 ms
49,020 KB
testcase_03 AC 48 ms
49,296 KB
testcase_04 AC 47 ms
49,136 KB
testcase_05 AC 49 ms
49,104 KB
testcase_06 AC 47 ms
49,004 KB
testcase_07 AC 47 ms
49,044 KB
testcase_08 AC 90 ms
51,124 KB
testcase_09 AC 89 ms
52,052 KB
testcase_10 AC 85 ms
52,024 KB
testcase_11 AC 94 ms
51,992 KB
testcase_12 AC 81 ms
51,528 KB
testcase_13 AC 47 ms
49,092 KB
testcase_14 AC 49 ms
49,284 KB
testcase_15 AC 48 ms
49,272 KB
testcase_16 AC 48 ms
49,080 KB
testcase_17 AC 47 ms
49,224 KB
testcase_18 AC 79 ms
51,660 KB
testcase_19 AC 83 ms
52,048 KB
testcase_20 AC 75 ms
51,392 KB
testcase_21 AC 80 ms
51,740 KB
testcase_22 AC 79 ms
51,856 KB
testcase_23 AC 47 ms
49,088 KB
testcase_24 AC 94 ms
51,744 KB
testcase_25 AC 86 ms
51,764 KB
testcase_26 AC 60 ms
51,248 KB
testcase_27 AC 46 ms
49,304 KB
evil01.txt AC 99 ms
49,928 KB
evil02.txt AC 99 ms
51,884 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 Q485 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		a = radixSort(a);
		
		int ct = 0;
		int ret = 0;
		for(int i = 0;i < n;i++){
			if(i == 0 || a[i] != a[i-1]){
				if(ct == 1){
					ret++;
				}
				ct = 1;
			}else{
				ct++;
			}
		}
		if(ct == 1)ret++;
		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 Q485().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