結果

問題 No.1992 Tendon Walk
ユーザー 37zigen
提出日時 2022-07-01 21:48:32
言語 Java
(openjdk 23)
結果
AC  
実行時間 55 ms / 2,000 ms
コード長 3,197 bytes
コンパイル時間 3,564 ms
コンパイル使用メモリ 78,560 KB
実行使用メモリ 37,084 KB
最終ジャッジ日時 2024-11-26 04:40:07
合計ジャッジ時間 3,884 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 6
権限があれば一括ダウンロードができます

ソースコード

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

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.Random;
import java.util.Scanner;
public class Main{
    
    
        public static void main(String[] args) {
            new Main().run();
        }
        
        void A(int[] state, int[] d) {
            state[0] += 2;
            state[1] += 2;
            if (state[0]>=1&&state[0]<d.length) {
                d[state[0]]=Math.min(d[state[0]], state[1]);
            }
        }
        
        void B(int[] state, int[] d) {
            state[0] -= 1;
            state[1] += 1;
            if (state[0]>=1&&state[0]<d.length) {
                d[state[0]]=Math.min(d[state[0]], state[1]);
            }
        }
        
        void run() {
            FastScanner sc=new FastScanner();
            PrintWriter pw=new PrintWriter(System.out);
            int X=sc.nextInt();
            int[] ans=new int[10000];
            int INF=Integer.MAX_VALUE;
            Arrays.fill(ans, INF);
            int[] state=new int[] {0, 0};
            for (int i=0;i<100;++i) {
                A(state, ans);
                A(state, ans);
                B(state, ans);
                B(state, ans);
                A(state, ans);
                B(state, ans);
                B(state, ans);
            }
            System.out.println(ans[X]);
            pw.close();
        }
        
        void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));}   
    }
    
    class FastScanner {
        private final InputStream in = System.in;
        private final byte[] buffer = new byte[1024];
        private int ptr = 0;
        private int buflen = 0;
        private boolean hasNextByte() {
            if (ptr < buflen) {
                return true;
            }else{
                ptr = 0;
                try {
                    buflen = in.read(buffer);
                } catch (IOException e) {
                    e.printStackTrace();
                }
                if (buflen <= 0) {
                    return false;
                }
            }
            return true;
        }
        private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
        private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
        private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
        public boolean hasNext() { skipUnprintable(); return hasNextByte();}
        public String next() {
            if (!hasNext()) throw new NoSuchElementException();
            StringBuilder sb = new StringBuilder();
            int b = readByte();
            while(isPrintableChar(b)) {
                sb.appendCodePoint(b);
                b = readByte();
            }
            return sb.toString();
        }
        public long nextLong() {
            if (!hasNext()) throw new NoSuchElementException();
            long n = 0;
            boolean minus = false;
            int b = readByte();
            if (b == '-') {
                minus = true;
                b = readByte();
            }
            if (b < '0' || '9' < b) {
                throw new NumberFormatException();
            }
            while(true){
                if ('0' <= b && b <= '9') {
                    n *= 10;
                    n += b - '0';
                }else if(b == -1 || !isPrintableChar(b)){
                    return minus ? -n : n;
                }else{
                    throw new NumberFormatException();
                }
                b = readByte();
            }
        }
        public int nextInt() {
            return (int)nextLong();
        }
    }
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0