結果
問題 | No.102 トランプを奪え |
ユーザー | uwi |
提出日時 | 2014-12-15 04:15:22 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 334 ms / 5,000 ms |
コード長 | 4,848 bytes |
コンパイル時間 | 2,167 ms |
コンパイル使用メモリ | 80,848 KB |
実行使用メモリ | 68,044 KB |
最終ジャッジ日時 | 2024-06-11 21:23:50 |
合計ジャッジ時間 | 4,141 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 72 ms
51,156 KB |
testcase_01 | AC | 63 ms
51,424 KB |
testcase_02 | AC | 78 ms
51,704 KB |
testcase_03 | AC | 72 ms
51,032 KB |
testcase_04 | AC | 63 ms
51,060 KB |
testcase_05 | AC | 114 ms
54,016 KB |
testcase_06 | AC | 116 ms
54,124 KB |
testcase_07 | AC | 78 ms
51,708 KB |
testcase_08 | AC | 121 ms
54,508 KB |
testcase_09 | AC | 334 ms
68,044 KB |
testcase_10 | AC | 292 ms
67,464 KB |
ソースコード
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 Main { static InputStream is; static PrintWriter out; static String INPUT = ""; static void solve() { int a = ni(), b = ni(), c = ni(), d = ni(); int s = a+b+c+d; int[][][][][] win = new int[a+1][b+1][c+1][d+1][s+1]; for(int i = 0;i <= a;i++){ for(int j = 0;j <= b;j++){ for(int k = 0;k <= c;k++){ for(int l = 0;l <= d;l++){ for(int m = 0;m+i+j+k+l <= s;m++){ int t = s-i-j-k-l-m; if(i == 0 && j == 0 && k == 0 && l == 0){ win[i][j][k][l][m] = m > t ? 1 : m < t ? -1 : 0; }else{ int val = -1; for(int u = 1;u <= 3 && i-u >= 0;u++){ if(i-u > 0){ if(win[i-u][j][k][l][t] == -1)val = 1; }else{ if(win[i-u][j][k][l][t/2] == -1)val = 1; } } for(int u = 1;u <= 3 && j-u >= 0;u++){ if(j-u > 0){ if(win[i][j-u][k][l][t] == -1)val = 1; }else{ if(win[i][j-u][k][l][t/2] == -1)val = 1; } } for(int u = 1;u <= 3 && k-u >= 0;u++){ if(k-u > 0){ if(win[i][j][k-u][l][t] == -1)val = 1; }else{ if(win[i][j][k-u][l][t/2] == -1)val = 1; } } for(int u = 1;u <= 3 && l-u >= 0;u++){ if(l-u > 0){ if(win[i][j][k][l-u][t] == -1)val = 1; }else{ if(win[i][j][k][l-u][t/2] == -1)val = 1; } } win[i][j][k][l][m] = val; } } } } } } out.println(win[a][b][c][d][0] == 1 ? "Taro" : "Jiro"); } public static void main(String[] args) throws Exception { long S = System.currentTimeMillis(); is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); solve(); out.flush(); long G = System.currentTimeMillis(); tr(G-S+"ms"); } private static boolean eof() { if(lenbuf == -1)return true; int lptr = ptrbuf; while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false; try { is.mark(1000); while(true){ int b = is.read(); if(b == -1){ is.reset(); return true; }else if(!isSpaceChar(b)){ is.reset(); return false; } } } catch (IOException e) { return true; } } private static byte[] inbuf = new byte[1024]; static int lenbuf = 0, ptrbuf = 0; private static 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 static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private static double nd() { return Double.parseDouble(ns()); } private static char nc() { return (char)skip(); } private static 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 static 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 static 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 static int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private static 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 static 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) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); } }