#877742 (C++23) No.2338 Range AtCoder Query

提出ソース

結果

問題	No.2338 Range AtCoder Query
ユーザー	SnowBeenDiding
提出日時	2023-06-03 01:46:18
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	10,141 bytes
コンパイル時間	6,128 ms
コンパイル使用メモリ	326,880 KB
実行使用メモリ	149,536 KB
最終ジャッジ日時	2024-06-09 03:04:40
合計ジャッジ時間	13,047 ms
ジャッジサーバーID （参考情報）	judge2 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,816 KB
testcase_02	AC	2 ms 6,816 KB
testcase_03	AC	1 ms 6,940 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	1 ms 6,940 KB
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	RE	-
testcase_27	RE	-
testcase_28	RE	-
testcase_29	WA	-
testcase_30	WA	-
testcase_31	AC	1,098 ms 149,532 KB
testcase_32	AC	1,008 ms 149,408 KB
testcase_33	WA	-
testcase_34	WA	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
const long long MOD = 998244353;
// using mint = modint1000000007;
// const long long MOD = 1000000007;
// using mint = modint;//mint::set_mod(MOD);

#include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define repeq(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); i++)
#define repreq(i, a, b) for (ll i = (ll)(a); i >= (ll)(b); i--)
#define endl '\n'  // fflush(stdout);
#define cYes cout << "Yes" << endl
#define cNo cout << "No" << endl
#define sortr(v) sort(v, greater<>())
#define pb push_back
#define pob pop_back
#define mp make_pair
#define mt make_tuple
#define FI first
#define SE second
#define ALL(v) (v).begin(), (v).end()
#define INFLL 3000000000000000100LL
#define INF 1000000100
#define PI acos(-1.0L)
#define TAU (PI * 2.0L)

using namespace std;

typedef long long ll;
typedef pair<ll, ll> Pll;
typedef tuple<ll, ll, ll> Tlll;
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef vector<ll> Vl;
typedef vector<Vl> VVl;
typedef vector<VVl> VVVl;
typedef vector<Tlll> VTlll;
typedef vector<mint> Vm;
typedef vector<Vm> VVm;
typedef vector<string> Vs;
typedef vector<double> Vd;
typedef vector<char> Vc;
typedef vector<bool> Vb;
typedef vector<Pll> VPll;
typedef priority_queue<ll> PQl;
typedef priority_queue<ll, vector<ll>, greater<ll>> PQlr;

/* inout */
ostream &operator<<(ostream &os, mint const &m) {
    os << m.val();
    return os;
}
istream &operator>>(istream &is, mint &m) {
    long long n;
    is >> n, m = n;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    int n = v.size();
    rep(i, 0, n) { os << v[i] << " \n"[i == n - 1]; }
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<vector<T>> &v) {
    int n = v.size();
    rep(i, 0, n) os << v[i];
    return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, pair<T, S> const &p) {
    os << p.first << ' ' << p.second;
    return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, const map<T, S> &mp) {
    for (auto &[key, val] : mp) {
        os << key << ':' << val << '\n';
    }
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &st) {
    auto itr = st.begin();
    for (int i = 0; i < (int)st.size(); i++) {
        os << *itr << (i + 1 != (int)st.size() ? ' ' : '\n');
        itr++;
    }
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, multiset<T> &st) {
    auto itr = st.begin();
    for (int i = 0; i < (int)st.size(); i++) {
        os << *itr << (i + 1 != (int)st.size() ? ' ' : '\n');
        itr++;
    }
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, queue<T> q) {
    while (q.size()) {
        os << q.front();
        q.pop();
        os << " \n"[q.empty()];
    }
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, stack<T> st) {
    vector<T> v;
    while (st.size()) {
        v.push_back(st.top());
        st.pop();
    }
    reverse(ALL(v));
    os << v;
    return os;
}
template <class T, class Container, class Compare>
ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq) {
    vector<T> v;
    while (pq.size()) {
        v.push_back(pq.top());
        pq.pop();
    }
    os << v;
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
    for (T &in : v) is >> in;
    return is;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
    is >> p.first >> p.second;
    return is;
}

