結果

問題 No.161 制限ジャンケン
ユーザー t8m8⛄️
提出日時 2015-03-08 14:42:27
言語 Java
(openjdk 23)
結果
AC  
実行時間 116 ms / 5,000 ms
コード長 4,048 bytes
コンパイル時間 3,841 ms
コンパイル使用メモリ 78,784 KB
実行使用メモリ 57,004 KB
最終ジャッジ日時 2024-11-30 04:29:23
合計ジャッジ時間 5,933 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 16
権限があれば一括ダウンロードができます

ソースコード

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

//No.161 制限ジャンケン
import java.util.*;
import java.io.*;
import static java.util.Arrays.*;
import static java.lang.Math.*;
public class No161 {
    static final InputStream in = System.in;
    static final PrintWriter out = new PrintWriter(System.out,false);
    static void solve(){
        int g = nextInt();
        int c = nextInt();
        int p = nextInt();
        s = next();
        n = s.length();
        dp = new int[g+1][c+1][p+1];
        out.println(rec(g,c,p,0));
    }
    static String s;
    static int n;
    static int[][][] dp;
    static int rec(int g, int c, int p, int i) {
        if (i == n) return 0;
        if (dp[g][c][p] != 0) return dp[g][c][p];
        char si = s.charAt(i);
        int ret = 0;
        if (g > 0) ret = max(ret,rec(g-1,c,p,i+1) + (si == 'C' ? 3 : (si == 'G' ? 1 : 0)));
        if (c > 0) ret = max(ret,rec(g,c-1,p,i+1) + (si == 'P' ? 3 : (si == 'C' ? 1 : 0)));
        if (p > 0) ret = max(ret,rec(g,c,p-1,i+1) + (si == 'G' ? 3 : (si == 'P' ? 1 : 0)));
        return dp[g][c][p] = ret;
    }
    public static void main(String[] args) throws Exception {
        long start = System.currentTimeMillis();
        solve();
        out.flush();
        long end = System.currentTimeMillis();
        //trace(end-start + "ms");
        in.close();
    }
    static void trace(Object... o) { System.out.println(deepToString(o));}
    static final byte[] buf = new byte[1024];
    static int ptr = 0;
    static int buflen = 0;
    static boolean hasNextByte() {
        if (ptr < buflen)
            return true;
        ptr = 0;
        try{
            buflen = in.read(buf);
        }catch (IOException e) {e.printStackTrace();}
        if (buflen <= 0)
            return false;
        return true;
    }
    static int readByte() { if (hasNextByte()) return buf[ptr++]; else return -1;}
    static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    static void skip() { while(hasNextByte() && !isPrintableChar(buf[ptr])) ptr++;}
    static boolean hasNext() {skip(); return hasNextByte();}
    static 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();
    }
    static long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        boolean minus = false;
        long num = readByte();
        if(num == '-'){
            num = 0;
            minus = true;
        }else if (num < '0' || '9' < num){
            throw new NumberFormatException();
        }else{
            num -= '0';
        }
        
        while(true){
            int b = readByte();
            if('0' <= b && b <= '9')
                num = num * 10 + (b - '0');
            else if(b == -1 || !isPrintableChar(b))
                return minus ? -num : num;
            else
                throw new NoSuchElementException();
        }
    }
    static int nextInt() {
        long num = nextLong();
        if (num < Integer.MIN_VALUE || Integer.MAX_VALUE < num)
            throw new NumberFormatException();
        return (int)num;
    }
    static double nextDouble() {
        return Double.parseDouble(next());
    }
    static char nextChar() {
        if (!hasNext()) throw new NoSuchElementException();
        return (char)readByte();
    }
    static String nextLine() {
        while (hasNextByte() && (buf[ptr] == '\n' || buf[ptr] == '\r')) ptr++;
        if (!hasNextByte()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (b != '\n' && b != '\r') {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    static int[] nextArrayInt(int n) {
        int[] a = new int[n];
        for (int i=0; i<n; i++) a[i] = nextInt();
        return a;
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0