제출 #367727

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
367727		Jarif_Rahman	다리 (APIO19_bridges)	C++17	0 / 100	3091 ms	79724 KiB

bridges

#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
const int N = 5e4, M = 1e5, Q = 1e5, SQ = 316;
struct dsu{
    stack<tuple<int, int, int>> st;
    int n;
    int id[N];
    stack<int> comp[N];
    dsu(){
        n = N;
        for(int i = 0; i < n;  i++) id[i] = i, comp[i].push(i);
    }
    int unite(int a, int b){
        a = id[a], b = id[b];
        if(a == b) return 0;
        if(comp[a].size() > comp[b].size()) swap(a, b);
        st.push({a, b, (int)comp[a].size()});
        while(!comp[a].empty()){
            int x = comp[a].top(); comp[a].pop();
            id[x] = b;
            comp[b].push(x);
        }
        return 1;
    }
    void rollback(){
        auto [a, b, sz] = st.top(); st.pop();
        while(sz--){
            int x = comp[b].top(); comp[b].pop();
            id[x] = a;
            comp[a].push(x);
        }
    }
};
int sq;
tuple<ll, int, int> edge[M];
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m; cin >> n >> m;
    for(int i = 0; i < m; i++){
        int a, b; ll w; cin >> a >> b >> w; a--, b--;
        edge[i] = make_tuple(w, a, b);
    }
    int q; cin >> q;
    tuple<ll, int, int> query[Q];
    for(int i = 0; i < q; i++){
        int tt, s; ll w; cin >> tt >> s >> w; s--;
        query[i] = {tt, s, w};
    }
    vector<int> ans;
    dsu ds;
    tuple<ll, int, int> calc[SQ+1];
    bool ucng[M];
    for(int i = 0; i < m; i++) ucng[i] = 1;
    tuple<ll, int, int> edges[M];
    int cng[SQ+1];
    vector<pair<int, int>> upd[SQ+1];
    for(int qi = 0; qi < q; qi+=SQ){
        int ql = min(q-1, qi+SQ-1);
        int cnt = 0, cs = 0;
        for(int j = qi; j <= ql; j++){
            auto [tt, s, w] = query[j];
            if(tt == 1){
                ucng[s] = 0;
            }
            else{
                calc[cnt] = {w, s, cnt};
                cnt++;
            }
        }
        int inx = 0;
        for(int i = 0; i < m; i++){
            if(ucng[i]) edges[inx++] = edge[i];
            else cng[cs++] = i;
        }
        vector<int> anss(cnt);
        cnt = 0;
        for(int j = qi; j <= ql; j++){
            auto [tt, s, w] = query[j];
            if(tt == 1){
                get<0>(edge[s]) = w;
            }
            else{
                for(int i = 0; i < cs; i++){
                    auto [ww, a, b] = edge[cng[i]];
                    if(ww >= w) upd[cnt].pb({a, b});
                }
                cnt++;
            }
        }
        sort(edges, edges+inx);
        sort(calc, calc+cnt, greater<tuple<ll, int, int>>());
        int bc = inx-1;
        for(auto [w, s, in]: calc){
            while(bc >= 0 && get<0>(edges[bc]) >= w){
                auto [ww, a, b] = edges[bc]; bc--;
                ds.unite(a, b);
            }
            int k = 0;
            for(auto [a, b]: upd[in]) k+=ds.unite(a, b);
            anss[in] = ds.comp[ds.id[s]].size();
            while(k--) ds.rollback();
        }
        ans.insert(ans.end(), anss.begin(), anss.end());
        for(int i = 0; i < m; i++) ucng[i] = 1;
        while(!ds.st.empty()) ds.rollback();
        while(cnt > 0) upd[cnt-1].clear(), cnt--;
    }
    for(int x: ans) cout << x << "\n";
}

• Subtask 1: 0 / 13
• Subtask 2: 0 / 16
• Subtask 3: 0 / 17
• Subtask 4: 0 / 14
• Subtask 5: 0 / 13
• Subtask 6: 0 / 27