/* useful */
template <typename T>
int SMALLER(vector<T> &a, T x) {
    return lower_bound(a.begin(), a.end(), x) - a.begin();
}
template <typename T>
int orSMALLER(vector<T> &a, T x) {
    return upper_bound(a.begin(), a.end(), x) - a.begin();
}
template <typename T>
int BIGGER(vector<T> &a, T x) {
    return a.size() - orSMALLER(a, x);
}
template <typename T>
int orBIGGER(vector<T> &a, T x) {
    return a.size() - SMALLER(a, x);
}
template <typename T>
int COUNT(vector<T> &a, T x) {
    return upper_bound(ALL(a), x) - lower_bound(ALL(a), x);
}
template <typename T, typename S>
bool chmax(T &a, S b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T, typename S>
bool chmin(T &a, S b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T>
void press(T &v) {
    v.erase(unique(ALL(v)), v.end());
}
template <typename T>
vector<int> zip(vector<T> b) {
    pair<T, int> p[b.size() + 10];
    int a = b.size();
    vector<int> l(a);
    for (int i = 0; i < a; i++) p[i] = mp(b[i], i);
    sort(p, p + a);
    int w = 0;
    for (int i = 0; i < a; i++) {
        if (i && p[i].first != p[i - 1].first) w++;
        l[p[i].second] = w;
    }
    return l;
}
template <typename T>
vector<T> vis(vector<T> &v) {
    vector<T> S(v.size() + 1);
    rep(i, 1, S.size()) S[i] += v[i - 1] + S[i - 1];
    return S;
}

ll dem(ll a, ll b) { return ((a + b - 1) / (b)); }
ll dtoll(double d, int g) { return round(d * pow(10, g)); }
string tobin(ll n, ll d) {
    string ret;
    rep(i, 0, d) {
        ret += (n % 2) ? '1' : '0';
        n /= 2;
    }
    reverse(ALL(ret));
    return ret;
}

const double EPS = 1e-10;

void init() {
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(12);
}

// do {} while (next_permutation(ALL(vec)));

/********************************** START **********************************/

void sol();

int main() {
    init();
    int q = 1;
    // cin >> q;
    while (q--) sol();
    return 0;
}

/********************************** SOLVE **********************************/

struct Mo {
    int n;
    vector<pair<int, int>> lr;

    explicit Mo(int n) : n(n) {}

    void add(int l, int r) { /* [l, r) */
        lr.emplace_back(l, r);
    }

    template <typename AL, typename AR, typename EL, typename ER, typename O>
    void build(const AL &add_left, const AR &add_right, const EL &erase_left,
               const ER &erase_right, const O &out) {
        int q = (int)lr.size();
        int bs = n / min<int>(n, sqrt(q));
        vector<int> ord(q);
        iota(begin(ord), end(ord), 0);
        sort(begin(ord), end(ord), [&](int a, int b) {
            int ablock = lr[a].first / bs, bblock = lr[b].first / bs;
            if (ablock != bblock) return ablock < bblock;
            return (ablock & 1) ? lr[a].second > lr[b].second
                                : lr[a].second < lr[b].second;
        });
        int l = 0, r = 0;
        for (auto idx : ord) {
            while (l > lr[idx].first) add_left(--l);
            while (r < lr[idx].second) add_right(r++);
            while (l < lr[idx].first) erase_left(l++);
            while (r > lr[idx].second) erase_right(--r);
            out(idx);
        }
    }

    template <typename A, typename E, typename O>
    void build(const A &add, const E &erase, const O &out) {
        build(add, add, erase, erase, out);
    }
};

void sol() {
    int n, m, q;
    cin >> n >> m >> q;

    Vi p(n);
    Vs s(n);
    rep(i, 0, n) cin >> p[i] >> s[i];
    Vb as(n);
    rep(i, 0, n) as[i] = (s[i] == "AC");

    Mo mo(n);
    vector<deque<pair<int, int>>> v(m + 10);
    Vi ac(q), wa(q);
    Vi a(m + 10);
    int nac = 0, nwa = 0;

    auto zeroac = [&](int i) {
        bool ret = 0;
        if (v[i].size() == 0)
            ret = 1;
        else if (v[i].size() == 1 && v[i].front().FI == 0)
            ret = 1;
        return ret;
    };

    auto addl = [&](int i) {
        if (as[i]) {
            if (zeroac(p[i])) {
                nac++;
                // if (v[p[i]].size()) nwa -= v[p[i]].front().SE;
            }
            /*add*/
            if (v[p[i]].size() == 0 || v[p[i]].front().FI == 0) {
                v[p[i]].push_front({1, 1});
            } else {
                v[p[i]].front().SE++;
            }
            /*add*/

        } else {
            if (!zeroac(p[i])) {
                nwa++;
                // if (v[p[i]].size()) nwa -= v[p[i]].front().SE;
            }
            /*add*/
            if (v[p[i]].size() == 0 || v[p[i]].front().FI == 1) {
                v[p[i]].push_front({0, 1});
            } else {
                v[p[i]].front().SE++;
            }
            /*add*/
        }
    };
    auto addr = [&](int i) {
        if (as[i]) {
            if (zeroac(p[i])) {
                if (v[p[i]].size()) {
                    nwa += v[p[i]].front().SE;
                }
                nac++;
            }

            /*add*/
            if (v[p[i]].size() == 0 || v[p[i]].back().FI == 0) {
                v[p[i]].push_back({1, 1});
            } else {
                v[p[i]].back().SE++;
            }
            /*add*/

        } else {
            if (zeroac(p[i])) {
            } else {
            }

            /*add*/
            if (v[p[i]].size() == 0 || v[p[i]].back().FI == 1) {
                v[p[i]].push_back({0, 1});
            } else {
                v[p[i]].back().SE++;
            }
            /*add*/
        }
    };
    auto erasel = [&](int i) {
        if (--v[p[i]].front().SE == 0) v[p[i]].pop_front();
        if (as[i]) {
            if (zeroac(p[i])) {
                nac--;
            } else {
                if (v[p[i]].front().FI == 0) nwa += v[p[i]].front().SE;
            }
        } else {
            if (zeroac(p[i])) {
            } else {
                nwa--;
            }
        }
    };
    auto eraser = [&](int i) {
        if (--v[p[i]].back().SE == 0) v[p[i]].pop_back();
        if (as[i]) {
            if (zeroac(p[i])) {
                nac--;
                if (v[p[i]].size()) nwa -= v[p[i]].front().SE;
            } else {
            }
        } else {
        }
    };
    auto out = [&](int i) {
        ac[i] = nac;
        wa[i] = nwa;
    };
    rep(i, 0, q) {
        ll qw, er;
        cin >> qw >> er;
        mo.add(--qw, er);
    }
    mo.build(addl, addr, erasel, eraser, out);
    rep(i, 0, n) cout << ac[i] << ' ' << wa[i] << endl;
}

yukicoder

結果

テストケース

ソースコード