結果

問題 No.708 （＋ー）の式
ユーザー holegumaholeguma
提出日時 2019-07-17 20:51:24
言語 Java21
(openjdk 21)
結果
AC  
実行時間 49 ms / 2,000 ms
コード長 3,637 bytes
コンパイル時間 2,872 ms
コンパイル使用メモリ 78,536 KB
実行使用メモリ 36,980 KB
最終ジャッジ日時 2024-06-02 10:43:10
合計ジャッジ時間 3,752 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 46 ms
36,840 KB
testcase_01 AC 45 ms
36,720 KB
testcase_02 AC 49 ms
36,560 KB
testcase_03 AC 45 ms
36,416 KB
testcase_04 AC 47 ms
36,844 KB
testcase_05 AC 47 ms
36,660 KB
testcase_06 AC 47 ms
36,544 KB
testcase_07 AC 47 ms
36,672 KB
testcase_08 AC 45 ms
36,772 KB
testcase_09 AC 45 ms
36,912 KB
testcase_10 AC 45 ms
36,748 KB
testcase_11 AC 45 ms
36,908 KB
testcase_12 AC 44 ms
36,532 KB
testcase_13 AC 46 ms
36,920 KB
testcase_14 AC 47 ms
36,980 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class Main {

	static PrintWriter out;
	static InputReader ir;

	static void solve() {
		char[] s = ir.next().toCharArray();
		out.println(calc(s, 0, s.length - 1));
	}

	static int calc(char[] s, int l, int r) {
		int signum = 1;
		int res = 0;
		for (int i = l; i <= r; i++) {
			if (s[i] >= '0' && s[i] <= '9') {
				res += signum * (s[i] - '0');
			} else if (s[i] == '+') {
				signum = 1;
			} else if (s[i] == '-') {
				signum = -1;
			} else if (s[i] == '(') {
				int d = 1;
				int pre = ++i;
				while (d != 0) {
					if (s[i] == '(')
						d++;
					else if (s[i] == ')')
						d--;
					i++;
				}
				i -= 2;
				res += signum * calc(s, pre, i++);
			}
		}
		return res;
	}

	public static void main(String[] args) {
		ir = new InputReader(System.in);
		out = new PrintWriter(System.out);
		solve();
		out.flush();
	}

	static class InputReader {

		private InputStream in;
		private byte[] buffer = new byte[1024];
		private int curbuf;
		private int lenbuf;

		public InputReader(InputStream in) {
			this.in = in;
			this.curbuf = this.lenbuf = 0;
		}

		public boolean hasNextByte() {
			if (curbuf >= lenbuf) {
				curbuf = 0;
				try {
					lenbuf = in.read(buffer);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (lenbuf <= 0)
					return false;
			}
			return true;
		}

		private int readByte() {
			if (hasNextByte())
				return buffer[curbuf++];
			else
				return -1;
		}

		private boolean isSpaceChar(int c) {
			return !(c >= 33 && c <= 126);
		}

		private void skip() {
			while (hasNextByte() && isSpaceChar(buffer[curbuf]))
				curbuf++;
		}

		public boolean hasNext() {
			skip();
			return hasNextByte();
		}

		public String next() {
			if (!hasNext())
				throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (!isSpaceChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}

		public int nextInt() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

		public long nextLong() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

		public double nextDouble() {
			return Double.parseDouble(next());
		}

		public int[] nextIntArray(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}

		public long[] nextLongArray(int n) {
			long[] a = new long[n];
			for (int i = 0; i < n; i++)
				a[i] = nextLong();
			return a;
		}

		public char[][] nextCharMap(int n, int m) {
			char[][] map = new char[n][m];
			for (int i = 0; i < n; i++)
				map[i] = next().toCharArray();
			return map;
		}
	}

	static void tr(Object... o) {
		out.println(Arrays.deepToString(o));
	}
}
0