結果

問題 No.1053 ゲーミング棒
ユーザー uwiuwi
提出日時 2020-05-15 21:23:07
言語 Java21
(openjdk 21)
結果
AC  
実行時間 152 ms / 2,000 ms
コード長 3,633 bytes
コンパイル時間 4,465 ms
コンパイル使用メモリ 81,152 KB
実行使用メモリ 62,156 KB
最終ジャッジ日時 2023-10-19 13:05:23
合計ジャッジ時間 7,825 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 51 ms
53,408 KB
testcase_01 AC 50 ms
53,416 KB
testcase_02 AC 50 ms
53,412 KB
testcase_03 AC 51 ms
53,412 KB
testcase_04 AC 52 ms
53,408 KB
testcase_05 AC 53 ms
53,416 KB
testcase_06 AC 52 ms
53,412 KB
testcase_07 AC 51 ms
53,408 KB
testcase_08 AC 53 ms
53,420 KB
testcase_09 AC 51 ms
53,416 KB
testcase_10 AC 52 ms
53,420 KB
testcase_11 AC 52 ms
52,372 KB
testcase_12 AC 50 ms
52,356 KB
testcase_13 AC 52 ms
53,420 KB
testcase_14 AC 51 ms
53,412 KB
testcase_15 AC 50 ms
53,360 KB
testcase_16 AC 50 ms
52,360 KB
testcase_17 AC 50 ms
53,412 KB
testcase_18 AC 51 ms
53,416 KB
testcase_19 AC 51 ms
53,408 KB
testcase_20 AC 53 ms
53,420 KB
testcase_21 AC 52 ms
53,428 KB
testcase_22 AC 50 ms
53,408 KB
testcase_23 AC 131 ms
62,104 KB
testcase_24 AC 148 ms
62,068 KB
testcase_25 AC 152 ms
62,156 KB
testcase_26 AC 151 ms
62,080 KB
testcase_27 AC 51 ms
53,424 KB
testcase_28 AC 52 ms
53,416 KB
testcase_29 AC 51 ms
53,424 KB
testcase_30 AC 78 ms
54,328 KB
testcase_31 AC 73 ms
54,808 KB
testcase_32 AC 78 ms
54,276 KB
testcase_33 AC 80 ms
54,788 KB
testcase_34 AC 82 ms
54,748 KB
testcase_35 AC 86 ms
54,668 KB
testcase_36 AC 89 ms
54,868 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest200515;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;
import java.util.InputMismatchException;
import java.util.Set;

public class B {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		int[][] uc = uniqcount(a);
		Set<Integer> set = new HashSet<>();
		for(int[] u : uc){
			set.add(u[0]);
		}
		if(set.size() == uc.length){
			out.println(0);
		}else if(set.size() == uc.length-1 && uc[0][0] == uc[uc.length-1][0]){
			out.println(1);
		}else{
			out.println(-1);
		}
	}
	
	public static int[][] uniqcount(int[] a)
	{
		int n = a.length;
		int p = 0;
		int[][] b = new int[n][];
		for(int i = 0;i < n;i++){
			if(i == 0 || a[i] != a[i-1])b[p++] = new int[]{a[i], 0};
			b[p-1][1]++;
		}
		return Arrays.copyOf(b, p);
	}

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