結果
| 問題 | No.473 和と積の和 |
| ユーザー |
 tanzaku
|
| 提出日時 | 2016-12-23 23:33:01 |
| 言語 | Java21 (openjdk 21) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 8,693 bytes |
| コンパイル時間 | 5,780 ms |
| コンパイル使用メモリ | 95,356 KB |
| 実行使用メモリ | 39,904 KB |
| 最終ジャッジ日時 | 2024-05-09 13:35:00 |
| 合計ジャッジ時間 | 8,709 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | RE | - |
| testcase_01 | RE | - |
| testcase_02 | RE | - |
| testcase_03 | RE | - |
| testcase_04 | RE | - |
| testcase_05 | RE | - |
| testcase_06 | RE | - |
| testcase_07 | RE | - |
| testcase_08 | RE | - |
| testcase_09 | RE | - |
| testcase_10 | RE | - |
| testcase_11 | RE | - |
| testcase_12 | RE | - |
| testcase_13 | RE | - |
| testcase_14 | RE | - |
| testcase_15 | RE | - |
| testcase_16 | RE | - |
| testcase_17 | RE | - |
| testcase_18 | RE | - |
| testcase_19 | RE | - |
| testcase_20 | RE | - |
| testcase_21 | RE | - |
| testcase_22 | RE | - |
| testcase_23 | RE | - |
| testcase_24 | RE | - |
| testcase_25 | RE | - |
| testcase_26 | RE | - |
| testcase_27 | RE | - |
| testcase_28 | RE | - |
| testcase_29 | RE | - |
| testcase_30 | RE | - |
| testcase_31 | RE | - |
| testcase_32 | RE | - |
| testcase_33 | RE | - |
| testcase_34 | RE | - |
| testcase_35 | RE | - |
| testcase_36 | RE | - |
| testcase_37 | RE | - |
| testcase_38 | RE | - |
| testcase_39 | RE | - |
| testcase_40 | RE | - |
| testcase_41 | RE | - |
| testcase_42 | RE | - |
| testcase_43 | RE | - |
| testcase_44 | RE | - |
| testcase_45 | RE | - |
| testcase_46 | RE | - |
ソースコード
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);
}
}
divisor.add(X);
Collections.sort(divisor);
// Collections.reverse(divisor);
Arrays.fill(memo, -1);
io.out.println(dfs(0, n - 1, X));
// dfs(n - 1, X);
// io.out.println(visited.size());
}
}
List<Integer> divisor = new ArrayList<>();
int[] memo = new int[100*1350*1350];
int dfs(int idx, int num, int cur) {
if (idx >= divisor.size() - 1 || cur == 1) return 0;
final int d = divisor.get(idx);
if (cur < d) return 0;
if (num == 0) return 1;
int curi = Collections.binarySearch(divisor, cur);
int key = (curi * 100 + num) * 1350 + idx;
if (memo[key] != -1) return memo[key];
int ans = dfs(idx + 1, num, cur);
if (cur != d && cur % d == 0) {
ans += dfs(idx, num - 1, cur / divisor.get(idx));
}
return memo[key] = ans;
}
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; }
}
}