Submission #58938616

---

Source Code Expand

/// Msaa el 5ra
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define F first
#define S second
#define f(i, a, b) for (int i = a; i < b; i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define sz(x) (int)(x).size()
#define mp(x, y) make_pair(x, y)
#define popCnt(x) (__builtin_popcountll(x))
//#define int ll

using ll = long long;
using ii = pair<int, int>;
using ull = unsigned long long;

const int N = 2e5 + 5, A = 26, LG = 19, MOD = (119 << 23) +1, MOD2 = 1e9 + 7;
const long double PI = acos(-1);
const long double EPS = 1e-7;

const ll MAX = 1e15;



void doWork() {

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

        char c;
        int x;
        cin >> c >> x;
        --x;
        if(c == 'L') {
            int cnt1 = 0, cnt2 = 0;
            int i = L, j = L;
            for(i = L; i != x && i != R; i = (i + 1) % n) cnt1 += 1;
            for(j = L; j != x && j != R; j = (j + n - 1) % n) cnt2 += 1;
            int val = INT_MAX;
            if(i!=R) val = min(val, cnt1);
            if(j!=R) val = min(val, cnt2);
            ans += val;
            L = x;
        }   else {
            int cnt1 = 0, cnt2 = 0;
            int i = R, j = R;
            for(i = R; i != x && i != L; i = (i + 1) % n) cnt1 += 1;
            for(j = R; j != x && j != L; j = (j + n - 1) % n) cnt2 += 1;
            int val = INT_MAX;
            if(i!=L) val = min(val, cnt1);
            if(j!=L) val = min(val, cnt2);
            ans += val;
            R = x;
        }

    }

    cout << ans << "\n";

}

int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int t = 1;
//  cin >> t;
  while (t--) {
    doWork();
  }
}

Submission Info

Judge Result