結果

問題 No.349 干支の置き物
ユーザー uwi
提出日時 2016-03-11 22:23:49
言語 Java8
(openjdk 1.8.0.222)
結果
AC  
実行時間 91 ms
コード長 3,178 Byte
コンパイル時間 2,882 ms
使用メモリ 19,252 KB
最終ジャッジ日時 2019-10-09 17:15:56

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
challlenge1.txt AC 85 ms
19,244 KB
sample1.txt AC 85 ms
19,244 KB
sample2.txt AC 84 ms
19,244 KB
sample3.txt AC 89 ms
19,248 KB
system_test1.txt AC 86 ms
19,248 KB
system_test2.txt AC 85 ms
19,244 KB
system_test3.txt AC 87 ms
19,248 KB
system_test4.txt AC 85 ms
19,248 KB
system_test5.txt AC 84 ms
19,244 KB
system_test6.txt AC 84 ms
19,248 KB
system_test7.txt AC 84 ms
19,248 KB
system_test8.txt AC 85 ms
19,244 KB
system_test9.txt AC 91 ms
19,252 KB
system_test10.txt AC 84 ms
19,248 KB
system_test11.txt AC 84 ms
19,248 KB
system_test12.txt AC 84 ms
19,248 KB
system_test13.txt AC 87 ms
19,248 KB
system_test14.txt AC 83 ms
19,240 KB
system_test15.txt AC 85 ms
19,244 KB
system_test16.txt AC 84 ms
19,244 KB
test1.txt AC 87 ms
19,240 KB
test2.txt AC 86 ms
19,244 KB
test3.txt AC 86 ms
19,244 KB
test4.txt AC 86 ms
19,244 KB
test5.txt AC 86 ms
19,240 KB
test6.txt AC 86 ms
19,240 KB
test7.txt AC 83 ms
19,244 KB
test8.txt AC 87 ms
19,248 KB
test9.txt AC 84 ms
19,252 KB
test10.txt AC 85 ms
19,248 KB
test11.txt AC 88 ms
19,252 KB
test12.txt AC 87 ms
19,248 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.HashMap;
import java.util.InputMismatchException;
import java.util.Map;

public class Q924 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		Map<String, Integer> map = new HashMap<>();
		for(int i = 0;i < n;i++){
			String x = ns();
			if(!map.containsKey(x)){
				map.put(x, 1);
			}else{
				map.put(x, map.get(x)+1);
			}
		}
		int max = 0;
		for(int v : map.values())max = Math.max(max, v);
		if(max*2 <= n+1){
			out.println("YES");
		}else{
			out.println("NO");
		}
	}
	
	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 Q924().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