結果

問題 No.14 最小公倍数ソート
ユーザー ぴろずぴろず
提出日時 2015-02-15 13:02:59
言語 Java21
(openjdk 21)
結果
AC  
実行時間 554 ms / 5,000 ms
コード長 7,027 bytes
コンパイル時間 2,757 ms
コンパイル使用メモリ 80,184 KB
実行使用メモリ 67,192 KB
最終ジャッジ日時 2023-09-06 01:15:47
合計ジャッジ時間 11,098 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
49,964 KB
testcase_01 AC 48 ms
50,084 KB
testcase_02 AC 49 ms
50,304 KB
testcase_03 AC 143 ms
55,604 KB
testcase_04 AC 542 ms
66,992 KB
testcase_05 AC 307 ms
62,264 KB
testcase_06 AC 325 ms
62,160 KB
testcase_07 AC 354 ms
63,456 KB
testcase_08 AC 409 ms
61,172 KB
testcase_09 AC 490 ms
65,008 KB
testcase_10 AC 458 ms
64,960 KB
testcase_11 AC 547 ms
66,828 KB
testcase_12 AC 549 ms
66,860 KB
testcase_13 AC 536 ms
67,192 KB
testcase_14 AC 554 ms
67,132 KB
testcase_15 AC 551 ms
66,932 KB
testcase_16 AC 327 ms
62,436 KB
testcase_17 AC 273 ms
62,580 KB
testcase_18 AC 220 ms
56,764 KB
testcase_19 AC 354 ms
64,548 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no014b;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
import java.util.TreeSet;

public class Main {

	@SuppressWarnings("unchecked")
	public static void main(String[] args) {
		IO io = new IO();
		int n = io.nextInt();
		Pair<Integer,Integer>[] p = new Pair[n];
		for(int i=0;i<n;i++) {
			p[i] = new Pair<Integer,Integer>(i,io.nextInt());
		}
		ArrayList<Integer>[] divisor = new ArrayList[n];
		for(int i=0;i<n;i++) {
			divisor[i] = new ArrayList<>();
		}
		TreeSet<Pair<Integer,Integer>>[] hs = new TreeSet[10001];
		for(int i=1;i<=10000;i++) {
			hs[i] = new TreeSet<>(Pair.CompareB());
		}
		//約数の列挙
		for(int i=0;i<n;i++) {
			for(int j=1;j*j<=p[i].b;j++) {
				if (p[i].b % j == 0) {
					divisor[i].add(j);
					if (j * j != p[i].b) {
						divisor[i].add(p[i].b/j);
					}
				}
			}
			Collections.sort(divisor[i]);
		}
		//約数に対応するTreeSetに挿入
		for(int i=0;i<n;i++) {
			for(Integer d:divisor[i]) {
				hs[d].add(p[i]);
			}
		}
		//左端に注目して最小値を探す
		Pair<Integer,Integer> leftMost = p[0];
		int[] ans = new int[n];
		for(int i=0;i<n-1;i++) {
			ans[i] = leftMost.b;
			for(Integer d:divisor[leftMost.a]) {
				hs[d].remove(leftMost);
			}
			Pair<Integer,Integer> min = null;
			int minX = 1<<29;
			for(Integer d:divisor[leftMost.a]) {
				if (hs[d].isEmpty()) {
					continue;
				}
				Pair<Integer,Integer> f = hs[d].first();
				int x = leftMost.b * f.b / d;
				if (x < minX) {
					min = f;
					minX = x;
				}
			}
			leftMost = min;
		}
		ans[n-1] = leftMost.b;
		//出力
		for(int i=0;i<n;i++) {
			if (i > 0) {
				io.print(' ');
			}
			io.print(ans[i]);
		}
		io.println();
		io.flush();
	}

}

