#570348 (Java21) No.1269 I hate Fibonacci Number

提出ソース

結果

問題	No.1269 I hate Fibonacci Number
ユーザー	uwi
提出日時	2020-10-23 22:36:21
言語	Java21 (openjdk 21)
結果	AC
実行時間	261 ms / 3,000 ms
コード長	13,086 bytes
コンパイル時間	5,181 ms
コンパイル使用メモリ	92,660 KB
実行使用メモリ	44,316 KB
最終ジャッジ日時	2024-07-21 11:26:18
合計ジャッジ時間	10,899 ms
ジャッジサーバーID （参考情報）	judge5 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	76 ms 37,828 KB
testcase_01	AC	76 ms 37,720 KB
testcase_02	AC	116 ms 39,704 KB
testcase_03	AC	77 ms 38,092 KB
testcase_04	AC	80 ms 37,548 KB
testcase_05	AC	77 ms 37,872 KB
testcase_06	AC	81 ms 37,720 KB
testcase_07	AC	79 ms 37,708 KB
testcase_08	AC	79 ms 37,984 KB
testcase_09	AC	75 ms 37,684 KB
testcase_10	AC	76 ms 37,676 KB
testcase_11	AC	77 ms 37,764 KB
testcase_12	AC	80 ms 37,852 KB
testcase_13	AC	153 ms 44,316 KB
testcase_14	AC	174 ms 43,540 KB
testcase_15	AC	112 ms 40,380 KB
testcase_16	AC	155 ms 42,824 KB
testcase_17	AC	97 ms 38,260 KB
testcase_18	AC	170 ms 43,012 KB
testcase_19	AC	143 ms 42,808 KB
testcase_20	AC	111 ms 40,308 KB
testcase_21	AC	152 ms 43,240 KB
testcase_22	AC	140 ms 42,564 KB
testcase_23	AC	147 ms 42,720 KB
testcase_24	AC	120 ms 40,988 KB
testcase_25	AC	125 ms 42,076 KB
testcase_26	AC	104 ms 38,948 KB
testcase_27	AC	78 ms 38,024 KB
testcase_28	AC	124 ms 40,140 KB
testcase_29	AC	123 ms 41,736 KB
testcase_30	AC	111 ms 41,300 KB
testcase_31	AC	193 ms 43,980 KB
testcase_32	AC	132 ms 42,952 KB
testcase_33	AC	261 ms 44,064 KB
testcase_34	AC	85 ms 37,840 KB
testcase_35	AC	111 ms 41,072 KB
testcase_36	AC	81 ms 37,836 KB
testcase_37	AC	73 ms 37,380 KB
testcase_38	AC	80 ms 37,936 KB

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

ソースコード

raw source code

package contest201023;
import java.io.*;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;

public class F {
	InputStream is;
	FastWriter out;

	String INPUT = "";

	public void solve()
	{
		long[] fib = new long[90];
		fib[0] = fib[1] = 1;
		for(int i = 2;i < 90;i++){
			fib[i] = fib[i-1] + fib[i-2];
		}
		int n = ni();
		long L = nl(), R = nl();
		TrieArrayByArray trie = new TrieArrayByArray(90*19, 10);
		for(int i = 1;i < 90;i++){
			if(L <= fib[i] && fib[i] <= R){
				trie.add(Long.toString(fib[i]).toCharArray());
			}
		}
		trie.buildFailure();;
		final int mod = 1000000007;
		long[] dp = new long[trie.gen];
		dp[0] = 1;
		int[][] g = new int[trie.gen][10];
		for(int j = 0;j < trie.gen;j++){
			for(int t = 0;t < 10;t++){
				g[j][t] = trie.next(j, (char)('0'+t));
			}
		}

		for(int i = 0;i < n;i++){
			long[] ndp = new long[trie.gen];
			for(int j = 0;j < trie.gen;j++){
				for(int t = 0;t < 10;t++){
					if(trie.hit[g[j][t]] > 0)continue;
					ndp[g[j][t]] += dp[j];
					ndp[g[j][t]] %= mod;
				}
			}
			dp = ndp;
		}
		long ans = mod-1;
		for(long v : dp){
			ans += v;
		}
		out.println(ans%mod);
	}

	public static class TrieArrayByArray {
		// root = 0
		public int K;
		public int[] next;
		public int gen;
		public int size;

		public int[] hit;

		public int[] fail;

		public static int f(char c)
		{
			return c - '0';
		}

		public TrieArrayByArray(int n, int K)
		{
			this.K = K;
			this.size = n+1;
			this.next = new int[(n+1)*K];
			this.hit = new int[n+1];
			this.gen = 1;

			Arrays.fill(this.next, -1);
		}

		public void add(char[] s)
		{
			int cur = 0;
			for(char c : s){
				int v = f(c);
				int nex = next[cur*K+v];
				if(nex == -1)nex = next[cur*K+v] = gen++;
				cur = nex;
			}
			hit[cur]++;
		}

		public void buildFailure()
		{
			this.fail = new int[this.size];
			Arrays.fill(this.fail, -1);
			int[] q = new int[gen];
			int p = 1;
			for(int r = 0;r < p;r++){
				int cur = q[r];
				inner:
				for(int i = 0;i < K;i++){
					int ch = next[cur*K+i];
					if(ch == -1)continue;
					q[p++] = ch;
					for(int to = fail[cur]; to != -1; to = fail[to]){
						int lch = next[to*K+i];
						if(lch != -1){
							fail[ch] = lch;
							hit[ch] += hit[lch];
							continue inner;
						}
					}
					fail[ch] = 0; // failed to root
				}
			}
			assert p == gen;
		}

		public int next(int cur, char c)
		{
			int val = f(c);
			for(;cur != -1;cur = fail[cur]){
				int ch = next[cur*K+val];
				if(ch != -1)return ch;
			}
			return 0;
		}

		public int[] countHits(char[] q)
		{
			int[] hits = new int[q.length];
			int cur = 0;
			outer:
			for(int i = 0;i < q.length;i++){
				for(;cur != -1;cur = fail[cur]){
					int lch = next[cur*K+f(q[i])];
					if(lch != -1){
						hits[i] += hit[lch];
						cur = lch;
						continue outer;
					}
				}
				cur = 0;
			}
			return hits;
		}

	}


	public static void main(String[] args) {
		new F().run();
	}

	public void run()
	{
		long S = System.currentTimeMillis();
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new FastWriter(System.out);

		solve();
		out.flush();
		long G = System.currentTimeMillis();
		tr(G-S+"ms");
		//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
		//			@Override
		//			public void run() {
		//				long s = System.currentTimeMillis();
		//				solve();
		//				out.flush();
		//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
		//			}
		//		};
		//		t.start();
		//		t.join();
	}

	private boolean eof()
	{
		if(lenbuf == -1)return true;
		int lptr = ptrbuf;
		while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;

		try {
			is.mark(1000);
			while(true){
				int b = is.read();
				if(b == -1){
					is.reset();
					return true;
				}else if(!isSpaceChar(b)){
					is.reset();
					return false;
				}
			}
		} catch (IOException e) {
			return true;
		}
	}

	private final byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;

	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}

	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	//	private boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }

	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }

	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}

	private char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}

	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}

	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}

	private int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}

		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}

	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}

		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}

	public static class FastWriter
	{
		private static final int BUF_SIZE = 1<<13;
		private final byte[] buf = new byte[BUF_SIZE];
		private final OutputStream out;
		private int ptr = 0;

		private FastWriter(){out = null;}

		public FastWriter(OutputStream os)
		{
			this.out = os;
		}

		public FastWriter(String path)
		{
			try {
				this.out = new FileOutputStream(path);
			} catch (FileNotFoundException e) {
				throw new RuntimeException("FastWriter");
			}
		}

		public FastWriter write(byte b)
		{
			buf[ptr++] = b;
			if(ptr == BUF_SIZE)innerflush();
			return this;
		}

		public FastWriter write(char c)
		{
			return write((byte)c);
		}

		public FastWriter write(char[] s)
		{
			for(char c : s){
				buf[ptr++] = (byte)c;
				if(ptr == BUF_SIZE)innerflush();
			}
			return this;
		}

		public FastWriter write(String s)
		{
			s.chars().forEach(c -> {
				buf[ptr++] = (byte)c;
				if(ptr == BUF_SIZE)innerflush();
			});
			return this;
		}

		private static int countDigits(int l) {
			if (l >= 1000000000) return 10;
			if (l >= 100000000) return 9;
			if (l >= 10000000) return 8;
			if (l >= 1000000) return 7;
			if (l >= 100000) return 6;
			if (l >= 10000) return 5;
			if (l >= 1000) return 4;
			if (l >= 100) return 3;
			if (l >= 10) return 2;
			return 1;
		}

		public FastWriter write(int x)
		{
			if(x == Integer.MIN_VALUE){
				return write((long)x);
			}
			if(ptr + 12 >= BUF_SIZE)innerflush();
			if(x < 0){
				write((byte)'-');
				x = -x;
			}
			int d = countDigits(x);
			for(int i = ptr + d - 1;i >= ptr;i--){
				buf[i] = (byte)('0'+x%10);
				x /= 10;
			}
			ptr += d;
			return this;
		}

		private static int countDigits(long l) {
			if (l >= 1000000000000000000L) return 19;
			if (l >= 100000000000000000L) return 18;
			if (l >= 10000000000000000L) return 17;
			if (l >= 1000000000000000L) return 16;
			if (l >= 100000000000000L) return 15;
			if (l >= 10000000000000L) return 14;
			if (l >= 1000000000000L) return 13;
			if (l >= 100000000000L) return 12;
			if (l >= 10000000000L) return 11;
			if (l >= 1000000000L) return 10;
			if (l >= 100000000L) return 9;
			if (l >= 10000000L) return 8;
			if (l >= 1000000L) return 7;
			if (l >= 100000L) return 6;
			if (l >= 10000L) return 5;
			if (l >= 1000L) return 4;
			if (l >= 100L) return 3;
			if (l >= 10L) return 2;
			return 1;
		}

		public FastWriter write(long x)
		{
			if(x == Long.MIN_VALUE){
				return write("" + x);
			}
			if(ptr + 21 >= BUF_SIZE)innerflush();
			if(x < 0){
				write((byte)'-');
				x = -x;
			}
			int d = countDigits(x);
			for(int i = ptr + d - 1;i >= ptr;i--){
				buf[i] = (byte)('0'+x%10);
				x /= 10;
			}
			ptr += d;
			return this;
		}

		public FastWriter write(double x, int precision)
		{
			if(x < 0){
				write('-');
				x = -x;
			}
			x += Math.pow(10, -precision)/2;
			//		if(x < 0){ x = 0; }
			write((long)x).write(".");
			x -= (long)x;
			for(int i = 0;i < precision;i++){
				x *= 10;
				write((char)('0'+(int)x));
				x -= (int)x;
			}
			return this;
		}

		public FastWriter writeln(char c){
			return write(c).writeln();
		}

		public FastWriter writeln(int x){
			return write(x).writeln();
		}

		public FastWriter writeln(long x){
			return write(x).writeln();
		}

		public FastWriter writeln(double x, int precision){
			return write(x, precision).writeln();
		}

		public FastWriter write(int... xs)
		{
			boolean first = true;
			for(int x : xs) {
				if (!first) write(' ');
				first = false;
				write(x);
			}
			return this;
		}

		public FastWriter write(long... xs)
		{
			boolean first = true;
			for(long x : xs) {
				if (!first) write(' ');
				first = false;
				write(x);
			}
			return this;
		}

		public FastWriter writeln()
		{
			return write((byte)'\n');
		}

		public FastWriter writeln(int... xs)
		{
			return write(xs).writeln();
		}

		public FastWriter writeln(long... xs)
		{
			return write(xs).writeln();
		}

		public FastWriter writeln(char[] line)
		{
			return write(line).writeln();
		}

		public FastWriter writeln(char[]... map)
		{
			for(char[] line : map)write(line).writeln();
			return this;
		}

		public FastWriter writeln(String s)
		{
			return write(s).writeln();
		}

		private void innerflush()
		{
			try {
				out.write(buf, 0, ptr);
				ptr = 0;
			} catch (IOException e) {
				throw new RuntimeException("innerflush");
			}
		}

		public void flush()
		{
			innerflush();
			try {
				out.flush();
			} catch (IOException e) {
				throw new RuntimeException("flush");
			}
		}

		public FastWriter print(byte b) { return write(b); }
		public FastWriter print(char c) { return write(c); }
		public FastWriter print(char[] s) { return write(s); }
		public FastWriter print(String s) { return write(s); }
		public FastWriter print(int x) { return write(x); }
		public FastWriter print(long x) { return write(x); }
		public FastWriter print(double x, int precision) { return write(x, precision); }
		public FastWriter println(char c){ return writeln(c); }
		public FastWriter println(int x){ return writeln(x); }
		public FastWriter println(long x){ return writeln(x); }
		public FastWriter println(double x, int precision){ return writeln(x, precision); }
		public FastWriter print(int... xs) { return write(xs); }
		public FastWriter print(long... xs) { return write(xs); }
		public FastWriter println(int... xs) { return writeln(xs); }
		public FastWriter println(long... xs) { return writeln(xs); }
		public FastWriter println(char[] line) { return writeln(line); }
		public FastWriter println(char[]... map) { return writeln(map); }
		public FastWriter println(String s) { return writeln(s); }
		public FastWriter println() { return writeln(); }
	}

	public static void trnz(int... o)
	{
		for(int i = 0;i < o.length;i++)if(o[i] != 0)System.out.print(i+":"+o[i]+" ");
		System.out.println();
	}

	// print ids which are 1
	public static void trt(long... o)
	{
		Queue<Integer> stands = new ArrayDeque<>();
		for(int i = 0;i < o.length;i++){
			for(long x = o[i];x != 0;x &= x-1)stands.add(i<<6|Long.numberOfTrailingZeros(x));
		}
		System.out.println(stands);
	}

	public static void tf(boolean... r)
	{
		for(boolean x : r)System.out.print(x?'#':'.');
		System.out.println();
	}

	public static void tf(boolean[]... b)
	{
		for(boolean[] r : b) {
			for(boolean x : r)System.out.print(x?'#':'.');
			System.out.println();
		}
		System.out.println();
	}

	public void tf(long[]... b)
	{
		if(INPUT.length() != 0) {
			for (long[] r : b) {
				for (long x : r) {
					for (int i = 0; i < 64; i++) {
						System.out.print(x << ~i < 0 ? '#' : '.');
					}
				}
				System.out.println();
			}
			System.out.println();
		}
	}

	public void tf(long... b)
	{
		if(INPUT.length() != 0) {
			for (long x : b) {
				for (int i = 0; i < 64; i++) {
					System.out.print(x << ~i < 0 ? '#' : '.');
				}
			}
			System.out.println();
		}
	}

	private void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}

yukicoder

結果

テストケース

ソースコード