結果

問題 No.708 （＋ー）の式
ユーザー uwiuwi
提出日時 2018-06-29 22:25:32
言語 Java21
(openjdk 21)
結果
AC  
実行時間 53 ms / 2,000 ms
コード長 4,891 bytes
コンパイル時間 3,596 ms
コンパイル使用メモリ 83,496 KB
実行使用メモリ 50,448 KB
最終ジャッジ日時 2024-06-30 23:56:16
合計ジャッジ時間 5,019 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
50,028 KB
testcase_01 AC 52 ms
50,352 KB
testcase_02 AC 53 ms
50,408 KB
testcase_03 AC 53 ms
49,960 KB
testcase_04 AC 52 ms
50,232 KB
testcase_05 AC 52 ms
50,372 KB
testcase_06 AC 53 ms
50,320 KB
testcase_07 AC 52 ms
49,884 KB
testcase_08 AC 53 ms
50,032 KB
testcase_09 AC 52 ms
50,448 KB
testcase_10 AC 52 ms
50,220 KB
testcase_11 AC 51 ms
50,388 KB
testcase_12 AC 52 ms
50,400 KB
testcase_13 AC 51 ms
50,260 KB
testcase_14 AC 52 ms
50,328 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest180629;
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 C {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		char[] s = ns().toCharArray();
		try {
			out.println(new Parser3().eval(s));
		} catch (Throwable e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
	
	public static class Parser3 {
		// exp = exp2 ([+-] exp2)*
		// exp2 = exp3 ([*] exp3)*
		// exp3 = exp4 | '(' exp ')'
		// exp4 = -*digit+{[\.]digit+}
		// digit = [0-9]
		char[] str;
		int pos;
		int n;
		
		public long eval(char[] str) throws Exception
		{
			this.str = str;
			pos = 0;
			n = this.str.length;
			long ret = exp();
			if(pos < n)throw new AssertionError(-1);
			return ret;
		}
		
		public long exp() throws Exception
		{
			long v = exp2();
			while(pos < n && (str[pos] == '+' || str[pos] == '-')){
				char op = str[pos];
				pos++;
				if(pos >= n)throw new AssertionError(pos);
				long w = exp2();
				if(op == '+'){
					v += w;
				}else{
					v -= w;
				}
			}
			return v;
		}
		
		public long exp2() throws Exception
		{
			long v = exp3();
			while(pos < n && (str[pos] == '*')){
//				char op = str[pos];
				pos++;
				if(pos >= n)throw new AssertionError(pos);
				long w = exp3();
				v *= w;
			}
			return v;
		}
		
		public long exp3() throws Exception
		{
			if(pos < n && str[pos] == '('){
				pos++;
				long v = exp();
				if(!(pos < n && str[pos] == ')'))throw new AssertionError(pos);
				pos++;
				return v;
			}else{
				return exp4();
			}
		}
		
		public long exp4() throws Exception
		{
			boolean minus = false;
			while(pos < n && str[pos] == '-'){
				minus = !minus;
				pos++;
			}
			boolean present = false;
			long v = 0;
			while(pos < n && str[pos] >= '0' && str[pos] <= '9'){
				v = v * 10 + digit();
				present = true;
			}
			if(!present)throw new AssertionError(pos);
			if(minus)v = -v;
			return v;
		}
		
		public long digit() throws Exception
		{
			if(pos == n)throw new AssertionError(pos);
			return str[pos++] - '0';
		}
	}
	
	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");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new C().run(); }
	
	private byte[] inbuf = new byte[1024];
	public 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 int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	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[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	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