Submission #46004976

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/modint>

void solve(std::istream& is, std::ostream& os) {
    using Num = long long int;
    using ModInt = atcoder::modint998244353;
    Num n {0};
    Num k {0};
    is >> n >> k;

    std::vector<Num> fixed(n+1, 0);
    std::vector<Num> ns(n+1, 0);
    for(Num i{1}; i<=k; ++i) {
        char c {0};
        Num a {0};
        is >> c >> a;

        fixed.at(a) = i;
        if (c == 'L') {
            for(Num j{a}; j<=n; ++j) {
                ns.at(j) += 1;
            }
        } else {
            for(Num j{1}; j<=a; ++j) {
                ns.at(j) += 1;
            }
        }
    }

    ModInt combi {1};
    for(Num i{1}; i<=n; ++i) {
        if (fixed.at(i) == 0) {
            combi *= ns.at(i);
        }
    }

    os << combi.val() << "\n";
    return;
}

int main(void) {
    solve(std::cin, std::cout);
    return 0;
}

Submission Info

Judge Result