class Pair<A extends Comparable<A>,B extends Comparable<B>> implements Comparable<Pair<A,B>>{
	A a;
	B b;
	public Pair(A a,B b) {
		this.a = a;
		this.b = b;
	}
	public int compareTo(Pair<A, B> o) {
		int comp = a.compareTo(o.a);
		if (comp != 0) {
			return comp;
		}
		return b.compareTo(o.b);
	}
	public boolean equals(Object o) {
		if (o instanceof Pair) {
			@SuppressWarnings("rawtypes")
			Pair p = (Pair) o;
			return a.equals(p.a) && b.equals(p.b);
		}
		return super.equals(o);
	}
	public int hashCode() {
		return a.hashCode() * 10000 + b.hashCode();
	}
	public String toString() {
		return "[" + a + "," + b + "]";
	}
	public static <C extends Comparable<C>,D extends Comparable<D>> Comparator<Pair<C,D>> CompareA() {
		Comparator<Pair<C,D>> comp = new Comparator<Pair<C,D>>() {
			public int compare(Pair<C, D> o1, Pair<C, D> o2) {
				int comp = o1.a.compareTo(o2.a);
				if (comp != 0) {
					return comp;
				}
				return o1.b.compareTo(o2.b);
			}
		};
		return comp;
	};
	public static <C extends Comparable<C>,D extends Comparable<D>> Comparator<Pair<C,D>> CompareB() {
		Comparator<Pair<C,D>> comp = new Comparator<Pair<C,D>>() {
			public int compare(Pair<C, D> o1, Pair<C, D> o2) {
				int comp = o1.b.compareTo(o2.b);
				if (comp != 0) {
					return comp;
				}
				return o1.a.compareTo(o2.a);
			}
		};
		return comp;
	};
}

class IO extends PrintWriter {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	public IO() {
		this(System.in);
	}

	public IO(InputStream source) {
		super(System.out);
		this.in = source;
	}

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}

	private int readByte() {
		if (hasNextByte())
			return buffer[ptr++];
		else
			return -1;
	}

	private static boolean isPrintableChar(int c) {
		return 33 <= c && c <= 126;
	}

	private static boolean isNewLine(int c) {
		return c == '\n' || c == '\r';
	}

	private void skipUnprintable() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
	}

	private void skipNewLine() {
		while (hasNextByte() && isNewLine(buffer[ptr]))
			ptr++;
	}

	public boolean hasNext() {
		skipUnprintable();
		return hasNextByte();
	}

	public boolean hasNextLine() {
		skipNewLine();
		return hasNextByte();
	}

	public String next() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while (isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	public char[] nextCharArray(int len) {
		char[] s = new char[len];
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		int i = 0;
		int b = readByte();
		while (isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}

	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while (!isNewLine(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	public long nextLong() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while (true) {
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			} else if (b == -1 || !isPrintableChar(b)) {
				return minus ? -n : n;
			} else {
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}

	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
			throw new NumberFormatException();
		}
		return (int) nl;
	}

	public char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}

	public double nextDouble() {
		return Double.parseDouble(next());
	}

	public int[] arrayInt(int n) {
		int[] a = new int[n];
		for (int i = 0; i < n; i++)
			a[i] = nextInt();
		return a;
	}

	public long[] arrayLong(int n) {
		long[] a = new long[n];
		for (int i = 0; i < n; i++)
			a[i] = nextLong();
		return a;
	}

	public double[] arrayDouble(int n) {
		double[] a = new double[n];
		for (int i = 0; i < n; i++)
			a[i] = nextDouble();
		return a;
	}

	public void arrayInt(int[]... a) {
		for (int i = 0; i < a[0].length; i++)
			for (int j = 0; j < a.length; j++)
				a[j][i] = nextInt();
	}

	public int[][] matrixInt(int n, int m) {
		int[][] a = new int[n][m];
		for (int i = 0; i < n; i++)
			a[i] = arrayInt(m);
		return a;
	}

	public char[][] charMap(int n, int m) {
		char[][] a = new char[n][m];
		for (int i = 0; i < n; i++)
			a[i] = nextCharArray(m);
		return a;
	}

	public void close() {
		super.close();
		try {
			in.close();
		} catch (IOException e) {
		}
	}
}
0