Submission #58949148

---

Source Code Expand

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

void solve () {
  int n, q; cin >> n >> q;
  int ans = 0;
  int L = 0, R = 1;

  auto yo = [&] (int i, int j, int k) {
    int i2 = i;
    int ret = 0;
    while (i != j) {
      if (i == k) {
        ret = n + 495;
        break;
      }
      i++, ret++;
      if (i == n) i = 0;
    }

    int ret2 = 0;
    while (i2 != j) {
      if (i2 == k) {
        ret2 = n + 495;
      }
      i2--, ret2++;
      if (i2 == -1) i2 = n - 1;
    }
    return min(ret, ret2);
  };

  while (q--) {
    char h; cin >> h;
    int i; cin >> i; i--;
    if (h == 'L') {
      ans += yo(L, i, R);
      L = i;
    }
    else {
      ans += yo(R, i, L);
      R = i;
    }
  }

  cout << ans << "\n";
}

int main(){
  ios::sync_with_stdio(0), cin.tie(0);
  int t = 1;
  // cin >> t;
  for (int i = 1; i <= t; ++i) {
    solve();
  }
  return 0;
}

Submission Info

Judge Result