結果
問題 | No.1021 Children in Classrooms |
ユーザー | hiromi_ayase |
提出日時 | 2020-04-10 21:50:59 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 517 ms / 2,000 ms |
コード長 | 2,869 bytes |
コンパイル時間 | 2,726 ms |
コンパイル使用メモリ | 84,388 KB |
実行使用メモリ | 64,372 KB |
最終ジャッジ日時 | 2023-10-14 00:20:17 |
合計ジャッジ時間 | 10,429 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 88 ms
52,980 KB |
testcase_01 | AC | 92 ms
52,596 KB |
testcase_02 | AC | 89 ms
52,632 KB |
testcase_03 | AC | 118 ms
54,236 KB |
testcase_04 | AC | 114 ms
53,292 KB |
testcase_05 | AC | 112 ms
52,948 KB |
testcase_06 | AC | 113 ms
53,372 KB |
testcase_07 | AC | 115 ms
52,972 KB |
testcase_08 | AC | 115 ms
53,156 KB |
testcase_09 | AC | 506 ms
60,820 KB |
testcase_10 | AC | 510 ms
61,364 KB |
testcase_11 | AC | 506 ms
61,336 KB |
testcase_12 | AC | 497 ms
60,988 KB |
testcase_13 | AC | 475 ms
60,204 KB |
testcase_14 | AC | 517 ms
60,940 KB |
testcase_15 | AC | 432 ms
62,524 KB |
testcase_16 | AC | 408 ms
61,496 KB |
testcase_17 | AC | 453 ms
63,284 KB |
testcase_18 | AC | 468 ms
64,372 KB |
testcase_19 | AC | 186 ms
60,500 KB |
ソースコード
public class Main { private static void solve() { int n = ni(); int m = ni(); int[] a = new int[n + m * 2]; for (int i = 0; i < n; i++) { a[i + m] = ni(); } char[] s = ns(); int p = m; for (char c : s) { if (c == 'L') { a[p + 1] += a[p]; a[p] = 0; p++; } else { a[p + n - 2] += a[p + n - 1]; a[p + n - 1] = 0; p--; } } for (int i = p; i < p + n; i++) { out.print(a[i] + " "); } out.println(); } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = args.length > 0 ? args[0] : null; if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } private static java.io.InputStream is = System.in; private static java.io.PrintWriter out = new java.io.PrintWriter(System.out); private static java.util.StringTokenizer tokenizer = null; private static java.io.BufferedReader reader; public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } 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 char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } private static void tr(Object... o) { if (is != System.in) System.out.println(java.util.Arrays.deepToString(o)); } }