#748437 (Java21) No.1884 Sequence

• 問題: No.1884 Sequence
• ユーザー: watarimaycry2
• 提出日時: 2022-03-25 21:38:29
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 871 ms / 2,000 ms
• コード長: 4,772 bytes
• コンパイル時間: 3,095 ms
• コンパイル使用メモリ: 81,532 KB
• 実行使用メモリ: 90,944 KB
• 最終ジャッジ日時: 2024-10-14 05:33:37
• 合計ジャッジ時間: 22,675 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	50 ms; 37,176 KB
testcase_01	AC	53 ms; 37,424 KB
testcase_02	AC	51 ms; 37,000 KB
testcase_03	AC	50 ms; 37,328 KB
testcase_04	AC	51 ms; 37,280 KB
testcase_05	AC	50 ms; 37,236 KB
testcase_06	AC	50 ms; 37,312 KB
testcase_07	AC	52 ms; 37,400 KB
testcase_08	AC	51 ms; 37,460 KB
testcase_09	AC	51 ms; 37,420 KB
testcase_10	AC	831 ms; 88,768 KB
testcase_11	AC	871 ms; 89,572 KB
testcase_12	AC	244 ms; 54,188 KB
testcase_13	AC	256 ms; 54,128 KB
testcase_14	AC	238 ms; 53,548 KB
testcase_15	AC	621 ms; 69,384 KB
testcase_16	AC	859 ms; 89,388 KB
testcase_17	AC	406 ms; 66,356 KB
testcase_18	AC	532 ms; 75,212 KB
testcase_19	AC	486 ms; 69,044 KB
testcase_20	AC	596 ms; 70,116 KB
testcase_21	AC	435 ms; 68,416 KB
testcase_22	AC	655 ms; 72,476 KB
testcase_23	AC	855 ms; 90,760 KB
testcase_24	AC	848 ms; 90,944 KB
testcase_25	AC	861 ms; 90,600 KB
testcase_26	AC	834 ms; 90,664 KB
testcase_27	AC	282 ms; 59,164 KB
testcase_28	AC	267 ms; 59,332 KB
testcase_29	AC	268 ms; 59,340 KB
testcase_30	AC	286 ms; 61,308 KB
testcase_31	AC	465 ms; 69,228 KB
testcase_32	AC	571 ms; 89,260 KB
testcase_33	AC	419 ms; 80,252 KB
testcase_34	AC	414 ms; 80,152 KB
testcase_35	AC	330 ms; 60,752 KB
testcase_36	AC	418 ms; 75,284 KB
testcase_37	AC	437 ms; 78,492 KB
testcase_38	AC	435 ms; 81,668 KB
testcase_39	AC	345 ms; 64,524 KB
testcase_40	AC	365 ms; 66,228 KB
testcase_41	AC	842 ms; 87,732 KB
testcase_42	AC	852 ms; 87,408 KB

ソースコード

import java.util.*; import java.io.*; import java.math.*;
public class Main{
	//見なくていいよ　ここから------------------------------------------
	static class InputIterator{
		ArrayList<String> inputLine = new ArrayList<>(1024);
		int index = 0; int max; String read;
		InputIterator(){
			BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
			try{
				while((read = br.readLine()) != null){
					inputLine.addAll(Arrays.asList(read.split(" ")));
				}
			}catch(IOException e){}
			max = inputLine.size();
		}
		boolean hasNext(){return (index < max);}
		String next(){
			if(hasNext()){
				return inputLine.get(index++);
			}else{
				throw new IndexOutOfBoundsException("There is no more input");
			}
		}
	}
	static HashMap<Integer, String> CONVSTR = new HashMap<>();
	static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem.
	static PrintWriter out = new PrintWriter(System.out);
	static void flush(){out.flush();}
	static void myout(Object t){out.println(t);}
	static void myerr(Object t){System.err.print("debug:");System.err.println(t);}
	static String next(){return ii.next();}
	static boolean hasNext(){return ii.hasNext();}
	static int nextInt(){return Integer.parseInt(next());}
	static long nextLong(){return Long.parseLong(next());}
	static double nextDouble(){return Double.parseDouble(next());}
	static ArrayList<String> nextCharArray(){return myconv(next(), 0);}
	static ArrayList<String> nextStrArray(int size){
		ArrayList<String> ret = new ArrayList<>(size);
		for(int i = 0; i < size; i++){
			ret.add(next());
		}
		return ret;
	}
	static ArrayList<Integer> nextIntArray(int size){
		ArrayList<Integer> ret = new ArrayList<>(size);
		for(int i = 0; i < size; i++){
			ret.add(Integer.parseInt(next()));
		}
		return ret;
	}
	static ArrayList<Long> nextLongArray(int size){
		ArrayList<Long> ret = new ArrayList<>(size);
		for(int i = 0; i < size; i++){
			ret.add(Long.parseLong(next()));
		}
		return ret;
	}
	@SuppressWarnings("unchecked")
	static String myconv(Object list, int no){//only join
		StringBuilder sb = new StringBuilder("");
		String joinString = CONVSTR.get(no);
		if(list instanceof String[]){
			return String.join(joinString, (String[])list);
		}else if(list instanceof long[]){
			long[] tmp = (long[])list;
			if(tmp.length == 0){
				return "";
			}
			sb.append(String.valueOf(tmp[0]));
			for(int i = 1; i < tmp.length; i++){
				sb.append(joinString).append(String.valueOf(tmp[i]));
			}
			return sb.toString();
		}else if(list instanceof int[]){
			int[] tmp = (int[])list;
			if(tmp.length == 0){
				return "";
			}
			sb.append(String.valueOf(tmp[0]));
			for(int i = 1; i < tmp.length; i++){
				sb.append(joinString).append(String.valueOf(tmp[i]));
			}
			return sb.toString();
		}else if(list instanceof ArrayList){
			ArrayList tmp = (ArrayList)list;
			if(tmp.size() == 0){
				return "";
			}
			sb.append(tmp.get(0));
			for(int i = 1; i < tmp.size(); i++){
				sb.append(joinString).append(tmp.get(i));
			}
			return sb.toString();
		}else{
			throw new ClassCastException("Don't join");
		}
	}
	static ArrayList<String> myconv(String str, int no){//only split
		String splitString = CONVSTR.get(no);
		return new ArrayList<String>(Arrays.asList(str.split(splitString)));
	}
	static ArrayList<String> myconv(String str, String no){
		return new ArrayList<String>(Arrays.asList(str.split(no)));
	}
	public static void main(String[] args){
		CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, "");
		solve();flush();
	}
	//見なくていいよ　ここまで------------------------------------------
	//このコードをコンパイルするときは、「-encoding UTF-8」を指定すること
	static void solve(){//ここがメイン関数
		int N = nextInt();
		ArrayList<Long> list = nextLongArray(N);
		long zero = 0;
		ArrayList<Long> newlist = new ArrayList<>();
		HashSet<Long> set = new HashSet<>();
		boolean isDiffZero = false;
		for(long A : list){
			if(A == 0){
				zero++;
			}else{
				newlist.add(A);
				if(set.contains(A)){
					isDiffZero = true;
				}
				set.add(A);
			}
		}
		if(set.size() <= 1){
			myout("Yes");
			return;
		}else if(isDiffZero){
			myout("No");
			return;
		}
		Collections.sort(newlist);
		long g = newlist.get(1) - newlist.get(0);
		for(int i = 0; i < newlist.size() - 1; i++){
			g = gcd(g, newlist.get(i + 1) - newlist.get(i));
		}
		
		for(int i = 0; i < newlist.size() - 1; i++){
			zero -= (newlist.get(i + 1) - newlist.get(i) - 1) / g;
		}
		if(zero >= 0){
			myout("Yes");
		}else{
			myout("No");
		}
	}
	//メソッド追加エリア　ここから

static long gcd(long m, long n) {return n != 0 ? gcd(n, m % n) : m;}

	//メソッド追加エリア　ここまで
}