#141035 (Java21) No.473 和と積の和

提出ソース

結果

問題	No.473 和と積の和
ユーザー	tanzaku
提出日時	2016-12-23 19:15:22
言語	Java21 (openjdk 21)
結果	TLE (最新) AC (最初)
実行時間	-
コード長	9,857 bytes
コンパイル時間	5,191 ms
コンパイル使用メモリ	92,592 KB
実行使用メモリ	379,456 KB
最終ジャッジ日時	2024-12-16 03:19:21
合計ジャッジ時間	27,136 ms
ジャッジサーバーID （参考情報）	judge2 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	52 ms 37,208 KB
testcase_01	AC	52 ms 37,200 KB
testcase_02	AC	52 ms 37,000 KB
testcase_03	AC	953 ms 121,340 KB
testcase_04	AC	53 ms 37,192 KB
testcase_05	AC	54 ms 37,000 KB
testcase_06	AC	54 ms 36,980 KB
testcase_07	AC	55 ms 36,616 KB
testcase_08	AC	54 ms 36,856 KB
testcase_09	AC	54 ms 37,192 KB
testcase_10	AC	49 ms 36,948 KB
testcase_11	AC	52 ms 36,756 KB
testcase_12	AC	53 ms 37,080 KB
testcase_13	AC	53 ms 37,164 KB
testcase_14	AC	55 ms 37,228 KB
testcase_15	AC	54 ms 36,836 KB
testcase_16	AC	55 ms 37,208 KB
testcase_17	AC	57 ms 36,972 KB
testcase_18	AC	53 ms 36,988 KB
testcase_19	AC	50 ms 37,076 KB
testcase_20	AC	55 ms 36,916 KB
testcase_21	AC	55 ms 37,104 KB
testcase_22	AC	55 ms 36,940 KB
testcase_23	AC	110 ms 40,684 KB
testcase_24	AC	136 ms 42,308 KB
testcase_25	TLE	-
testcase_26	AC	962 ms 110,884 KB
testcase_27	AC	1,158 ms 169,720 KB
testcase_28	AC	59 ms 37,300 KB
testcase_29	AC	77 ms 39,024 KB
testcase_30	AC	72 ms 38,912 KB
testcase_31	AC	70 ms 38,332 KB
testcase_32	AC	71 ms 38,204 KB
testcase_33	AC	56 ms 37,056 KB
testcase_34	AC	1,861 ms 205,556 KB
testcase_35	AC	1,826 ms 206,764 KB
testcase_36	AC	89 ms 39,036 KB
testcase_37	AC	57 ms 37,128 KB
testcase_38	AC	1,721 ms 206,896 KB
testcase_39	AC	988 ms 113,064 KB
testcase_40	AC	998 ms 115,732 KB
testcase_41	AC	1,000 ms 127,556 KB
testcase_42	AC	63 ms 37,232 KB
testcase_43	AC	457 ms 76,324 KB
testcase_44	AC	904 ms 114,788 KB
testcase_45	AC	54 ms 36,620 KB
testcase_46	AC	56 ms 37,264 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

import java.io.*;
import java.math.*;
import java.util.*;
import java.util.Map.Entry;

import static java.util.Arrays.*;

public class _473 {
	private static final int mod = (int)1e9+7;

	final Random random = new Random(0);
	final IOFast io = new IOFast();

	/// MAIN CODE
	public void run() throws IOException {
//		int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());
		int TEST_CASE = 1;
		while(TEST_CASE-- != 0) {
			int n = io.nextInt();
			int X = io.nextInt() + 1;

//			Counter<Integer> t = new Counter<>();
//			t.add(X);
//			dfs(t, n - 1);
//			io.out.println(ans);
			
			for (int i = 2; i*i <= X; i++) {
				if (X % i == 0) {
					divisor.add(i);
					if (i*i != X) divisor.add(X/i);
				}
			}
			Collections.sort(divisor);
			Collections.reverse(divisor);
			
			io.out.println(dfs(divisor.size() - 1, n - 1, X));
		}
	}
	
	Map<Long, Integer> memo = new TreeMap<>();
	List<Integer> divisor = new ArrayList<>();
	int dfs(int idx, int num, long cur) {
		if (idx < 0 || cur == 1) return 0;
		final int d = divisor.get(idx);
		if (cur < d) return 0;
		if (num == 0) return 1;
		long key = (cur * 1000 + num) * divisor.size() + idx;
		if (memo.containsKey(key)) return memo.get(key);
		int ans = dfs(idx - 1, num, cur);
		if (cur != d && cur % d == 0) {
			ans += dfs(idx, num - 1, cur / divisor.get(idx));
		}
		memo.put(key, ans);
//		dump(idx, num, cur, ans, d);
		return ans;
	}
	
	Set<Long> vis = new HashSet<>();
	int ans;
	void dfs(Counter<Integer> counter, int n) {
		final long h = counter.hash();
		if (vis.add(h)) {
			if (n == 0) {
				ans++;
				return;
			}
			if (counter.valueCount() == 0) {
				return;
			}
			Entry<Integer, Integer> e = counter.pollLastEntry();
			final int x = e.getKey();
			counter.add(x, e.getValue() - 1);
			if (n - rec2(x) <= 0) {
				for (int ys : rec(x)) {
					final int k1 = ys;
					final int k2 = x/ys;
					if (!rec(k1).isEmpty()) counter.add(k1);
					if (!rec(k2).isEmpty()) counter.add(k2);
					dfs(counter, n - 1);
					if (!rec(k1).isEmpty()) counter.remove(k1);
					if (!rec(k2).isEmpty()) counter.remove(k2);
				}
			}
			counter.add(e.getKey(), 1);
		}
	}
	
