結果
問題 | No.1535 五七五 |
ユーザー | tenten |
提出日時 | 2023-02-20 18:33:17 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 306 ms / 2,000 ms |
コード長 | 2,612 bytes |
コンパイル時間 | 2,752 ms |
コンパイル使用メモリ | 94,328 KB |
実行使用メモリ | 64,888 KB |
最終ジャッジ日時 | 2024-07-21 10:02:50 |
合計ジャッジ時間 | 7,951 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
36,940 KB |
testcase_01 | AC | 43 ms
36,896 KB |
testcase_02 | AC | 42 ms
36,504 KB |
testcase_03 | AC | 44 ms
36,636 KB |
testcase_04 | AC | 252 ms
47,924 KB |
testcase_05 | AC | 306 ms
64,592 KB |
testcase_06 | AC | 284 ms
64,888 KB |
testcase_07 | AC | 46 ms
36,888 KB |
testcase_08 | AC | 44 ms
36,744 KB |
testcase_09 | AC | 44 ms
36,504 KB |
testcase_10 | AC | 44 ms
36,952 KB |
testcase_11 | AC | 44 ms
36,936 KB |
testcase_12 | AC | 45 ms
36,964 KB |
testcase_13 | AC | 43 ms
37,020 KB |
testcase_14 | AC | 44 ms
36,888 KB |
testcase_15 | AC | 46 ms
37,144 KB |
testcase_16 | AC | 47 ms
36,812 KB |
testcase_17 | AC | 44 ms
36,864 KB |
testcase_18 | AC | 286 ms
55,540 KB |
testcase_19 | AC | 290 ms
55,664 KB |
testcase_20 | AC | 295 ms
55,436 KB |
testcase_21 | AC | 280 ms
55,548 KB |
testcase_22 | AC | 294 ms
55,812 KB |
testcase_23 | AC | 301 ms
55,472 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.stream.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int a = sc.nextInt(); int b = a + sc.nextInt(); int c = b + sc.nextInt(); int[] sums = new int[n + 1]; for (int i = 1; i <= n; i++) { sums[i] = sums[i - 1] + sc.next().length(); } int aIdx = 0; int bIdx = 0; int cIdx = 0; int ans = 0; for (int i = 0; i < n; i++) { while (aIdx <= n && sums[aIdx] - sums[i] < a) { aIdx++; } if (aIdx > n) { break; } if (sums[aIdx] - sums[i] > a) { continue; } while (bIdx <= n && sums[bIdx] - sums[i] < b) { bIdx++; } if (bIdx > n) { break; } if (sums[bIdx] - sums[i] > b) { continue; } while (cIdx <= n && sums[cIdx] - sums[i] < c) { cIdx++; } if (cIdx > n) { break; } if (sums[cIdx] - sums[i] > c) { continue; } ans++; } System.out.println(ans); } } class Utilities { static String arrayToLineString(Object[] arr) { return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n")); } static String arrayToLineString(int[] arr) { return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new)); } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public int[] nextIntArray() throws Exception { return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray(); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }