結果
問題 | No.319 happy b1rthday 2 me |
ユーザー | holeguma |
提出日時 | 2015-12-13 00:52:43 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,016 bytes |
コンパイル時間 | 2,492 ms |
コンパイル使用メモリ | 78,988 KB |
実行使用メモリ | 37,136 KB |
最終ジャッジ日時 | 2024-09-15 10:57:18 |
合計ジャッジ時間 | 5,385 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 53 ms
36,656 KB |
testcase_01 | AC | 52 ms
36,548 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | AC | 52 ms
36,688 KB |
testcase_05 | AC | 53 ms
36,836 KB |
testcase_06 | AC | 53 ms
36,736 KB |
testcase_07 | AC | 53 ms
36,504 KB |
testcase_08 | AC | 54 ms
36,704 KB |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | AC | 54 ms
36,876 KB |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | AC | 54 ms
36,376 KB |
testcase_30 | WA | - |
testcase_31 | AC | 53 ms
36,680 KB |
testcase_32 | WA | - |
ソースコード
import java.io.InputStream; import java.io.IOException; import java.io.PrintWriter; import java.util.ArrayList; import java.util.Arrays; import java.util.Comparator; import java.util.InputMismatchException; import java.util.NoSuchElementException; import java.math.BigInteger; public class Main{ static PrintWriter out; static InputReader ir; static void solve(){ char[] a=minusOne(ir.next().toCharArray()); char[] b=ir.next().toCharArray(); out.println(calc(b)-calc(a)-((a[a.length-1]=='1'&&(a.length==1||a[0]=='2'))?1:0)); } public static long calc(char[] s){ long ret=0; long[][][][][] dp=new long[2][2][2][2][2]; dp[0][0][0][0][0]=1; for(int i=0;i<s.length;i++){ int now=i%2,next=now^1,num=s[i]-'0'; for(int j=0;j<2;j++){ for(int ft=0;ft<2;ft++){ for(int fi=0;fi<2;fi++){ for(int po=0;po<2;po++){ for(int k=0;k<=(j==0?num:9);k++){ int next_j=j|((k==num)?0:1),next_ft=ft|((fi==0&&k==2)?1:0),next_fi=fi|((k==0)?0:1),next_po=((k==1)?1:0); if(po==1&&k==2) ret+=dp[now][j][ft][fi][po]; dp[next][next_j][next_ft][next_fi][next_po]+=dp[now][j][ft][fi][po]; } } } } } for(int j=0;j<2;j++){ for(int k=0;k<2;k++){ for(int l=0;l<2;l++){ Arrays.fill(dp[now][j][k][l],0); } } } } ret+=dp[s.length%2][0][1][1][1]; if(s.length>=2||s[0]>='2') ret++; return ret; } public static char[] minusOne(char[] s){ char[] ret=new char[s.length]; boolean f=false; for(int i=s.length-1;i>=0;i--){ if(!f){ if(s[i]!='0'){ ret[i]=(char)(s[i]-1); f=true; } else ret[i]='9'; } else ret[i]=s[i]; } return ret; } public static void main(String[] args) throws Exception{ ir=new InputReader(System.in); out=new PrintWriter(System.out); solve(); out.flush(); } static class InputReader { private InputStream in; private byte[] buffer=new byte[1024]; private int curbuf; private int lenbuf; public InputReader(InputStream in) {this.in=in; this.curbuf=this.lenbuf=0;} public boolean hasNextByte() { if(curbuf>=lenbuf){ curbuf= 0; try{ lenbuf=in.read(buffer); }catch(IOException e) { throw new InputMismatchException(); } if(lenbuf<=0) return false; } return true; } private int readByte(){if(hasNextByte()) return buffer[curbuf++]; else return -1;} private boolean isSpaceChar(int c){return !(c>=33&&c<=126);} private void skip(){while(hasNextByte()&&isSpaceChar(buffer[curbuf])) curbuf++;} public boolean hasNext(){skip(); return hasNextByte();} public String next(){ if(!hasNext()) throw new NoSuchElementException(); StringBuilder sb=new StringBuilder(); int b=readByte(); while(!isSpaceChar(b)){ sb.appendCodePoint(b); b=readByte(); } return sb.toString(); } public int nextInt() { if(!hasNext()) throw new NoSuchElementException(); int c=readByte(); while (isSpaceChar(c)) c=readByte(); boolean minus=false; if (c=='-') { minus=true; c=readByte(); } int res=0; do{ if(c<'0'||c>'9') throw new InputMismatchException(); res=res*10+c-'0'; c=readByte(); }while(!isSpaceChar(c)); return (minus)?-res:res; } public long nextLong() { if(!hasNext()) throw new NoSuchElementException(); int c=readByte(); while (isSpaceChar(c)) c=readByte(); boolean minus=false; if (c=='-') { minus=true; c=readByte(); } long res = 0; do{ if(c<'0'||c>'9') throw new InputMismatchException(); res=res*10+c-'0'; c=readByte(); }while(!isSpaceChar(c)); return (minus)?-res:res; } public double nextDouble(){return Double.parseDouble(next());} public BigInteger nextBigInteger(){return new BigInteger(next());} public int[] nextIntArray(int n){ int[] a=new int[n]; for(int i=0;i<n;i++) a[i]=nextInt(); return a; } public long[] nextLongArray(int n){ long[] a=new long[n]; for(int i=0;i<n;i++) a[i]=nextLong(); return a; } public char[][] nextCharMap(int n,int m){ char[][] map=new char[n][m]; for(int i=0;i<n;i++) map[i]=next().toCharArray(); return map; } } }