Submission #3012794

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int d[3] = {0}, t, now = 0;
string s;

int main() {
  cin >> s >> t;
  for(int i = 0; i < s.size(); ++i) {
    if(s[i] == 'L') ++d[0];
    if(s[i] == 'R') --d[0];
    if(s[i] == 'U') ++d[1];
    if(s[i] == 'D') --d[1];
    if(s[i] == '?') ++d[2];
  }
  now = max(d[0], -d[0]) + max(d[1], -d[1]);
  if(t == 1)
    cout << now + d[2] << endl;
  else {
    if(now >= d[2])
      cout << now - d[2] << endl;
    else
      cout << (d[2] - now) % 2 << endl;
  }
}

Submission Info

Judge Result