結果

問題 No.319 happy b1rthday 2 me
ユーザー uwi
提出日時 2015-12-12 02:03:29
言語 Java
(openjdk 23)
結果
AC  
実行時間 53 ms / 2,000 ms
コード長 4,759 bytes
コンパイル時間 4,004 ms
コンパイル使用メモリ 88,136 KB
実行使用メモリ 37,120 KB
最終ジャッジ日時 2024-09-15 08:34:25
合計ジャッジ時間 6,639 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 29
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

package q8xx;
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 Q850 {
    InputStream is;
    PrintWriter out;
    String INPUT = "";
    
    void solve()
    {
        long a = nl(), b = nl();
        out.println(countInner(b) - countInner(a-1) + countOuter(b-1) - countOuter(a-1));
    }
    
    // contains 12
    long countInner(long n)
    {
        char[] s = Long.toString(n).toCharArray();
        int m = s.length;
        long[][] dp = new long[m+1][2];
        long ret = 0;
        int es = 0;
        int num = 0;
        for(int i = 0;i < m;i++){
            ret *= 10;
            for(int j = 0;j <= 9;j++){
                for(int k = 0;k < 2;k++){
                    if(f(k, j) == 2){
                        ret += dp[i][k];
                        dp[i+1][0] += dp[i][k];
                    }else{
                        dp[i+1][f(k,j)] += dp[i][k];
                    }
                }
            }
            
            for(int j = 0;j < s[i]-'0';j++){
                ret += num;
                if(f(es, j) == 2){
                    ret++;
                    dp[i+1][0]++;
                }else{
                    dp[i+1][f(es,j)]++;
                }
            }
            es = f(es, s[i]-'0');
            if(es == 2){
                num++;
                es = 0;
            }
        }
        ret += num;
        return ret;
    }
    
    int f(int pre, int cur)
    {
        if(pre == 0){
            if(cur == 1){
                return 1;
            }else{
                return 0;
            }
        }else if(pre == 1){
            if(cur == 1){
                return 1;
            }else if(cur == 2){
                return 2;
            }else{
                return 0;
            }
        }else if(pre == 2){
            return 2;
        }else{
            throw new RuntimeException();
        }
    }
    
    // 2...1 or 1
    long countOuter(long n)
    {
        char[] s = Long.toString(n).toCharArray();
        int m = s.length;
        long[] dp = new long[m+1];
        int es = 0;
        for(int i = 0;i < m;i++){
            if(i < m-1){
                dp[i+1] = dp[i] * 10;
                
                if(i == 0){
                    if(2 < s[i]-'0'){
                        dp[i+1]++;
                    }
                }else{
                    dp[i+1]++;
                    if(es == 1){
                        dp[i+1] += s[i]-'0';
                    }
                }
                if(i == 0 && s[i] == '2')es = 1;
            }else{
                dp[i+1] += dp[i];
                if(i == 0){
                    if(1 <= s[i]-'0'){
                        dp[i+1]++;
                    }
                }else{
                    dp[i+1]++;
                    if(es == 1 && 1 <= s[i]-'0'){
                        dp[i+1]++;
                    }
                }
            }
        }
        
        return dp[m];
    }
    
    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 Q850().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 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)); }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0