結果
| 問題 |
No.434 占い
|
| コンテスト | |
| ユーザー |
 tanzaku
|
| 提出日時 | 2016-10-15 00:32:43 |
| 言語 | Java (openjdk 23) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 7,860 bytes |
| コンパイル時間 | 4,017 ms |
| コンパイル使用メモリ | 84,876 KB |
| 実行使用メモリ | 94,944 KB |
| 最終ジャッジ日時 | 2024-11-22 09:10:48 |
| 合計ジャッジ時間 | 22,810 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 24 TLE * 3 |
ソースコード
import java.io.*;
import java.math.*;
import java.util.*;
import java.util.Map.Entry;
import static java.util.Arrays.*;
public class Main {
private static final int mod = (int)1e9+7;
final Random random = new Random(0);
final IOFast io = new IOFast();
// TreeMap<Integer, Integer>[] comb = new TreeMap[100000];
/// MAIN CODE
public void run() throws IOException {
// check();
// while(true) {
// char[] cs = new char[random.nextInt(15)+1];
// for(int i = 0; i < cs.length; i++) cs[i] = (char)(random.nextInt(10)+'0');
// if(fast(cs.clone()) != slow(cs.clone())) {
// dump(cs, fast(cs.clone()), slow(cs.clone()));
// throw new RuntimeException();
// }
// }
//*
// int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());
int TEST_CASE = 1;
while(TEST_CASE-- != 0) {
int n = io.nextInt();
while(n-- > 0)
io.out.println(fast(io.next()));
}
//*/
}
void check() {
int[][] comb = new int[100][100];
for(int i = 0; i < comb.length; i++) {
comb[i][0] = comb[i][i] = 1;
for(int j = 1; j < i; j++) {
comb[i][j] = comb[i-1][j-1] + comb[i-1][j];
if(comb[i][j] >= 9) comb[i][j] -= 9;
}
dump(i, comb[i]);
}
}
int[] divisor = minDivisor(100000+1);
void proc(TreeMap<Integer, Integer> mp, int x, int v) {
for(; x != 0 && x != 1; x /= divisor[x]) {
int y = mp.getOrDefault(divisor[x], 0) + v;
if(y == 0) mp.remove(divisor[x]);
else mp.put(divisor[x], y);
}
}
int fast(char[] cs) {
long sum = 0;
int nonzero = 0;
for(int i = 0; i < cs.length; i++) {
cs[i] -= '0';
if(cs[i] != 0) nonzero = 1;
}
TreeMap<Integer, Integer> mp = new TreeMap<>();
for(int i = 0; i < cs.length; i++) {
long x = 1;
for(Entry<Integer, Integer> e : mp.entrySet()) {
for(int j = 0; j < e.getValue(); j++) {
x = x * e.getKey() % 9;
}
}
// dump(cs.length, i, x);
proc(mp, cs.length - 1 - i, 1);
proc(mp, i + 1, -1);
sum += cs[i] * x;
}
// for(Entry<Integer, Integer> e : comb[cs.length - 1].entrySet()) {
// sum += cs[e.getKey()] * e.getValue();
// dump(e);
// }
// dump(t, big, sum);
sum += nonzero * 9;
// io.out.println();
return (int)((sum - nonzero) % 9 + nonzero);
}
private static int[] minDivisor(int n) {
final int[] min = new int[n+1];
min[0] = min[1] = 1;
for(int i = 2; i*i <= n; i++) {
if(min[i] == 0) {
min[i] = i;
for(int j = i*i; j <= n; j += i) {
if(min[j] == 0) {
min[j] = i;
}
}
}
}
for(int i = 2; i <= n; i++) {
if(min[i] == 0) {
min[i] = i;
}
}
return min;
}
int slow(char[] cs) {
for(int i = 0; i < cs.length; i++) cs[i] -= '0';
for(int i = 0; i < cs.length; i++) {
for(int j = 0; j < cs.length - 1 - i; j++) {
cs[j] += cs[j+1];
if(cs[j] >= 10) cs[j] -= 9;
}
}
return cs[0];
}
/// 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 Main().main(); }
static class EndOfFileRuntimeException extends RuntimeException {
private static final long serialVersionUID = -8565341110209207657L; }
static
public class IOFast {
private BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
private PrintWriter out = new PrintWriter(System.out);
void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); }
void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); }
void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); }
private static int pos, readLen;
private static final char[] buffer = new char[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 int 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 { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int 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 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 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; }
}
}