#124308 (Java21) No.435 占い(Extra)

提出ソース

結果

問題	No.435 占い(Extra)
ユーザー	tanzaku
提出日時	2016-10-15 18:55:34
言語	Java21 (openjdk 21)
結果	MLE (最新) AC (最初)
実行時間	-
コード長	7,650 bytes
コンパイル時間	2,193 ms
コンパイル使用メモリ	85,888 KB
実行使用メモリ	77,056 KB
最終ジャッジ日時	2024-04-17 02:44:20
合計ジャッジ時間	27,893 ms
ジャッジサーバーID （参考情報）	judge2 / judge5

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	MLE	-
testcase_01	MLE	-
testcase_02	MLE	-
testcase_03	MLE	-
testcase_04	MLE	-
testcase_05	MLE	-
testcase_06	MLE	-
testcase_07	MLE	-
testcase_08	MLE	-
testcase_09	MLE	-
testcase_10	MLE	-
testcase_11	MLE	-
testcase_12	MLE	-
testcase_13	MLE	-
testcase_14	MLE	-
testcase_15	MLE	-
testcase_16	MLE	-
testcase_17	MLE	-
testcase_18	MLE	-
testcase_19	MLE	-
testcase_20	MLE	-
testcase_21	MLE	-
testcase_22	MLE	-
testcase_23	MLE	-
testcase_24	MLE	-
testcase_25	MLE	-
testcase_26	MLE	-
testcase_27	MLE	-
testcase_28	MLE	-
testcase_29	MLE	-
testcase_30	MLE	-
testcase_31	MLE	-
testcase_32	MLE	-
testcase_33	MLE	-
testcase_34	MLE	-
testcase_35	MLE	-

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

ソースコード

raw source code

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 {
//		dump(divisor);
//		for(int i = 2; i < 9; i++) {
//			List<Integer> xs = new ArrayList<>();
//			for(int j = 0, k = 1; j < 10; j++, k = k * i % 9) {
//				xs.add(k);
//			}
//			dump(xs);
//		}
		//*
		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();
			int a = io.nextInt();
			int b = io.nextInt();
			int m = io.nextInt();
			io.out.println(fast(n, x, a, b, m));
		}
		//*/
	}

	int[] loop = new int[]{
		-1, -1, 6, -1, 3, 6, -1, 3, 2
	};
	int[] mul = new int[9];
	short[] divisor = minDivisor(10000000+1);
	void proc(int[] mp, int x, int v) {
		for(; x != 0 && x != 1; x /= divisor[x]) {
			if(divisor[x] == -1) {
				mp[x % 9] += v;
				break;
			}
			mp[divisor[x] % 9] += v;
		}
	}
	int fast(int n, int x, int a, int b, int m) {
		long sum = 0;
		int nonzero = 0;
		Arrays.fill(mul, 0);
		for(int i = 0; i < n; i++) {
			long xx;
			if(mul[3] >= 2) {
				xx = 0;
			} else {
				xx = 1;
				for(int j = 2; j < mul.length; j++) if(mul[j] != 0) {
					int v = mul[j];
					if(loop[j] != -1) v %= loop[j];
					xx = xx * powmod(j, v, 9);
				}
			}
			proc(mul, n - 1 - i, 1);
			proc(mul, i + 1, -1);
			sum += x % 10 * xx;
//			dump(x, xx);
			if(x % 10 != 0) nonzero = 1;
			x = ((x ^ a) + b) % m;
		}
		sum += nonzero * 9;
		return (int)((sum - nonzero) % 9 + nonzero);
	}
	
	private static short[] minDivisor(int n) {
		final short[] min = new short[n+1];
		min[0] = min[1] = 1;
		for(int i = 2; i <= n; i++) {
			if(min[i] == 0) {
				final short v = i >= Short.MAX_VALUE ? -1 : (short)i;
				min[i] = v;
				for(long j = (long)i*i; j <= n; j += i) {
					if(min[(int)j] == 0) {
						min[(int)j] = v;
					}
				}
			}
		}
		return min;
	}
	
	static long powmod(long n, long r, int m) {
		long res = 1;
		for(; r != 0; r >>>= 1, n = n * n % m) {
			if((r&1) == 1) {
				res = res * n;
				if(res >= m) {
					res %= m;
				}
			}
		}
		return res;
	}
	
	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; }
	}
}

yukicoder

結果

テストケース

ソースコード