結果
問題 | No.265 数学のテスト |
ユーザー | uafr_cs |
提出日時 | 2017-11-03 20:52:15 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 209 ms / 2,000 ms |
コード長 | 1,583 bytes |
コンパイル時間 | 3,247 ms |
コンパイル使用メモリ | 78,136 KB |
実行使用メモリ | 59,132 KB |
最終ジャッジ日時 | 2023-08-16 02:12:34 |
合計ジャッジ時間 | 10,655 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 194 ms
58,076 KB |
testcase_01 | AC | 197 ms
57,472 KB |
testcase_02 | AC | 200 ms
56,920 KB |
testcase_03 | AC | 175 ms
57,264 KB |
testcase_04 | AC | 173 ms
57,028 KB |
testcase_05 | AC | 184 ms
57,044 KB |
testcase_06 | AC | 171 ms
59,132 KB |
testcase_07 | AC | 188 ms
57,404 KB |
testcase_08 | AC | 209 ms
57,660 KB |
testcase_09 | AC | 172 ms
56,992 KB |
testcase_10 | AC | 181 ms
56,916 KB |
testcase_11 | AC | 186 ms
57,172 KB |
testcase_12 | AC | 150 ms
56,836 KB |
testcase_13 | AC | 166 ms
54,800 KB |
testcase_14 | AC | 160 ms
56,588 KB |
testcase_15 | AC | 151 ms
57,076 KB |
testcase_16 | AC | 161 ms
56,988 KB |
testcase_17 | AC | 146 ms
56,556 KB |
testcase_18 | AC | 152 ms
56,988 KB |
testcase_19 | AC | 153 ms
56,928 KB |
testcase_20 | AC | 147 ms
57,088 KB |
testcase_21 | AC | 154 ms
56,796 KB |
testcase_22 | AC | 161 ms
56,852 KB |
testcase_23 | AC | 143 ms
56,520 KB |
testcase_24 | AC | 144 ms
56,504 KB |
testcase_25 | AC | 166 ms
56,944 KB |
testcase_26 | AC | 146 ms
57,112 KB |
testcase_27 | AC | 149 ms
57,196 KB |
testcase_28 | AC | 155 ms
56,948 KB |
testcase_29 | AC | 146 ms
59,104 KB |
testcase_30 | AC | 152 ms
57,128 KB |
testcase_31 | AC | 145 ms
57,096 KB |
testcase_32 | AC | 148 ms
56,592 KB |
testcase_33 | AC | 151 ms
56,988 KB |
testcase_34 | AC | 144 ms
56,612 KB |
testcase_35 | AC | 140 ms
56,924 KB |
ソースコード
import java.util.Arrays; import java.util.LinkedList; import java.util.Scanner; public class Main2 { public static long diff_count(int div, int x, long a){ final int act_x = x - div; long ret_a = a; for(int i = x; i > act_x; i--){ ret_a *= i; } return ret_a; } public static void main(String[] args) { Scanner sc = new Scanner(System.in); final int N = sc.nextInt(); final int D = sc.nextInt(); final char[] chs = sc.next().toCharArray(); long[] answer = new long[D + 1]; int div_level = 0; int x_count = 0; long a_count = 0; for(int i = 0; i < N; i++){ if(chs[i] == '{'){ div_level++; }else if(chs[i] == '}'){ final int act_x_count = x_count - div_level; if(act_x_count >= 0){ answer[act_x_count] += diff_count(div_level, x_count, a_count); } x_count = 0; a_count = 0; div_level--; }else if(chs[i] == '+'){ final int act_x_count = x_count - div_level; if(act_x_count >= 0){ answer[act_x_count] += diff_count(div_level, x_count, a_count); } x_count = 0; a_count = 0; }else if('1' <= chs[i] && chs[i] <= '9'){ if(a_count == 0){ a_count = 1; } a_count *= (chs[i] - '0'); }else if(chs[i] == 'x'){ x_count += 1; if(a_count == 0){ a_count = 1; } } } final int act_x_count = x_count - div_level; if(act_x_count >= 0){ answer[act_x_count] += diff_count(div_level, x_count, a_count); } for(int i = 0; i <= D; i++){ System.out.print((i == 0 ? "" : " ") + answer[i]); } System.out.println(); } }