	Map<Integer, Integer> mp2 = new HashMap<>();
	int rec2(int x) {
		if (mp2.containsKey(x)) return mp2.get(x);
		int ans = 0;
		for (int i : rec(x)) {
			ans = Math.max(ans, rec2(i) + rec2(x/i) + 1);
		}
		mp2.put(x, ans);
		return ans;
	}
	
	Map<Integer, List<Integer>> mp = new HashMap<>();
	List<Integer> rec(int x) {
		if (mp.containsKey(x)) return mp.get(x);
		List<Integer> res = new ArrayList<>();
		for (int i = 2; i*i <= x+1; i++) {
			if (x%i == 0) {
				res.add(i);
			}
		}
		mp.put(x, res);
		return res;
	}
	
	static class Counter<T extends Comparable<T>> implements Comparable<Counter<T>> {
		final Random random = new Random();
		
		TreeMap<T, Integer> mp = new TreeMap<>();
		Map<T, Long> hashMaps = new HashMap<>();
		long hash;
		int valueCount;
		
		public void add(T key) { update(key, 1); }
		public void add(T key, int cnt) { update(key, cnt); }
		public void remove(T key) { update(key, -1); }
		public void remove(T key, int cnt) { update(key, -cnt); }
		
		public Set<Entry<T, Integer>> entrySet() { return mp.entrySet(); }
		public Set<T> keySet() { return mp.keySet(); }
		public int valueCount() { return valueCount; }
		public long hash() { return hash; }
		
		public Entry<T, Integer> pollLastEntry() {
			Entry<T, Integer> e = mp.pollLastEntry();
			updateHash(e.getKey(), -e.getValue());
			return e;
		}
		
		public Entry<T, Integer> pollFirstEntry() {
			Entry<T, Integer> e = mp.pollFirstEntry();
			updateHash(e.getKey(), -e.getValue());
			return e;
		}
		public void update(T key, int cnt) {
			Integer boxed = mp.get(key);
			int v = boxed == null ? 0 : boxed;
			if (v + cnt < 0) cnt = -v;
			if (cnt == 0) { return; }
			if (v + cnt == 0) { mp.remove(key); }
			else { mp.put(key, v + cnt); }
			updateHash(key, cnt);
		}
		public void updateHash(T key, int cnt) {
			Long h = hashMaps.get(key);
			if (h == null) hashMaps.put(key, h = random.nextLong());
			hash += h * cnt;
			valueCount += cnt;
		}

		@Override
		public int compareTo(Counter<T> arg0) {
			if (mp.size() != arg0.mp.size()) return mp.size() - arg0.mp.size();
			TreeMap<T, Integer> x = new TreeMap<>(mp);
			TreeMap<T, Integer> y = new TreeMap<>(arg0.mp);
			while (true) {
				Entry<T, Integer> vx = x.pollFirstEntry();
				Entry<T, Integer> vy = y.pollFirstEntry();
				if (!vx.getKey().equals(vy.getKey())) return vx.getKey().compareTo(vy.getKey());
				if (!vx.getValue().equals(vy.getValue())) return vx.getValue().compareTo(vy.getValue());
				if (x.isEmpty()) return 0;
			}
		}
		
		@Override
		public String toString() {
			return mp.toString();
		}
	}
	
	/// TEMPLATE
	static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); }
	static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); }
	
	static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; }
	static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; }

	void printArrayLn(int[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
	void printArrayLn(long[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
	
	static void dump(Object... o) { System.err.println(Arrays.deepToString(o)); } 
	
	void main() throws IOException {
		//		IOFast.setFileIO("rle-size.in", "rle-size.out");
		try { run(); }
		catch (EndOfFileRuntimeException e) { }
		io.out.flush();
	}
	public static void main(String[] args) throws IOException { new _473().main(); }
	
	static class EndOfFileRuntimeException extends RuntimeException {
		private static final long serialVersionUID = -8565341110209207657L; }

	static
	public class IOFast {
		private InputStream in = System.in;
		private PrintWriter out = new PrintWriter(System.out);

		private static int pos, readLen;
		private static final byte[] buffer = new byte[1024 * 8];
		private static char[] str = new char[500*8*2];
		private static boolean[] isDigit = new boolean[256];
		private static boolean[] isSpace = new boolean[256];
		private static boolean[] isLineSep = new boolean[256];

		static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; }
		public byte read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; }
		public int nextInt() throws IOException {
			byte first = (byte)nextChar();
			boolean minus = false;
			int res = 0;
			if (first == '-') {
				minus = true;
			} else {
				res = first - '0';
			}
			while (true) {
				byte b = read();
				if (isSpace[b]) break;
				res = res * 10 + b - '0';
			}
			return minus ? -res : res;
		}
		public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } }
		int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); }
		public String nextString() throws IOException { return new String(next()); }
		public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); }
//		public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; }
//		public double nextDouble() throws IOException { return Double.parseDouble(nextString()); }
		public double nextDouble() throws IOException {
			double res = nextChar() - '0';
			while (true) {
				byte c = read();
				if (isSpace[c]) return res;
				if (c == '.') break;
				res = res * 10 + c - '0';
			}
			double d = 1;
			while (true) {
				byte c = read();
//				dump(c);
				if (!isDigit[c]) break;
				res = res * 10 + c - '0';
				d *= 10;
			}
//			dump(1);
			return res / d;
		}
		public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; }
		public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; }
		public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; }
		public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; }
		public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; }
	}
}

yukicoder

結果

テストケース

ソースコード