#156688 (Java21) No.493 とても長い数列と文字列(Long Long Sequence and a String）

提出ソース

結果

問題	No.493 とても長い数列と文字列(Long Long Sequence and a String）
ユーザー	uwi
提出日時	2017-03-10 22:49:55
言語	Java21 (openjdk 21)
結果	WA
実行時間	-
コード長	5,308 bytes
コンパイル時間	3,909 ms
コンパイル使用メモリ	82,664 KB
実行使用メモリ	53,204 KB
最終ジャッジ日時	2024-06-24 08:26:37
合計ジャッジ時間	15,058 ms
ジャッジサーバーID （参考情報）	judge5 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	69 ms 51,024 KB
testcase_01	AC	70 ms 50,892 KB
testcase_02	AC	70 ms 51,060 KB
testcase_03	AC	52 ms 50,136 KB
testcase_04	AC	73 ms 51,268 KB
testcase_05	AC	70 ms 51,224 KB
testcase_06	AC	70 ms 51,052 KB
testcase_07	AC	71 ms 51,024 KB
testcase_08	AC	52 ms 50,016 KB
testcase_09	AC	71 ms 50,880 KB
testcase_10	AC	69 ms 51,076 KB
testcase_11	AC	72 ms 51,212 KB
testcase_12	AC	67 ms 50,784 KB
testcase_13	AC	67 ms 50,712 KB
testcase_14	AC	68 ms 51,196 KB
testcase_15	AC	70 ms 50,880 KB
testcase_16	AC	69 ms 51,376 KB
testcase_17	AC	73 ms 51,032 KB
testcase_18	AC	70 ms 51,176 KB
testcase_19	AC	69 ms 51,088 KB
testcase_20	AC	71 ms 51,172 KB
testcase_21	AC	70 ms 50,760 KB
testcase_22	AC	71 ms 51,252 KB
testcase_23	AC	70 ms 51,264 KB
testcase_24	AC	71 ms 51,356 KB
testcase_25	AC	70 ms 51,080 KB
testcase_26	AC	70 ms 50,732 KB
testcase_27	AC	68 ms 51,144 KB
testcase_28	AC	71 ms 51,016 KB
testcase_29	AC	68 ms 51,312 KB
testcase_30	AC	71 ms 51,108 KB
testcase_31	AC	71 ms 51,080 KB
testcase_32	AC	71 ms 51,024 KB
testcase_33	AC	70 ms 51,080 KB
testcase_34	AC	69 ms 51,128 KB
testcase_35	AC	68 ms 51,092 KB
testcase_36	AC	68 ms 50,896 KB
testcase_37	AC	71 ms 50,920 KB
testcase_38	AC	68 ms 51,084 KB
testcase_39	AC	74 ms 51,108 KB
testcase_40	AC	72 ms 50,616 KB
testcase_41	AC	73 ms 51,108 KB
testcase_42	AC	71 ms 51,192 KB
testcase_43	AC	72 ms 51,132 KB
testcase_44	AC	72 ms 50,928 KB
testcase_45	AC	71 ms 51,080 KB
testcase_46	AC	70 ms 51,148 KB
testcase_47	AC	71 ms 51,184 KB
testcase_48	AC	71 ms 51,032 KB
testcase_49	AC	72 ms 51,076 KB
testcase_50	AC	69 ms 50,868 KB
testcase_51	AC	71 ms 50,688 KB
testcase_52	AC	71 ms 51,128 KB
testcase_53	AC	72 ms 50,612 KB
testcase_54	AC	71 ms 51,132 KB
testcase_55	AC	72 ms 51,100 KB
testcase_56	AC	72 ms 50,968 KB
testcase_57	AC	71 ms 50,948 KB
testcase_58	AC	71 ms 51,268 KB
testcase_59	WA	-
testcase_60	WA	-
testcase_61	WA	-
testcase_62	WA	-
testcase_63	WA	-
testcase_64	WA	-
testcase_65	WA	-
testcase_66	WA	-
testcase_67	WA	-
testcase_68	WA	-
testcase_69	WA	-
testcase_70	WA	-
testcase_71	WA	-
testcase_72	WA	-
testcase_73	WA	-
testcase_74	WA	-
testcase_75	WA	-
testcase_76	WA	-
testcase_77	WA	-
testcase_78	WA	-
testcase_79	WA	-
testcase_80	WA	-
testcase_81	WA	-
testcase_82	WA	-
testcase_83	WA	-
testcase_84	WA	-
testcase_85	WA	-
testcase_86	WA	-
testcase_87	WA	-
testcase_88	WA	-
testcase_89	WA	-
testcase_90	WA	-
testcase_91	WA	-
testcase_92	WA	-
testcase_93	WA	-
testcase_94	WA	-
testcase_95	WA	-
testcase_96	WA	-
testcase_97	WA	-
testcase_98	WA	-
testcase_99	WA	-
testcase_100	WA	-
testcase_101	WA	-
testcase_102	WA	-
testcase_103	WA	-
testcase_104	WA	-
testcase_105	WA	-
testcase_106	WA	-
testcase_107	WA	-
testcase_108	WA	-
testcase_109	WA	-
testcase_110	WA	-
testcase_111	WA	-
testcase_112	WA	-
testcase_113	WA	-
testcase_114	AC	71 ms 51,068 KB
testcase_115	AC	71 ms 51,036 KB
testcase_116	AC	73 ms 50,732 KB
testcase_117	AC	70 ms 51,176 KB
testcase_118	AC	70 ms 51,224 KB

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

ソースコード

raw source code

package contest170310;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class D {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	long[] len = new long[61];
	int[] llen = new int[61];
	long[] sum = new long[61];
	long[] prod = new long[61];
	int mod = 1000000007;
	
	void solve()
	{
		int K = ni();
		long L = nl(), R = nl();
		len[1] = 1;
		sum[1] = 1;
		prod[1] = 1;
		llen[1] = 1;
		for(int i = 2;i <= 60;i++){
			llen[i] = Long.toString(i*i).length();
			len[i] = llen[i] + len[i-1] * 2;
			sum[i] = sum[i-1] * 2;
			prod[i] = prod[i-1] * prod[i-1] % mod;
			for(int j = i*i;j > 0;j /= 10){
				int v = j % 10 == 0 ? 10 : j % 10;
				sum[i] += v;
				prod[i] = prod[i] * v % mod;
			}
			sum[i] %= mod;
		}
		if(K <= 60 && R > len[K]){
			out.println(-1);
			return;
		}
		out.print(sum(R, 60) - sum(L-1, 60) + " ");
		out.println(mul(R, 60)* invl(mul(L-1, 60), mod) % mod);
	}
	
	public static long invl(long a, long mod) {
		long b = mod;
		long p = 1, q = 0;
		while (b > 0) {
			long c = a / b;
			long d;
			d = a;
			a = b;
			b = d % b;
			d = p;
			p = q;
			q = d - c * q;
		}
		return p < 0 ? p + mod : p;
	}

	
	long sum(long n, int zone)
	{
		if(n <= 0)return 0L;
		if(zone == 1)return 1L;
		if(n <= len[zone-1]){
			return sum(n, zone-1);
		}else if(n <= len[zone-1] + llen[zone]){
			long ret = sum[zone-1];
			long rem = n - len[zone-1];
			char[] s = Long.toString(zone*zone).toCharArray();
			for(int i = 0;i < rem;i++){
				int v = s[i] == '0' ? 10 : s[i]-'0';
				ret += v;
			}
			return ret;
		}else{
			long ret = sum[zone-1];
			char[] s = Long.toString(zone*zone).toCharArray();
			for(int i = 0;i < s.length;i++){
				int v = s[i] == '0' ? 10 : s[i]-'0';
				ret += v;
			}
			return (ret + sum(n-len[zone-1] - llen[zone], zone-1));
		}
	}
	
	long mul(long n, int zone)
	{
		if(n <= 0)return 1L;
		if(zone == 1)return 1L;
		if(n <= len[zone-1]){
			return mul(n, zone-1);
		}else if(n <= len[zone-1] + llen[zone]){
			long ret = prod[zone-1];
			long rem = n - len[zone-1];
			char[] s = Long.toString(zone*zone).toCharArray();
			for(int i = 0;i < rem;i++){
				int v = s[i] == '0' ? 10 : s[i]-'0';
				ret = ret * v % mod;
			}
			return ret;
		}else{
			long ret = prod[zone-1];
			char[] s = Long.toString(zone*zone).toCharArray();
			for(int i = 0;i < s.length;i++){
				int v = s[i] == '0' ? 10 : s[i]-'0';
				ret = ret * v % mod;
			}
			return (ret * mul(n-len[zone-1] - llen[zone], zone-1)) % mod;
		}
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-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();
	}
	
	public static void main(String[] args) throws Exception { new D().run(); }
	
	private 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 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))){ // when nextLine, (isSpaceChar(b) && 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 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 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[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	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();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}

yukicoder

結果

テストケース

ソースコード