제출 #1290393

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1290393		tin_le	다리 (APIO19_bridges)	C++20	59 / 100	3094 ms	5348 KiB

bridges

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define vt vector
#define all(x) begin(x), end(x)
#define allr(x) rbegin(x), rend(x)
#define ub upper_bound
#define lb lower_bound
#define db double
#define ld long db
#define ll long long
#define ull unsigned long long
#define vi vt<int>
#define vvi vt<vi>
#define vvvi vt<vvi>
#define pii pair<int, int>
#define vpii vt<pii>
#define vvpii vt<vpii>
#define vll vt<ll>  
#define vvll vt<vll>
#define pll pair<ll, ll>    
#define vpll vt<pll>
#define vvpll vt<vpll>
#define ar(x) array<int, x>
#define var(x) vt<ar(x)>
#define vvar(x) vt<var(x)>
#define al(x) array<ll, x>
#define vall(x) vt<al(x)>
#define vvall(x) vt<vall(x)>
#define vs vt<string>
#define pb push_back
#define ff first
#define ss second
#define rsz resize
#define sum(x) (ll)accumulate(all(x), 0LL)
#define srt(x) sort(all(x))
#define srtR(x) sort(allr(x))
#define srtU(x) sort(all(x)), (x).erase(unique(all(x)), (x).end())
#define rev(x) reverse(all(x))
#define MAX(a) *max_element(all(a)) 
#define MIN(a) *min_element(all(a))
#define SORTED(x) is_sorted(all(x))
#define ROTATE(a, p) rotate(begin(a), begin(a) + p, end(a))
#define i128 __int128
#define IOS ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#if defined(LOCAL) && __has_include("debug.h")
  #include "debug.h"
#else
  #define debug(...)
  #define startClock
  #define endClock
  inline void printMemoryUsage() {}
#endif
template<class T> using max_heap = priority_queue<T>; template<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;
template<typename T, size_t N> istream& operator>>(istream& is, array<T, N>& arr) { for (size_t i = 0; i < N; i++) { is >> arr[i]; } return is; }
template<typename T, size_t N> istream& operator>>(istream& is, vector<array<T, N>>& vec) { for (auto &arr : vec) { is >> arr; } return is; }
template<typename T1, typename T2>  istream &operator>>(istream& in, pair<T1, T2>& input) { return in >> input.ff >> input.ss; }
template<typename T> istream &operator>>(istream &in, vector<T> &v) { for (auto &el : v) in >> el; return in; }
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
const static ll INF = 4e18 + 10;
const static int inf = 1e9 + 100;
const static int MX = 1e5 + 5;

class DSU { 
public: 
    int n, comp;  
    vi root, rank, col;  
    bool is_bipartite;  
    DSU(int n) {    
        this->n = n;    
        comp = n;
        root.rsz(n, -1), rank.rsz(n, 1), col.rsz(n, 0);
        is_bipartite = true;
    }
    
    int find(int x) {   
        if(root[x] == -1) return x; 
        int p = find(root[x]);
        col[x] ^= col[root[x]];
        return root[x] = p;
    }
    
    bool merge(int a, int b) {
        int u = find(a);
        int v = find(b);
        if (u == v) {
            if(col[a] == col[b]) {
                is_bipartite = false;
            }
            return 0;
        }
        if(rank[u] < rank[v]) {
            swap(u, v);
            swap(a, b);
        }
		comp--;
        root[v] = u;
        rank[u] += rank[v];
        if(col[a] == col[b])
            col[v] ^= 1;
        return 1;
    }
    
    bool same(int u, int v) {    
        return find(u) == find(v);
    }
    
    int get_rank(int x) {    
        return rank[find(x)];
    }
    
	vvi get_group() {
        vvi ans(n);
        for(int i = 0; i < n; i++) {
            ans[find(i)].pb(i);
        }
        sort(all(ans), [](const vi& a, const vi& b) {return a.size() > b.size();});
        while(!ans.empty() && ans.back().empty()) ans.pop_back();
        return ans;
    }
};

void solve() {
    int n, m; cin >> n >> m;
    vi u(m + 1), v(m + 1), d(m + 1);
    for(int i = 1; i <= m; i++) {
        cin >> u[i] >> v[i] >> d[i];
    }
    int q; cin >> q;
    vi ans(q, -1);
    const int B = sqrt(q) + 1;
    var(3) upd, queries;
    vi in(m + 1), used_edges(m + 1), used_nodes(n + 1), vis(n + 1);
    vvpii graph(n + 1);
    for(int i = 0; i < q; i++) {
        int t; cin >> t;
        if(t == 1) {
            int b, r; cin >> b >> r;
            upd.pb({b, r, i});
        } else {
            int s, w; cin >> s >> w;
            queries.pb({s, w, i});
        }
        if(!((i + 1) % B == 0 || i == q - 1)) continue;
        DSU root(n + 1);
        vi ord(m);
        iota(all(ord), 1);
        sort(all(ord), [&](int x, int y) {return d[x] > d[y];});
        sort(all(queries), [](const auto& x, const auto& y) {return x[1] > y[1];});
        for(const auto& [b, r, id] : upd) {
            in[b] = 1;
        }
        const int U = upd.size();
        int j = 0;
        for(const auto& [s, w, tq] : queries) {
            while(j < m && d[ord[j]] >= w) {
                if(!in[ord[j]]) {
                    root.merge(u[ord[j]], v[ord[j]]);
                }
                j++;
            }
            vi touch_edges, touch_nodes;
            for(int k = U - 1; k >= 0; k--) {
                const auto& [b, r, tu] = upd[k];
                if(tu > tq || used_edges[b]) continue;
                used_edges[b] = 1;
                int x = root.find(u[b]);
                int y = root.find(v[b]);
                if(x == y || r < w) continue;
                graph[x].pb({y, r});
                graph[y].pb({x, r});
            }
            for(const auto& [b, r, tu] : upd) {
                if(used_edges[b]) continue;
                used_edges[b] = 1;
                int x = root.find(u[b]);
                int y = root.find(v[b]);
                if(x == y || d[b] < w) continue;
                graph[x].pb({y, d[b]});
                graph[y].pb({x, d[b]});
            }
            vi now;
            auto dfs = [&](auto& dfs, int node) -> int {
                int res = root.get_rank(node);
                vis[node] = 1;
                now.pb(node);
                for(auto& [nei, we] : graph[node]) {
                    if(we < w || vis[nei]) continue;
                    res += dfs(dfs, nei);
                }
                return res;
            };
            ans[tq] = dfs(dfs, root.find(s));
            for(const auto& [b, r, tu] : upd) {
                used_edges[b] = 0;
                int x = root.find(u[b]);
                int y = root.find(v[b]);
                if(x == y) continue;
                vpii().swap(graph[x]);
                vpii().swap(graph[y]);
                vis[x] = vis[y] = 0;
            }
            for(auto& it : now) {
                vis[it] = 0;
            }
        }
        for(const auto& [b, r, _] : upd) {
            in[b] = 0;
            d[b] = r;
        }
        var(3)().swap(upd);
        var(3)().swap(queries);
    }
    for(auto& w : ans) {
        if(w != -1) {
            cout << w << '\n';
        }
    }
}

signed main() {
    IOS;
    startClock
    int t = 1;
    //cin >> t;
    for(int i = 1; i <= t; i++) {   
        //cout << "Case #" << i << ": ";  
        solve();
    }
    endClock;
    printMemoryUsage();
    return 0;
}

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