結果

問題 No.265 数学のテスト
ユーザー uwiuwi
提出日時 2015-08-07 23:24:56
言語 Java21
(openjdk 21)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 3,655 bytes
コンパイル時間 6,224 ms
コンパイル使用メモリ 83,728 KB
実行使用メモリ 55,732 KB
最終ジャッジ日時 2024-07-18 05:23:51
合計ジャッジ時間 7,222 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 105 ms
55,732 KB
testcase_01 AC 108 ms
55,536 KB
testcase_02 AC 94 ms
51,512 KB
testcase_03 AC 94 ms
51,452 KB
testcase_04 AC 96 ms
51,680 KB
testcase_05 AC 94 ms
51,496 KB
testcase_06 AC 92 ms
51,300 KB
testcase_07 AC 87 ms
51,428 KB
testcase_08 AC 92 ms
51,416 KB
testcase_09 AC 92 ms
51,176 KB
testcase_10 AC 87 ms
51,284 KB
testcase_11 AC 92 ms
51,440 KB
testcase_12 AC 62 ms
50,896 KB
testcase_13 AC 74 ms
50,776 KB
testcase_14 AC 70 ms
51,048 KB
testcase_15 AC 64 ms
50,880 KB
testcase_16 AC 70 ms
51,112 KB
testcase_17 WA -
testcase_18 AC 61 ms
50,884 KB
testcase_19 AC 63 ms
50,868 KB
testcase_20 AC 70 ms
51,032 KB
testcase_21 AC 62 ms
51,048 KB
testcase_22 AC 75 ms
50,908 KB
testcase_23 AC 63 ms
50,992 KB
testcase_24 AC 62 ms
50,648 KB
testcase_25 AC 80 ms
50,856 KB
testcase_26 AC 64 ms
50,872 KB
testcase_27 AC 71 ms
50,764 KB
testcase_28 AC 65 ms
50,868 KB
testcase_29 AC 62 ms
50,872 KB
testcase_30 AC 67 ms
51,028 KB
testcase_31 AC 64 ms
50,868 KB
testcase_32 AC 64 ms
51,140 KB
testcase_33 AC 62 ms
51,020 KB
testcase_34 AC 61 ms
50,580 KB
testcase_35 AC 62 ms
50,928 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Q605 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	int pos = 0;
	char[] s;
	int D;
	
	void solve()
	{
		int n = ni();
		D = ni();
		s = ns().toCharArray();
		long[] res = expr();
		for(int i = 0;i <= D;i++){
			out.print(res[i] + " ");
		}
		out.println();
	}
	
	long[] expr() {
		long[] ret = item();
		while(pos < s.length && s[pos] == '+'){
			pos++;
			long[] res = item();
			for(int i = 0;i < res.length;i++){
				ret[i] += res[i];
			}
		}
		return ret;
	}
	
	long[] item() {
		if(s[pos] == 'd'){
			pos++; pos++;
			long[] f = expr();
			for(int i = 1;i < f.length;i++){
				f[i-1] = f[i] * i;
				f[i] = 0;
			}
			pos++; // }
			return f;
		}else{
			int e = 0;
			long c = 1;
			while(true){
				if(s[pos] == 'x'){
					e++;
					pos++;
				}else{
					c *= s[pos]-'0';
					pos++;
				}
				if(pos >= s.length || s[pos] == '}' || s[pos] == '+')break;
				pos++;
			}
			long[] ret = new long[D+1];
			ret[e] = c;
			return ret;
		}
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
	}
	
	public static void main(String[] args) throws Exception { new Q605().run(); }
	
	private byte[] inbuf = new byte[1024];
	private int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0