結果

問題 No.315 世界のなんとか3.5
ユーザー uwiuwi
提出日時 2015-12-08 02:26:43
言語 Java21
(openjdk 21)
結果
AC  
実行時間 309 ms / 2,000 ms
コード長 5,973 bytes
コンパイル時間 4,033 ms
コンパイル使用メモリ 86,468 KB
実行使用メモリ 51,428 KB
最終ジャッジ日時 2024-09-14 19:03:17
合計ジャッジ時間 11,044 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
50,236 KB
testcase_01 AC 57 ms
49,672 KB
testcase_02 AC 91 ms
51,428 KB
testcase_03 AC 53 ms
36,792 KB
testcase_04 AC 54 ms
36,636 KB
testcase_05 AC 55 ms
36,644 KB
testcase_06 AC 84 ms
38,332 KB
testcase_07 AC 56 ms
36,476 KB
testcase_08 AC 57 ms
36,616 KB
testcase_09 AC 54 ms
36,580 KB
testcase_10 AC 54 ms
36,820 KB
testcase_11 AC 53 ms
36,656 KB
testcase_12 AC 122 ms
39,060 KB
testcase_13 AC 127 ms
39,212 KB
testcase_14 AC 213 ms
41,496 KB
testcase_15 AC 221 ms
41,312 KB
testcase_16 AC 220 ms
41,612 KB
testcase_17 AC 205 ms
41,600 KB
testcase_18 AC 149 ms
39,404 KB
testcase_19 AC 148 ms
39,580 KB
testcase_20 AC 158 ms
39,468 KB
testcase_21 AC 159 ms
39,240 KB
testcase_22 AC 212 ms
41,688 KB
testcase_23 AC 214 ms
41,548 KB
testcase_24 AC 180 ms
40,308 KB
testcase_25 AC 221 ms
41,644 KB
testcase_26 AC 197 ms
41,620 KB
testcase_27 AC 190 ms
40,388 KB
testcase_28 AC 230 ms
41,748 KB
testcase_29 AC 305 ms
43,440 KB
testcase_30 AC 274 ms
43,312 KB
testcase_31 AC 266 ms
42,732 KB
testcase_32 AC 309 ms
43,040 KB
testcase_33 AC 191 ms
40,680 KB
testcase_34 AC 298 ms
43,596 KB
testcase_35 AC 273 ms
42,816 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;

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 Q766_2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	int mod = 1000000007;
	
	void solve()
	{
		char[] a = ns().toCharArray();
		char[] b = ns().toCharArray();
		int P = ni();
		long ret = count(b, P)-count(minus1(a), P)+mod;
		out.println(ret%mod);
	}
	
	long count(char[] a, int P)
	{
		int n = a.length;
		int q = P == 8 ? n-3 : P == 80 ? n-4 : n-5;
		q = Math.max(q, 0);
		long preaho = 0L;
		long[] pre = new long[3]; // 0,1,2:not-aho
		long curaho = 0L;
		long[] cur = new long[3];
		pre[0] = 0;
		int medge = 0, sedge = 0;
		for(int i = 0;i < q;i++){
			curaho = preaho * 10L % mod;
			Arrays.fill(cur, 0L);
			for(int j = 0;j < 3;j++){
//				for(int k = 0, l = j*10%3;k <= 9;k++,l++){
				for(int k = 0, l = j;k <= 9;k++,l++){
					if(l == 3)l = 0;
					if(k == 3){
						curaho += pre[j];
						if(curaho >= mod)curaho -= mod;
					}else{
						cur[l] += pre[j];
						if(cur[l] >= mod)cur[l] -= mod;
					}
				}
			}
			
			if(sedge == 0){
				for(int k = 0, l = medge;k < a[i]-'0';k++,l++){
					if(l == 3)l = 0;
					if(k == 3){
						curaho += 1;
						if(curaho >= mod)curaho -= mod;
					}else{
						cur[l] += 1;
						if(cur[l] >= mod)cur[l] -= mod;
					}
				}
			}else{
				curaho += a[i]-'0';
				if(curaho >= mod)curaho -= mod;
			}
			
//			medge = (medge * 10 + (a[i]-'0')) % 3;
			medge = (medge + (a[i]-'0')) % 3;
			if(a[i] == '3')sedge = 1;
			
			{long dum = preaho; preaho = curaho; curaho = dum;}
			{long[] dum = pre; pre = cur; cur = dum; }
//			tr(a[i], pre, preaho);
		}
		
		// not on edge
		int D = P*125;
		long ret = 0;
		
		{
			int[] co = new int[7];
			int n3 = 0;
			for(int i = 0, j = 0, k = 0;i < D;i++,j++,k++){
				if(j == P)j = 0;
				if(k == 3)k = 0;
				if(j != 0){
					if(n3 > 0){
						ret += pre[0]+pre[1]+pre[2]+preaho;
					}else{
						ret += pre[(3-k)%3]+preaho;
					}
				}
				for(int u = 0;u < 7;u++){
					if(co[u] == 3)n3--;
					co[u]++;
					if(co[u] == 3)n3++;
					if(co[u] == 10){
						co[u] = 0;
					}else{
						break;
					}
				}
			}
		}
		
		// on edge
		{
			int[] co = new int[7];
			int E = 0;
			int n3 = 0;
			for(int i = q;i < n;i++)E = E * 10 + a[i]-'0';
			for(int i = 0, j = 0, k = 0;i <= E;i++,j++,k++){
				if(j == P)j = 0;
				if(k == 3)k = 0;
				if(j != 0){
					if(sedge == 1){
						ret += 1;
					}else if(n3 > 0){
						ret += 1;
					}else if((medge+k) % 3 == 0){
						ret += 1;
					}
				}
				for(int u = 0;u < 7;u++){
					if(co[u] == 3)n3--;
					co[u]++;
					if(co[u] == 3)n3++;
					if(co[u] == 10){
						co[u] = 0;
					}else{
						break;
					}
				}
			}
		}
		return ret%mod;
	}
	
	public static char[] minus1(char[] a)
	{
		if(a.length == 1 && a[0] == '0')throw new RuntimeException();
		for(int i = a.length-1;i >= 0;i--){
			if(--a[i] < '0'){
				a[i] = '9';
			}else{
				break;
			}
		}
		if(a[0] == '0'){
			return Arrays.copyOfRange(a, 1, a.length);
		}else{
			return a;
		}
	}

	
	void run() throws Exception
	{
//		int n = 200000, m = 99999;
//		Random gen = new Random();
//		StringBuilder sb = new StringBuilder();
//		sb.append(0);
//		for (int i = 0; i < n-1; i++) {
//			sb.append(gen.nextInt(10));
//		}
//		sb.append(" ");
//		for (int i = 0; i < n; i++) {
//			sb.append(gen.nextInt(10));
//		}
//		sb.append(" ");
//		sb.append("800");
//		INPUT = sb.toString();
		
		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");
	}
	
	public static void main(String[] args) throws Exception { new Q766_2().run(); }
	
	private byte[] inbuf = new byte[1024];
	private 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 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 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();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0