結果
問題 | No.52 よくある文字列の問題 |
ユーザー | nCk_cv |
提出日時 | 2016-07-22 13:59:49 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 136 ms / 5,000 ms |
コード長 | 3,501 bytes |
コンパイル時間 | 2,267 ms |
コンパイル使用メモリ | 80,772 KB |
実行使用メモリ | 54,400 KB |
最終ジャッジ日時 | 2024-09-22 05:26:55 |
合計ジャッジ時間 | 4,328 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 124 ms
54,400 KB |
testcase_01 | AC | 127 ms
54,284 KB |
testcase_02 | AC | 136 ms
54,008 KB |
testcase_03 | AC | 124 ms
54,328 KB |
testcase_04 | AC | 136 ms
54,228 KB |
testcase_05 | AC | 136 ms
54,128 KB |
testcase_06 | AC | 135 ms
54,240 KB |
testcase_07 | AC | 133 ms
54,324 KB |
testcase_08 | AC | 126 ms
54,048 KB |
testcase_09 | AC | 124 ms
54,372 KB |
testcase_10 | AC | 124 ms
53,856 KB |
ソースコード
import java.awt.geom.Point2D; import java.io.*; import java.math.*; import java.util.*; import java.util.Map.*; class Main { static HashSet<String> set = new HashSet<>(); public static void main(String[] args) { //FastScanner sc = new FastScanner(); Scanner sc = new Scanner(System.in); String S = sc.next(); dfs(new StringBuffer(S),new StringBuffer()); System.out.println(set.size()); } static void dfs(StringBuffer S, StringBuffer N) { if(S.length() == 0) { set.add(N.toString()); return; } StringBuffer cpS = new StringBuffer(S); StringBuffer cpN = new StringBuffer(N); StringBuffer NXA = N.append(S.charAt(0)); StringBuffer SXA = S.delete(0, 1); dfs(SXA,NXA); S = cpS; N = cpN; NXA = N.append(S.charAt(S.length()-1)); SXA = S.delete(S.length()-1, S.length()); dfs(SXA,NXA); } static 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() { if (!hasNext()) throw new NoSuchElementException(); int 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(); } } } }