problem-sulving/CodeForces-1066C.cpp at main · sweetpotatoX/problem-sulving · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
//
// Created by abdob on 10/29/2022.
//
#include<bits/stdc++.h>
using namespace std;

//{
#define si(a) scanf("%d",&a)
#define sii(a,b) scanf("%d %d",&a,&b);
#define siii(a,b,c) scanf("%d %d %d",&a,&b,&c);

#define sl(a) scanf("%lld",&a)
#define sll(a,b) scanf("%lld %lld",&a,&b);
#define slll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);

#define cel(n,k) ((n-1)/k+1)
#define sets(a) memset(a, -1, sizeof(a))
#define clr(a) memset(a, 0, sizeof(a))
#define max(a,b) ((a)>(b)? (a):(b))
#define min(a,b) ((a)<(b)? (a):(b))
#define fr(n) for(int i=0;i<n;i++)
#define fr1(n) for(int i=1;i<=n;i++)
#define pb push_back
#define all(v) v.begin(),v.end()
#define mp make_pair
#define ff first
#define ss second
#define INF 10000007
#define fastIO() ios_base::sync_with_stdio(false); cin.tie(NULL);

typedef long long i64;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<long long,long long> pll;
//}

i64 n, left_a[1000006], right_a[1000006], le_a[1000006], rig_a[1000006], x;
i64 lefts=0, rights=0;

main(){
    sl(n);
    char q;

    fr1(n){
        scanf("\n%c %lld",&q,&x);
        //cin>>q>>x;
        if(q=='L'){
            rig_a[x]= lefts;
            lefts++;
            left_a[x]= lefts;
        }
        else if(q=='R'){
            le_a[x]= rights;
            rights++;
            right_a[x]= rights;

        }
        else{
            i64 ans= min(rig_a[x]+rights- right_a[x], le_a[x]+ lefts-left_a[x]);
            printf("%lld\n",ans);
        }


    }
}