結果
問題 | No.437 cwwゲーム |
ユーザー | yuya178 |
提出日時 | 2017-11-21 16:08:55 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,809 bytes |
コンパイル時間 | 2,630 ms |
コンパイル使用メモリ | 82,884 KB |
実行使用メモリ | 50,112 KB |
最終ジャッジ日時 | 2024-05-04 18:31:44 |
合計ジャッジ時間 | 6,413 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 53 ms
36,752 KB |
testcase_01 | AC | 54 ms
36,956 KB |
testcase_02 | AC | 52 ms
36,728 KB |
testcase_03 | AC | 53 ms
36,772 KB |
testcase_04 | AC | 52 ms
37,052 KB |
testcase_05 | AC | 53 ms
36,968 KB |
testcase_06 | AC | 56 ms
36,964 KB |
testcase_07 | AC | 59 ms
37,004 KB |
testcase_08 | AC | 55 ms
36,544 KB |
testcase_09 | AC | 56 ms
37,060 KB |
testcase_10 | AC | 56 ms
37,068 KB |
testcase_11 | AC | 52 ms
36,764 KB |
testcase_12 | AC | 52 ms
36,764 KB |
testcase_13 | AC | 52 ms
36,492 KB |
testcase_14 | AC | 53 ms
36,832 KB |
testcase_15 | AC | 57 ms
36,872 KB |
testcase_16 | AC | 55 ms
37,048 KB |
testcase_17 | AC | 52 ms
36,992 KB |
testcase_18 | AC | 51 ms
36,492 KB |
testcase_19 | WA | - |
testcase_20 | AC | 52 ms
36,744 KB |
testcase_21 | AC | 53 ms
37,052 KB |
testcase_22 | AC | 55 ms
37,072 KB |
testcase_23 | AC | 52 ms
36,948 KB |
testcase_24 | AC | 52 ms
36,668 KB |
testcase_25 | AC | 52 ms
37,056 KB |
testcase_26 | AC | 53 ms
36,756 KB |
testcase_27 | AC | 51 ms
36,492 KB |
testcase_28 | AC | 50 ms
36,524 KB |
testcase_29 | AC | 51 ms
37,064 KB |
testcase_30 | AC | 53 ms
37,000 KB |
testcase_31 | AC | 53 ms
36,676 KB |
testcase_32 | AC | 52 ms
36,844 KB |
testcase_33 | AC | 53 ms
36,924 KB |
testcase_34 | AC | 52 ms
37,028 KB |
testcase_35 | AC | 52 ms
36,632 KB |
testcase_36 | AC | 51 ms
37,072 KB |
testcase_37 | AC | 52 ms
36,492 KB |
testcase_38 | AC | 54 ms
36,944 KB |
testcase_39 | AC | 54 ms
37,028 KB |
testcase_40 | AC | 55 ms
36,944 KB |
testcase_41 | AC | 55 ms
36,924 KB |
testcase_42 | AC | 51 ms
36,756 KB |
testcase_43 | AC | 52 ms
37,072 KB |
ソースコード
import java.io.*; import java.util.*; import java.math.*; import java.awt.Point; public class Main { InputStream is; PrintWriter out; String INPUT = ""; long MOD = 1_000_000_007; int inf = 10000000; void solve() { char[] c = ns().toCharArray(); int n = c.length; int[] a = new int[n]; for(int i = 0; i < n; i++){ a[i] = c[i] - '0'; } out.println(f(a)); } int f(int[] a){ int n = a.length; if(n<3) return 0; if(n==3){ if(a[0]!=a[1] && a[1]==a[2]){ return a[0]*100+a[1]*10+a[2]; } else return 0; } int[] b = new int[n-3]; int maxsum = 0; int sum = 0; for(int i = 0; i < n-2; i++){ for(int j = i+1; j < n-1; j++){ for(int k = j+1; k < n; k++){ if(a[i]!=a[j] && a[j]==a[k]){ int t = 0; for(int m = 0; m < n; m++){ if(m==i||m==j||m==k) continue; b[t] = a[m]; t++; } sum = a[i]*100+a[j]*10+a[k]+f(b); if(sum > maxsum){ maxsum = sum; } } } } } return maxsum; } 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"); } public static void main(String[] args) throws Exception { new Main().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) && 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 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[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private 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 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)); } static class ArrayUtils { public static void fill(double[][] array, double value) { for (double[] a : array) Arrays.fill(a, value); } public static void fill(double[][][] array, double value) { for (double[][] l : array) fill(l, value); } } }