結果
問題 | No.265 数学のテスト |
ユーザー | uafr_cs |
提出日時 | 2017-11-03 20:18:14 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 657 ms / 2,000 ms |
コード長 | 2,508 bytes |
コンパイル時間 | 5,180 ms |
コンパイル使用メモリ | 76,284 KB |
実行使用メモリ | 47,264 KB |
最終ジャッジ日時 | 2023-08-14 16:45:37 |
合計ジャッジ時間 | 12,699 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 657 ms
41,960 KB |
testcase_01 | AC | 555 ms
43,348 KB |
testcase_02 | AC | 184 ms
42,756 KB |
testcase_03 | AC | 187 ms
47,264 KB |
testcase_04 | AC | 186 ms
45,548 KB |
testcase_05 | AC | 180 ms
42,968 KB |
testcase_06 | AC | 223 ms
46,036 KB |
testcase_07 | AC | 188 ms
44,796 KB |
testcase_08 | AC | 183 ms
42,532 KB |
testcase_09 | AC | 183 ms
45,176 KB |
testcase_10 | AC | 182 ms
45,400 KB |
testcase_11 | AC | 173 ms
42,972 KB |
testcase_12 | AC | 122 ms
40,940 KB |
testcase_13 | AC | 162 ms
44,700 KB |
testcase_14 | AC | 162 ms
44,056 KB |
testcase_15 | AC | 126 ms
40,444 KB |
testcase_16 | AC | 121 ms
40,400 KB |
testcase_17 | AC | 121 ms
40,732 KB |
testcase_18 | AC | 122 ms
40,760 KB |
testcase_19 | AC | 122 ms
40,684 KB |
testcase_20 | AC | 132 ms
40,920 KB |
testcase_21 | AC | 122 ms
40,404 KB |
testcase_22 | AC | 161 ms
44,120 KB |
testcase_23 | AC | 121 ms
40,832 KB |
testcase_24 | AC | 120 ms
40,428 KB |
testcase_25 | AC | 174 ms
44,336 KB |
testcase_26 | AC | 119 ms
40,520 KB |
testcase_27 | AC | 106 ms
40,264 KB |
testcase_28 | AC | 128 ms
40,828 KB |
testcase_29 | AC | 122 ms
40,592 KB |
testcase_30 | AC | 112 ms
40,484 KB |
testcase_31 | AC | 120 ms
41,080 KB |
testcase_32 | AC | 121 ms
40,412 KB |
testcase_33 | AC | 121 ms
40,992 KB |
testcase_34 | AC | 122 ms
40,668 KB |
testcase_35 | AC | 125 ms
40,848 KB |
ソースコード
import java.util.Arrays; import java.util.LinkedList; import java.util.Scanner; public class Main { public static long[] make_x(int D, int deg, int a){ long[] ret = new long[D]; ret[deg] = a; return ret; } public static long[] diff(int D, long[] term){ long[] ret = new long[D]; for(int i = 1; i < D; i++){ ret[i - 1] = i * term[i]; } return ret; } public static long[] add(int D, long[] term1, long[] term2){ long[] ret = new long[D]; for(int i = 0; i < D; i++){ ret[i] = term1[i] + term2[i]; } return ret; } public static long[] parse(int D, char[] chs, int start, int last){ //System.out.println(start + " " + last + " : " + chs[start]); if(chs[start] == 'd'){ // d{ ___ } を評価する int kakko_lv = 0, kakko_start = -1, kakko_last = -1; for(int pos = start + 1; pos <= last; pos++){ if(chs[pos] == '{'){ if(kakko_lv == 0){ kakko_start = pos; } kakko_lv += 1; }else if(chs[pos] == '}'){ kakko_lv -= 1; if(kakko_lv == 0){ kakko_last = pos; break; } } } //System.out.println(kakko_start + " " + kakko_last); long[] curr_x = diff(D, parse(D, chs, kakko_start + 1, kakko_last - 1)); //System.out.println(Arrays.toString(curr_x)); if(kakko_last == last){ return curr_x; }else{ return add(D, curr_x, parse(D, chs, kakko_last + 2, last)); } }else if(chs[start] == 'x' || Character.isDigit(chs[start])){ int x_count = 0; int a_count = 1; if(chs[start] == 'x'){ x_count++; }else{ a_count = Character.getNumericValue(chs[start]); } int plus_begin = -1; for(int pos = start + 1; pos <= last; pos++){ if(chs[pos] == '+'){ plus_begin = pos; break; }else if(chs[pos] == 'x'){ x_count++; }else if(Character.isDigit(chs[pos])){ a_count *= Character.getNumericValue(chs[pos]); } } final long[] curr_x = make_x(D, x_count, a_count); //System.out.println("x : " + Arrays.toString(curr_x)); if(plus_begin < 0){ return curr_x; }else{ return add(D, curr_x, parse(D, chs, plus_begin + 1, last)); } } return null; } 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[] ret = parse(D + 1, chs, 0, N - 1); for(int i = 0; i <= D; i++){ System.out.print((i == 0 ? "" : " ") + ret[i]); } System.out.println(); } }