Good Bye 2017 F-New Year and Rainbow Roads

#include<iostream>
#include<algorithm>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<stack>
#include<map>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
#define kuaidian ios::sync_with_stdio(0);

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 3e5 + 7, maxd = 1e5 + 7;
const int mod = 1e9 + 7;
const ll INF = 0x7f7f7f7f7f7f7f7f;

pair<ll, ll> a[maxn]; // 位置和颜色
vector<ll> r, g, b;
int m, n;
ll ans = 0, mode = 0;;

void init() {
    scanf("%d", &n);
    char ch;
    for(ll i = 1; i <= n; ++i) {
        scanf("%d %c", &a[i].first, &ch);
        //cout << a[i].first << " " << ch << " ++= " << endl;
        if(ch == 'R') {
            a[i].second = 1; r.push_back(a[i].first);
        }
        else if(ch == 'G') {
            a[i].second = 3; g.push_back(a[i].first);
        }
        else if(ch == 'B') {
            a[i].second = 2; b.push_back(a[i].first);
        }
        if(ch == 'G') mode = 1;
    }
}

void solve() {
    if(mode == 0) { // 没有 G 存在
        ll pre = -1;
        for(ll i = 1; i <= n; ++i) {
            if(a[i].second != 1) continue;
            if(pre != -1) {
                ans += (a[i].first - pre);
            }
            pre = a[i].first;
        }
        pre = -1;
        for(ll i = 1; i <= n; ++i) {
            if(a[i].second != 2) continue;
            if(pre != -1) {
                ans += (a[i].first - pre);
            }
            pre = a[i].first;
        }
    }
    else {
        for(ll i = 0; i < g.size(); ++i) {

            if(i == 0) {
                ll cas = lower_bound(b.begin(), b.end(), g[i]) - b.begin();
                if(cas != 0) ans += (g[i] - b[0]);
                cas = lower_bound(r.begin(), r.end(), g[i]) - r.begin();
                if(cas != 0) ans += (g[i] - r[0]);
            }
            if(i == g.size() - 1) {
                ll cas = lower_bound(b.begin(), b.end(), g[i]) - b.begin();
                if(cas != b.size()) ans += (b[b.size()-1] - g[i]);
                cas = lower_bound(r.begin(), r.end(), g[i]) - r.begin();
                if(cas != r.size()) ans += (r[r.size()-1] - g[i]);
            }
            if(i != g.size() - 1) {
                ll maxa = INF, maxb = INF;

                ll st = lower_bound(b.begin(), b.end(), g[i]) - b.begin();
                ll ed = lower_bound(b.begin(), b.end(), g[i+1]) - b.begin() - 1;
                if(st < b.size() && b[st] < g[i + 1]) {
                    ll temp = b[st] - g[i];
                    temp = max(temp, g[i + 1] - b[ed]);
                    for(ll j = st + 1; j <= ed; ++j) {
                        temp = max(temp, b[j] - b[j-1]);
                    }
                    maxa = temp;
                }

                st = lower_bound(r.begin(), r.end(), g[i]) - r.begin();
                ed = lower_bound(r.begin(), r.end(), g[i+1]) - r.begin() - 1;
                if(st < r.size() && r[st] < g[i + 1]) {
                    ll temp = r[st] - g[i];
                    temp = max(temp, g[i + 1] - r[ed]);
                    for(ll j = st + 1; j <= ed; ++j) {
                        temp = max(temp, r[j] - r[j-1]);
                    }
                    maxb = temp;
                }

                ll sum = g[i + 1] - g[i];

                if(maxa == INF && maxb == INF) ans += sum;
                else if(maxa == INF) ans += (sum*2 - maxb);
                else if(maxb == INF) ans += (sum*2 - maxa);
                else ans += min(sum*2, sum*3 - maxa - maxb);
            }
        }
    }
    printf("%lld\n", ans);
}

int main() {

    init();
    solve();

    return 0;
}