結果

問題 No.708 （＋ー）の式
ユーザー hiromi_ayasehiromi_ayase
提出日時 2018-06-29 22:44:52
言語 Java21
(openjdk 21)
結果
AC  
実行時間 79 ms / 2,000 ms
コード長 4,341 bytes
コンパイル時間 2,416 ms
コンパイル使用メモリ 84,012 KB
実行使用メモリ 51,388 KB
最終ジャッジ日時 2024-07-01 00:04:56
合計ジャッジ時間 4,280 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 77 ms
51,112 KB
testcase_01 AC 78 ms
51,228 KB
testcase_02 AC 77 ms
50,840 KB
testcase_03 AC 76 ms
51,000 KB
testcase_04 AC 77 ms
51,220 KB
testcase_05 AC 77 ms
51,388 KB
testcase_06 AC 77 ms
51,096 KB
testcase_07 AC 77 ms
51,352 KB
testcase_08 AC 77 ms
51,312 KB
testcase_09 AC 78 ms
51,032 KB
testcase_10 AC 78 ms
51,216 KB
testcase_11 AC 78 ms
51,304 KB
testcase_12 AC 78 ms
51,248 KB
testcase_13 AC 78 ms
51,180 KB
testcase_14 AC 79 ms
51,164 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 


class Parser3 {
  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';
  }

}
public class Main {


  private static void solve() {
    char[] s = ns();
    Parser3 p = new Parser3();
    try {
      System.out.println(p.eval(s));
    } catch (Exception e) {
      e.printStackTrace();
    }
  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}
0