Submission #924392

---

Source Code Expand

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;
import java.util.function.BiFunction;

public class Main {
  Scanner sc = new Scanner(System.in);

  public static void main(String[] args) {
    new Main().run();
  }

  int[][] ofs = {
      {-1, 0},
      {1, 0},
      {0, 1},
      {0, -1}
  };
  String list = "LRUD?";

  void run() {
    String str = sc.next();
    int u = 0;
    int v = 0;
    int x = 0;
    int y = 0;
    for (int i = 0; i < str.length(); ++i) {
      char c = str.charAt(i);
      int idx = list.indexOf(c);
      if (idx < 4) {
        x += ofs[idx][0];
        y += ofs[idx][1];
      } else {
        ++u;
        --v;
      }
    }
    int T = ni();
    int h = Math.abs(x) + Math.abs(y);
    if (T == 1) {
      System.out.println(h + u);
    } else {
      System.out.println(h + v);
    }
  }

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

  void debug(Object... os) {
    System.err.println(Arrays.deepToString(os));
  }

  class BIT<T> {
    int n;
    ArrayList<T> bit;
    BiFunction<T, T, T> bif;

    BIT(int n, BiFunction<T, T, T> bif, T defaultValue) {
      this.n = n;
      bit = new ArrayList<>(n + 1);
      for (int i = 0; i < n + 1; ++i) {
        bit.add(defaultValue);
      }
      this.bif = bif;
    }

    void update(int i, T v) {
      for (int x = i; x <= n; x += x & -x) {
        bit.set(x, bif.apply(bit.get(x), v));
      }
    }

    T reduce(int i, T defaultValue) {
      T ret = defaultValue;
      for (int x = i; x > 0; x -= x & -x) {
        ret = bif.apply(ret, bit.get(x));
      }
      return ret;
    }
  }

}

Submission Info

Judge Result