結果
問題 | No.1329 Square Sqsq |
ユーザー | shojin_pro |
提出日時 | 2021-01-08 21:43:16 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 70 ms / 2,000 ms |
コード長 | 3,060 bytes |
コンパイル時間 | 2,944 ms |
コンパイル使用メモリ | 75,776 KB |
実行使用メモリ | 50,760 KB |
最終ジャッジ日時 | 2023-08-10 09:08:54 |
合計ジャッジ時間 | 5,372 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 45 ms
49,616 KB |
testcase_01 | AC | 43 ms
49,888 KB |
testcase_02 | AC | 44 ms
49,420 KB |
testcase_03 | AC | 63 ms
50,588 KB |
testcase_04 | AC | 66 ms
50,520 KB |
testcase_05 | AC | 66 ms
50,760 KB |
testcase_06 | AC | 65 ms
48,592 KB |
testcase_07 | AC | 65 ms
50,456 KB |
testcase_08 | AC | 70 ms
50,492 KB |
testcase_09 | AC | 65 ms
50,516 KB |
testcase_10 | AC | 65 ms
50,608 KB |
testcase_11 | AC | 68 ms
50,448 KB |
testcase_12 | AC | 66 ms
50,500 KB |
testcase_13 | AC | 65 ms
50,564 KB |
testcase_14 | AC | 54 ms
50,556 KB |
testcase_15 | AC | 45 ms
49,780 KB |
testcase_16 | AC | 43 ms
49,500 KB |
testcase_17 | AC | 51 ms
49,648 KB |
testcase_18 | AC | 52 ms
49,120 KB |
testcase_19 | AC | 53 ms
49,872 KB |
testcase_20 | AC | 47 ms
48,060 KB |
testcase_21 | AC | 50 ms
49,524 KB |
testcase_22 | AC | 67 ms
50,452 KB |
testcase_23 | AC | 53 ms
49,660 KB |
ソースコード
import java.util.*; import java.io.*; public class Main { static FastScanner sc = new FastScanner(System.in); static PrintWriter pw = new PrintWriter(System.out); public static void main(String[] args) throws Exception { String s = sc.next(); int len = s.length(); pw.println((len+1)/2); pw.flush(); } static class GeekInteger { public static void save_sort(int[] array) { shuffle(array); Arrays.sort(array); } public static int[] shuffle(int[] array) { int n = array.length; Random random = new Random(); for (int i = 0, j; i < n; i++) { j = i + random.nextInt(n - i); int randomElement = array[j]; array[j] = array[i]; array[i] = randomElement; } return array; } public static void save_sort(long[] array) { shuffle(array); Arrays.sort(array); } public static long[] shuffle(long[] array) { int n = array.length; Random random = new Random(); for (int i = 0, j; i < n; i++) { j = i + random.nextInt(n - i); long randomElement = array[j]; array[j] = array[i]; array[i] = randomElement; } return array; } } } class FastScanner { private BufferedReader reader = null; private StringTokenizer tokenizer = null; public FastScanner(InputStream in) { reader = new BufferedReader(new InputStreamReader(in)); tokenizer = null; } public String next() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } public String nextLine() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { return reader.readLine(); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken("\n"); } public long nextLong() { return Long.parseLong(next()); } public int nextInt() { return Integer.parseInt(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String[] nextArray(int n) { String[] a = new String[n]; for (int i = 0; i < n; i++) a[i] = next(); return a; } public int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } public long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } }