結果

問題 No.3814 Typical AWC Query
コンテスト
ユーザー dyktr_06
提出日時 2026-09-21 04:34:29
言語 C++17
(gcc 15.3.0 + boost 1.92.0 + ACL)
コンパイル:
g++-15 -O2 -fplugin=/usr/lib/yukicoder/noavx512-gcc15.so -lm -std=c++17 -Wuninitialized -DONLINE_JUDGE -o a.out _filename_
実行:
./a.out
結果
WA  
実行時間 -
コード長 9,651 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 1,735 ms
コンパイル使用メモリ 229,984 KB
実行使用メモリ 806,400 KB
最終ジャッジ日時 2026-11-20 20:50:51
合計ジャッジ時間 11,311 ms
ジャッジサーバーID
(参考情報)
judge3_0 / judge1_0
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 19 WA * 1
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code

#include <bits/stdc++.h>

using namespace std;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))

using i64 = int64_t;
using i128 = __int128_t;

using ll = long long;
using ul = unsigned long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vll = vector<long long>;
using vull = vector<unsigned long long>;
using vc = vector<char>;
using vst = vector<string>;
using vd = vector<double>;
using vld = vector<long double>;
using P = pair<long long, long long>;

template<class T> long long sum(const T &a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T &a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T &a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);

template<class T> inline bool chmax(T &a, T b) { if(a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, T b) { if(a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } 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() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int) st.size(); ++i){ os << *itr << (i + 1 != (int) st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U>
void inGraph(vector<vector<T>> &G, U n, U m, bool directed = true, bool zero_index = true){
    G.resize(n);
    for(int i = 0; i < m; i++){
        int a, b;
        cin >> a >> b;
        if(!zero_index) a--, b--;
        G[a].push_back(b);
        if(!directed) G[b].push_back(a);
    }
}

template <typename T>
long long binary_search(long long ok, long long ng, T check){
    while(abs(ok - ng) > 1){
        long long mid = (ok + ng) / 2;
        if(check(mid)) ok = mid;
        else ng = mid;
    }
    return ok;
}

template <typename T>
long double binary_search_real(long double ok, long double ng, T check, int iter = 100){
    for(int i = 0; i < iter; ++i){
        long double mid = (ok + ng) / 2;
        if(check(mid)) ok = mid;
        else ng = mid;
    }
    return ok;
}

long long trisum(long long a, long long b){
    if(a > b) return 0;
    long long res = ((b - a + 1) * (a + b)) / 2;
    return res;
}

template <typename T>
T intpow(T x, int n){
    T ret = 1;
    while(n > 0) {
        if(n & 1) (ret *= x);
        (x *= x);
        n >>= 1;
    }
    return ret;
}

template <typename T>
T getDivision(T a, T b){
    if(b == 0) return -1;
    if(a >= 0 && b > 0){
        return a / b;
    } else if(a < 0 && b > 0){
        return a / b - (a % b != 0);
    } else if(a >= 0 && b < 0){
        return a / b;
    } else{
        return a / b + (a % b != 0);
    }
}

template <typename T>
T getReminder(T a, T b){
    if(b == 0) return -1;
    if(a >= 0 && b > 0){
        return a % b;
    } else if(a < 0 && b > 0){
        return ((a % b) + b) % b;
    } else if(a >= 0 && b < 0){
        return a % b;
    } else{
        return (abs(b) - abs(a % b)) % b;
    }
}

template<class T, class U> inline T vin(T &vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T &a, const Ts&... b){ cout << a; ((cout << ' ' << b), ...); cout << '\n'; }
void fout(){ cout << endl; }
template<class T, class... Ts> void fout(const T &a, const Ts&... b){ cout << a; ((cout << ' ' << b), ...); cout << endl; }
void debug(){ cerr << '\n'; }
template<class T, class... Ts> void debug(const T &a, const Ts&... b){ cerr << a; ((cout << ' ' << b), ...); cerr << '\n'; }

ll T;

void input(){
    in(T);
}

void solve(){
    ll n, m; in(n, m);
    string s; in(s);
    vector<vll> G(n);
    rep(i, m){
        ll u, v; in(u, v);
        u--, v--;
        G[u].push_back(v);
        G[v].push_back(u);
    }

    vll larges;
    vll is_large(n, -1);
    rep(i, n){
        if((ll) G[i].size() >= 80){
            is_large[i] = larges.size();
            larges.push_back(i);
        }
    }
    ll len = larges.size();

    vector<vll> G2(n);
    vll cnta(n), cntc(n);
    rep(i, n){
        for(auto j : G[i]){
            if(is_large[j] != -1) G2[i].push_back(j);
        }
    }

    vll kiyoa(n), kiyoc(n);
    vector<vll> kiyo(len, vll(len));
    ll ans_small = 0;
    vll sa(n), sw(n), sc(n);
    auto add_small = [&](ll v, char c, ll cnt){
        if(c == 'A'){
            for(auto x : G[v]){
                if(is_large[x] != -1){
                    cnta[x] += cnt;
                }else{
                    ll tmpc = 0;
                    for(auto y : G[x]){
                        tmpc += sc[y];
                        if(is_large[y] != -1){
                            kiyoc[y] += cnt * sw[x];
                        }
                    }
                    ans_small += tmpc * cnt * sw[x];
                }
            }
            sa[v] += cnt;
        }else if(c == 'C'){
            for(auto x : G[v]){
                if(is_large[x] != -1){
                    cntc[x] += cnt;
                }else{
                    ll tmpa = 0;
                    for(auto y : G[x]){
                        tmpa += sa[y];
                        if(is_large[y] != -1){
                            kiyoa[y] += cnt * sw[x];
                        }
                    }
                    ans_small += tmpa * cnt * sw[x];
                }
            }
            sc[v] += cnt;
        }

        if(c == 'W'){
            ll tmpa = 0, tmpc = 0;
            for(auto x : G[v]){
                tmpa += sa[x];
                tmpc += sc[x];
                if(is_large[x] == -1) continue;
                for(auto y : G[v]){
                    if(is_large[y] == -1) continue;
                    if(x == y) continue;
                    kiyo[is_large[x]][is_large[y]] += cnt;
                }
            }
            ans_small += tmpa * tmpc * cnt;
            sw[v] += cnt;
        }
    };

    auto add_large = [&](ll v, char c, ll cnt){
        if(c == 'A'){
            for(auto w : G2[v]) cnta[w] += cnt;
            ans_small += kiyoa[v] * cnt;
            sa[v] += cnt;
        }else if(c == 'C'){
            for(auto w : G2[v]) cntc[w] += cnt;
            ans_small += kiyoc[v] * cnt;
            sc[v] += cnt;
        }
        if(c == 'W'){
            sw[v] += cnt;
        }
        ll id = is_large[v];
        rep(i, len){
            kiyoc[larges[i]] += kiyo[id][i] * sa[v];
            kiyoa[larges[i]] += kiyo[id][i] * sc[v];
        }
    };

    rep(i, n){
        if(is_large[i] == -1){
            add_small(i, s[i], 1);
        }else{
            add_large(i, s[i], 1);
        }
    }

    ll q; in(q);
    while(q--){
        ll v; in(v);
        v--;
        char x; in(x);
        if(is_large[v] == -1){
            add_small(v, s[v], -1);
            s[v] = x;
            add_small(v, s[v], 1);
        }else{
            add_large(v, s[v], -1);
            s[v] = x;
            add_large(v, s[v], 1);
        }

        ll ans_large = 0;
        for(auto w : larges){
            ans_large += cnta[w] * cntc[w] * sw[w];
        }
        out(ans_small + ans_large);
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);

    T = 1;
    // input();
    while(T--) solve();
}
0